Ranked Document Retrieval in External Memory
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4020488 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 7561469 (Why is no real title available?)
- Efficient range searching for categorical and plain data
- External selection
- Fully functional static and dynamic succinct trees
- Indexes for document retrieval with relevance
- Lower bounds for orthogonal range searching: I. The reporting case
- Near-optimal range reporting structures for categorical data
- On Dominance Reporting in 3D
- Ranked document selection
- Space-Efficient Framework for Top-k String Retrieval Problems
- Space-efficient frameworks for top-k string retrieval
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Supporting random access in files of variable length records
- The string B-tree
- Time bounds for selection
- Time-optimal top-k document retrieval
- Top-k document retrieval in external memory
- Top-\(k\) document retrieval in optimal time and linear space
This page was built for publication: Ranked Document Retrieval in External Memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051931)