Searching in compressed dictionaries

Data Compression Conference Proceedings

Volumn 2002-January, Issue , 2002, Pages 142-151

  Klein, S T ^a   Shapira, D ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

Computer science; Decoding; Dictionaries; Encoding; Gallium nitride; Information retrieval; Large scale systems; Natural languages; Pattern matching; Production systems

Indexed keywords

COMPUTER SCIENCE; DECODING; ENCODING (SYMBOLS); GALLIUM NITRIDE; GLOSSARIES; INFORMATION RETRIEVAL; LARGE SCALE SYSTEMS; PATTERN MATCHING; SEARCH ENGINES;

COMPRESSION PERFORMANCE; DIRECT SEARCH; HUFFMAN; NATURAL LANGUAGES; PROCESSING TIME; PRODUCTION SYSTEM; SMALL FILES;

DATA COMPRESSION;

EID: 84948410849     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2002.999952     Document Type: Conference Paper

References (11)

1. AMIR A., BENSON G., Efficient two-dimensional compressed matching, Proc. Data Compression Conference DCC-92, Snowbird, Utah (1992) 279-288.
2. AMIR A., BENSON G., FARACH M., Let Sleeping Files Lie: Pattern Matching in Z-compressed Files, Journal of Computer and System Sciences 52 (1996) 299-307.
3. BRATLEY.P, CHOUEKA.Y,Processing Truncated Terms in DocumentRetrieval Systems, Information Processing & Management18(5), (1982) 257-266.
4. FARACH M., THORUP M., String Matching in Lempel-Ziv Compressed Strings,Proc. 27th Annual ACM Symposium on the Theory of Computing, (1995) 703-712.
5. FRAENKEL A.S, KLEIN S.T., Robust universal complete codes for transmission and compression, Discrete Applied Mathematics64 (1996) 31-55.
6. KLEIN S.T., Skeleton Trees for efficient Decoding of Huffman Encoded Texts, Information Retrieval3 (2000) 7-23.
7. KLEIN S.T., SHAPIRA D., A new compression method for compressed matching, Proc. Data Compression Conference DCC-2000, Snowbird, Utah (2000) 400-409.
8. Klein S.T., SHAPIRA D., Pattern Matching in Huffman Encoded Texts, Proc. Data Compression Conference DCC-2001,Snowbird, Utah (2001) 449-458.
9. MANBER U., A Text Compression Scheme That allowsFast Searching Directly in the compressed File, ACM Trans. on Inf. Sys. 15 (1997) 124-136.
10. NAVARRO G., KIDA T., TAKEDA M., SHINOHARA A., AND ARIKAWA S.,Faster Approximate String Matching over Compressed Text, Proc. Data Compression Conference DCC-2001, Snowbird, Utah (2001) 459-468.
11. NAVARRO G., RAFFINOT M., A general practical approach to pattern matching over Ziv-Lempel compressed text, Proc. 10th Annual Symposium on Combinatorial Pattern Matching CPM-99, LNCS 1645, Springer Verlag, (1999) 14-36.