Improved compressed indexes for full-text document retrieval
From MaRDI portal
Publication:2376797
Recommendations
Cited in
(18)- Fragmented BWT: an extended BWT for full-text indexing
- 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
- Bottom-\(k\) document retrieval
- Top-k term-proximity in succinct space
- Linear-space data structures for range frequency queries on arrays and trees
- General document retrieval in compact space
- Document retrieval with one wildcard
- Time-optimal top-k document retrieval
- Less space: indexing for queries with wildcards
- Space-efficient frameworks for top-k string retrieval
- Space-Efficient Algorithms for Document Retrieval
- Top-k document retrieval in optimal space
- scientific article; zbMATH DE number 1304039 (Why is no real title available?)
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Practical compact indexes for top-k document retrieval
- Top-\(k\) document retrieval in optimal time and linear 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)