General document retrieval in compact space
From MaRDI portal
Recommendations
- Space-Efficient Algorithms for Document Retrieval
- Top-k document retrieval in optimal space
- Top-k document retrieval in compact space and near-optimal time
- Practical compact indexes for top-k document retrieval
- Top-\(k\) ranked document search in general text databases
- scientific article; zbMATH DE number 3907809
- Top-\(k\) document retrieval in optimal time and linear space
Cites work
- A simple optimal representation for balanced parentheses
- Alphabet partitioning for compressed rank/select and applications
- An analysis of the Burrows-Wheeler transform
- An online algorithm for lightweight grammar-based compression
- Colored range queries and document retrieval
- Compressed representations of sequences and full-text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed Text Indexes with Fast Locate
- Compression of individual sequences via variable-rate coding
- Fully-functional succinct trees
- scientific article; zbMATH DE number 1263219 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 7051248 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 2226805 (Why is no real title available?)
- Improved compressed indexes for full-text document retrieval
- Indexing compressed text
- New algorithms on wavelet trees and applications to information retrieval
- New text indexing functionalities of the compressed suffix arrays
- Optimal trade-offs for succinct string indexes
- Practical entropy-compressed rank/select dictionary
- Rank/select operations on large alphabets
- Representing trees of higher degree
- Space-Efficient Algorithms for Document Retrieval
- Space-Efficient Framework for Top-k String Retrieval Problems
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Succinct data structures for flexible text retrieval systems
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct representation of balanced parentheses and static trees
- Succinct Trees in Practice
- Suffix Arrays: A New Method for On-Line String Searches
- Theory and practice of monotone minimal perfect hashing
- Top-\(k\) document retrieval in optimal time and linear space
- Top-\(k\) ranked document search in general text databases
- Towards an optimal space-and-query-time index for top-k document retrieval
- Wavelet trees for all
Cited in
(17)- Lempel-Ziv compressed structures for document retrieval
- Bottom-\(k\) document retrieval
- Improved compressed indexes for full-text document retrieval
- Grammar compressed sequences with rank/select support
- Document retrieval on repetitive collections
- Compact indexes for flexible top-k
- Time-optimal top-k document retrieval
- Space-Efficient Algorithms for Document Retrieval
- scientific article; zbMATH DE number 1979483 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- Document listing on repetitive collections
- Succinct indexes for reporting discriminating and generic words
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Practical compact indexes for top-k document retrieval
- Succinct indexes for reporting discriminating and generic words
- Top-\(k\) document retrieval in optimal time and linear space
- Succinct data structures for flexible text retrieval systems
This page was built for publication: General document retrieval in compact space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828189)
