Compressed matching in dictionaries
type: Item
instance of: scholarly article
title: Compressed matching in dictionaries
zbMATH Open document ID: 1461.68079
author: Shmuel T. Klein
author: Dana Shapira
published in: Algorithms
publication date: 2019-03-26T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 7042098
zbMATH Keywords: dictionaries
zbMATH Keywords: IR systems
zbMATH Keywords: pattern matching
zbMATH Keywords: compressed matching
zbMATH Keywords: Huffman codes
zbMATH Keywords: Fibonacci codes
describes a project that uses: XMill
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a4010061
OpenAlex ID: W1998827944
cites work: Pattern matching in Huffman encoded texts
cites work: Let sleeping files lie: Pattern matching in Z-compressed files.
cites work: Q4234121
cites work: Q3024795
cites work: Q4952614
cites work: Improving table compression with combinatorial optimization
cites work: String Processing and Information Retrieval
cites work: Robust universal complete codes for transmission and compression
cites work: Q3024810
DOI: 10.3390/A4010061
description: scientific article; zbMATH DE number 7042098