Improved compressed indexes for full-text document retrieval
From MaRDI portal
Publication:2376797
DOI10.1016/J.JDA.2012.07.005zbMATH Open1268.68075OpenAlexW2118274795MaRDI QIDQ2376797FDOQ2376797
Authors: Gonzalo Navarro, Daniel Valenzuela, 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
Recommendations
Information storage and retrieval of data (68P20) Data structures (68P05) Nonnumerical algorithms (68W05)
Cited In (17)
- Space-Efficient Algorithms for Document Retrieval
- Top-\(k\) document retrieval in optimal space
- Linear-space data structures for range frequency queries on arrays and trees
- A simple algorithm for computing the document array
- Document retrieval with one wildcard
- Time-optimal top-\(k\) document retrieval
- Less space: indexing for queries with wildcards
- Practical compact indexes for top-\(k\) document retrieval
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Top-\(k\) document retrieval in optimal time and linear space
- Lempel-Ziv compressed structures for document retrieval
- Space-efficient frameworks for top-\(k\) string retrieval
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Top-\(k\) term-proximity in succinct space
- Fragmented BWT: an extended BWT for full-text indexing
- Bottom-\(k\) document retrieval
- General document retrieval in compact space
This page was built for publication: Improved compressed indexes for full-text document retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376797)
