Next Article in Journal
Approximating the Minimum Tour Cover of a Digraph
Previous Article in Journal
Edit Distance with Block Deletions
Article Menu

Export Article

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

Compressed Matching in Dictionaries

Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel
Department of Computer Science, Ashkelon Academic College, Ashkelon, Israel
Author to whom correspondence should be addressed.
Received: 30 January 2011 / Revised: 2 March 2011 / Accepted: 17 March 2011 / Published: 22 March 2011
View Full-Text   |   Download PDF [185 KB, uploaded 22 March 2011]


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. View Full-Text
Keywords: dictionaries; IR systems; pattern matching; compressed matching; Huffman codes; Fibonacci codes dictionaries; IR systems; pattern matching; compressed matching; Huffman codes; Fibonacci codes
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

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

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top