Quote: fast searching of compressed text using Huffman encoding, shift-or search, and Boyer-Moore filter; 30% compression, 2-8x faster than agrep

topics > all references > references c-d > QuoteRef: demoES8_1998 , p. abstract

searching compressed data
external search and sort

Quotation Skeleton

We present a fast compression and decompression scheme … directly. The compression scheme uses a word-based Huffman … about 30% of their original size, against 40% … and approximately half the times of Gzip, and … searching algorithm allows a large number of variations … and arbitrary regular expressions. … The algorithm is based on a word-oriented shift-or … When searching for simple patterns, our experiments show … the uncompressed version of the same text. When …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics up

Topic: searching compressed data (9 items)
Topic: external search and sort (23 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.