Compressed Matching in Dictionaries

Algorithms

Shmuel T. Klein¹ 

[1] Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel

关键词: dictionaries;    IR systems;    pattern matching;    compressed matching;    Huffman codes;    Fibonacci codes;   

DOI  :  10.3390/a4010061

来源: mdpi

【 摘 要 】

The problem of compressed pattern matching, which has recently been treated in many papers dealing with free text, is extended to structured files, specifically to dictionaries, which appear in any full-text retrieval system. The prefix-omission method is combined with Huffman coding and a new variant based on Fibonacci codes is presented. Experimental results suggest that the new methods are often preferable to earlier ones, in particular for small files which are typical for dictionaries, since these are usually kept in small chunks.

【 授权许可】

CC BY   
© 2011 by the authors; licensee MDPI, Basel, Switzerland.