Ranked Document Retrieval in External Memory

DOI10.1145/3559763OpenAlexW4296613559WikidataQ130960537 ScholiaQ130960537MaRDI QIDQ6051931

Jeffrey Scott Vitter, Rahul Shah, Sharma V. Thankachan, Cheng Sheng

Publication date: 23 October 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3559763

zbMATH Keywords

data structuresexternal memorytext indexing

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Time bounds for selection
• Supporting random access in files of variable length records
• Ranked document selection
• Fully Functional Static and Dynamic Succinct Trees
• Indexes for Document Retrieval with Relevance
• Top-k Document Retrieval in External Memory
• Efficient range searching for categorical and plain data
• Time-Optimal Top-$k$ Document Retrieval
• The string B-tree
• Space-Efficient Frameworks for Top- k String Retrieval
• Lower bounds for orthogonal range searching: I. The reporting case
• On Dominance Reporting in 3D
• Space-Efficient Framework for Top-k String Retrieval Problems
• Spaces, Trees, and Colors
• External selection
• Near-Optimal Range Reporting Structures for Categorical Data

This page was built for publication: Ranked Document Retrieval in External Memory