A text compression scheme that allows fast searching directly in the compressed file
ACM Transactions on Information Systems (TOIS)
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Searching the Web: the public and their queries
Journal of the American Society for Information Science and Technology
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Offline Dictionary-Based Compression
DCC '99 Proceedings of the Conference on Data Compression
An efficient compression code for text databases
ECIR'03 Proceedings of the 25th European conference on IR research
Enhanced byte codes with restricted prefix properties
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Dynamic lightweight text compression
ACM Transactions on Information Systems (TOIS)
DACs: Bringing direct access to variable-length codes
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
Byte codes are a practical alternative to the traditional bit-oriented compression approaches when large alphabets are being used, and trade away a small amount of compression effectiveness for a relatively large gain in decoding efficiency. Byte codes also have the advantage of being searchable using standard string matching techniques. Here we describe methods for searching in byte-coded compressed text and investigate the impact of large alphabets on traditional string matching techniques. We also describe techniques for phrase-based searching in a restricted type of byte code, and present experimental results that compare our adapted methods with previous approaches.