Top-k document retrieval in optimal time and linear space
From MaRDI portal
(Redirected from Top-k document retrieval in optimal time and linear space)
Top-\(k\) document retrieval in optimal time and linear space
Top-\(k\) document retrieval in optimal time and linear space
Recommendations
Cites work
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- Algorithms on Strings, Trees and Sequences
- Alphabet-independent compressed text indexing
- Colored range queries and document retrieval
- Compressed representations of sequences and full-text indexes
- Compressed suffix trees with full functionality
- Compression, indexing, and retrieval for massive string data
- Dynamic ordered sets with exponential search trees
- Efficient index for retrieving top-\(k\) most frequent documents
- General document retrieval in compact space
- scientific article; zbMATH DE number 3883638 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (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 742990 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- Improved compressed indexes for full-text document retrieval
- Online sorted range reporting
- Optimal succinctness for range minimum queries
- Orthogonal range searching on the RAM, revisited
- Rank and select revisited and extended
- Space-Efficient Algorithms for Document Retrieval
- Space-efficient data-analysis queries on grids
- Space-Efficient Framework for Top-k String Retrieval Problems
- Succinct data structures for flexible text retrieval systems
- Supporting random access in files of variable length records
- Top-\(K\) color queries for document retrieval
- Top-\(k\) ranked document search in general text databases
Cited in
(36)- Space-efficient indexes for forbidden extension queries
- Ranked document retrieval for multiple patterns
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- A top-k retrieval algorithm based on a decomposition of ranking functions
- Lempel-Ziv compressed structures for document retrieval
- Ranked document selection
- Bottom-\(k\) document retrieval
- Top-k term-proximity in succinct space
- A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets
- On reporting the \(L_1\) metric closest pair in a query rectangle
- Linear-space data structures for range frequency queries on arrays and trees
- I/O-optimal categorical 3-sided skyline queries
- General document retrieval in compact space
- Indexes for document retrieval with relevance
- Top-k document retrieval in external memory
- Top-k document retrieval in compact space and near-optimal time
- Document retrieval with one wildcard
- Towards an optimal space-and-query-time index for top-k document retrieval
- Ranked document retrieval with forbidden pattern
- Compact indexes for flexible top-k
- Top-\(k\) term-proximity in succinct space
- Time-optimal top-k document retrieval
- Ranked document selection
- Space-efficient frameworks for top-k string retrieval
- Space-Efficient Algorithms for Document Retrieval
- Top-\(k\) ranked document search in general text databases
- Colored range queries and document retrieval
- Top-k document retrieval in optimal space
- scientific article; zbMATH DE number 1979483 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- Categorical range reporting with frequencies
- Practical compact indexes for top-k document retrieval
- Top-\(K\) color queries for document retrieval
- Ranked Document Retrieval in External Memory
- Efficient index for retrieving top-\(k\) most frequent documents
- Succinct data structures for flexible text retrieval systems
This page was built for publication: Top-\(k\) document retrieval in optimal time and linear space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743458)
