Re: suitable index for near matches of strings?

Subject: Re: suitable index for near matches of strings?
From: Erik Naggum <erik@naggum.net>
Date: 2000/10/07
Newsgroups: comp.lang.lisp
Message-ID: <3179934072768685@naggum.net>

* 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.