Algorithms 2011, 4(1), 61-74; doi:10.3390/a4010061
Article

Compressed Matching in Dictionaries

1 Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel 2 Department of Computer Science, Ashkelon Academic College, Ashkelon, Israel
* Author to whom correspondence should be addressed.
Received: 30 January 2011; in revised form: 2 March 2011 / Accepted: 17 March 2011 / Published: 22 March 2011
PDF Full-text Download PDF Full-Text [185 KB, uploaded 22 March 2011 10:33 CET]
Abstract: 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.
Keywords: dictionaries; IR systems; pattern matching; compressed matching; Huffman codes; Fibonacci codes

Article Statistics

Load and display the download statistics.

Citations to this Article

Cite This Article

MDPI and ACS Style

Klein, S.T.; Shapira, D. Compressed Matching in Dictionaries. Algorithms 2011, 4, 61-74.

AMA Style

Klein ST, Shapira D. Compressed Matching in Dictionaries. Algorithms. 2011; 4(1):61-74.

Chicago/Turabian Style

Klein, Shmuel T.; Shapira, Dana. 2011. "Compressed Matching in Dictionaries." Algorithms 4, no. 1: 61-74.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert