Path: news.easynews.com!newsfeed1.easynews.com!easynews.com!easynews!newsfeed.news2me.com!newsfeed.icl.net!newsfeed.fjserv.net!newsfeed.icl.net!newsfeed.fjserv.net!syros.belnet.be!naxos.belnet.be!news.belnet.be!news.uia.ac.be!not-for-mail From: hidders@REMOVE.THIS.uia.ua.ac.be (Jan Hidders) Newsgroups: comp.databases.theory Subject: Re: Theory of Timeseries extensions to SQL and database Followup-To: comp.databases.theory Date: 30 Oct 2002 11:06:28 +0100 Organization: University of Antwerp Lines: 18 Message-ID: <3dbfaf24$1@news.uia.ac.be> References: <3dbd0d3f$1@news.uia.ac.be> Reply-To: hidders@uia.ua.ac.be (Jan Hidders) NNTP-Posting-Host: hnets.uia.ac.be X-Trace: naxos.belnet.be 1035972390 28332 143.169.254.1 (30 Oct 2002 10:06:30 GMT) X-Complaints-To: abuse@belnet.be NNTP-Posting-Date: Wed, 30 Oct 2002 10:06:30 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Originator: hidders@hcoss.uia.ac.be (Jan Hidders) X-Original-NNTP-Posting-Host: hmacs.uia.ac.be X-Original-Trace: 30 Oct 2002 11:06:28 +0100, hmacs.uia.ac.be Xref: newsfeed1.easynews.com comp.databases.theory:23197 X-Received-Date: Wed, 30 Oct 2002 03:44:01 MST (news.easynews.com) David wrote: > >Click on http://www.sandtechnology.co.uk/products/index.html then Library >then Nucleus Server Whitepaper. It is kind of hidden away. Hidden away in the UK. :-) Found it, thanks. >Any idea how a system that replaced the bit array with a hashtable might >perform? Hard to say. Since I don't know their compression technique I cannot say under which circumstances it performs good or bad. My gut feeling is that if you split the original table in binary tables, replace the actual values with references to them and introduce the proper indices (hash table or otherwise) that will be a pretty good general solution, especially if some of these tables/indices can be kept in main memory. -- Jan Hidders