Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!elroy.jpl.nasa.gov!decwrl!mcnc!unccvax!cs00chs
From: cs00chs@unccvax.uncc.edu (charles spell)
Newsgroups: comp.databases
Subject: Btree+ (indexing methods)
Keywords: index, btree
Message-ID: <3459@unccvax.uncc.edu>
Date: 10 Jun 91 18:56:58 GMT
Organization: University of NC at Charlotte
Lines: 20


I am looking for a good reference (with C source) on the most recent methods
for indexing (with performance and simplicity as top priorities). I have 
rewritten the btree algorithms in _C Database Development_ by Al Stevens.

_C Database_ rivals informix3.x in performance in all areas except when
there exists many duplicate keys. I have fixed a few bugs and converted the
to system to mock informix3.X (minus the serial key and permissions) multi-
user. Now I am looking for some even faster algorithms than btree. Would
btree+ be a good alternative?


uunet!mcnc!unccvax!cs00chs

jjr@clt2.pa.dec.com
-- 
 .--------------------------.  ...  |On the border of your mind lies a place
 |uunet!mcnc!unccvax!cs00chs|  (")  |where dreams and reality are one...I will 
 `--------------------------'-w-U-w-|take you there, for I am the subject...
 \%\%\%\%\%\%\%\%\%\%\%\%\%\%\%\%\%\|the subject of your imagination. -Aldo Nova