Re: Searching 40 Million short strings fast
- From: Willem <willem@xxxxxxxx>
- Date: Tue, 6 Sep 2005 18:05:08 +0000 (UTC)
Peter wrote:
) The most important optimization I do is to look for duplicate suffixes.
) Rather than store five links for "bring" and six for "string," both
) can link to a unique "ring" sequence, which reduces the total number of
) nodes from 390158 to only 52904.
And what if you want to add "brings" ? You'd have to separate the links
again. Don't you need extra housekeeping to tell that one node is pointed
to from two locations ?
SaSW, Willem
--
Disclaimer: I am in no way responsible for any of the statements
made in the above text. For all I know I might be
drugged or something..
No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT
.
- Follow-Ups:
- Re: Searching 40 Million short strings fast
- From: Peter Ammon
- Re: Searching 40 Million short strings fast
- From: Arthur J. O'Dwyer
- Re: Searching 40 Million short strings fast
- References:
- Searching 40 Million short strings fast
- From: M . Barren
- Re: Searching 40 Million short strings fast
- From: Peter Ammon
- Re: Searching 40 Million short strings fast
- From: M . Barren
- Re: Searching 40 Million short strings fast
- From: Peter Ammon
- Searching 40 Million short strings fast
- Prev by Date: Re: i need help
- Next by Date: Re: Searching 40 Million short strings fast
- Previous by thread: Re: Searching 40 Million short strings fast
- Next by thread: Re: Searching 40 Million short strings fast
- Index(es):
Relevant Pages
|
Loading