Improved compressed indexes for full-text document retrieval

DOI10.1016/j.jda.2012.07.005zbMath1268.68075OpenAlexW2118274795MaRDI QIDQ2376797

Daniel Valenzuela, Gonzalo Navarro, Djamal Belazzougui

Publication date: 24 June 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.07.005

zbMATH Keywords

document retrievalcompact data structuresmonotone minimal perfect hash functions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

Top-\(k\) term-proximity in succinct space ⋮ Document retrieval with one wildcard ⋮ Less space: indexing for queries with wildcards ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ A framework for space-efficient string kernels ⋮ Top-\(k\) document retrieval in optimal space ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Spaces, Trees, and Colors ⋮ A simple algorithm for computing the document array ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ General Document Retrieval in Compact Space ⋮ Unnamed Item ⋮ Bottom-\(k\) document retrieval ⋮ Practical Compact Indexes for Top-kDocument Retrieval ⋮ Linear-space data structures for range frequency queries on arrays and trees