From ...
From: Erik Naggum <erik@naggum.net>
Subject: Re: suitable index for near matches of strings?
Date: 2000/10/07
Message-ID: <3179934072768685@naggum.net>#1/1
X-Deja-AN: 678729732
References: <874s33p1ja.fsf@lapchr.siteloft.com> <_84A5.20$aT.541@burlma1-snr2>
mail-copies-to: never
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: newsmaster@eunet.no
X-Trace: oslo-nntp.eunet.no 970945535 1896 195.0.192.66 (7 Oct 2000 19:05:35 GMT)
Organization: Naggum Software; vox: +47 800 35477; gsm: +47 93 256 360; fax: +47 93 270 868; http://naggum.no; http://naggum.net
User-Agent: Gnus/5.0803 (Gnus v5.8.3) Emacs/20.7
Mime-Version: 1.0
NNTP-Posting-Date: 7 Oct 2000 19:05:35 GMT
Newsgroups: comp.lang.lisp

* Barry Margolin <barmar@genuity.net>
| A good place to start would probably be Knuth's "Sorting and Searching"
| book.  Look for data structures like B-trees, B*-trees, prefix trees, etc.
| 
| Also, check out literature for database system implementation, as many of
| them make use of these for their indices, and Knuth is a bit out of date.

  Knuth's TAOCP has recently been revised, and Sorting and Searching
  is in the second edition, published 1998.  Is this still out of date?

#:Erik
-- 
  If this is not what you expected, please alter your expectations.