Full-Text Searching & the Burrows-Wheeler Transform
In this article, I examine an indexing method that lets you find any character sequence in the source text in time only proportional to the sequence length using a structure that can compress the entire source text and index into less space than the text alone. This technique is exceptionally fast at detecting and counting occurrences of any string in the source text.
http://www.ddj.com/documents/s=8944/ddj0312d/0312d.htm?temp=jiRiV3fTQc
Posted in March 20th, 2004
No User Commented In " Full-Text Searching & the Burrows-Wheeler Transform "
Subscribes to this post Comment RSS or TrackBack URL