Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!zaphod.mps.ohio-state.edu!think.com!mintaka!bloom-beacon!eru!hagbard!sunic!ugle.unit.no!nuug!ulrik!tarjeij From: tarjeij@ulrik.uio.no (Tarjei Jensen) Newsgroups: comp.databases Subject: Re: The Rushmore Technology from FoxPro Message-ID: Date: 7 Jun 91 14:31:41 GMT References: <1991Jun1.165211.27480@ugle.unit.no> <18164@venera.isi.edu> <25921@gremlin.nrtc.northrop.com> Sender: news@ulrik.uio.no (Mr News) Organization: University of Oslo, Norway Lines: 11 In-Reply-To: nolan@helios.unl.edu's message of 6 Jun 91 22:34:34 GMT Nntp-Posting-Host: ulrik Is it the speed associated with finding out whether a record can be found or not? If this is it then it might just a variation of the technique used by certain spellcheckers to see if a word is in the dictionary (a special hashing technique). I think the unix spell program is using such a technique. If I remember correctly it uses one bit per index (word) entry. Greetings from Norway, -- // Tarjei T. Jensen - if it ain't broken, fix it anyway! // tarjeij@ulrik.uio.no || +47 87 21138 // Working, but not speaking for the Norwegian National Library.