Top-k document retrieval in external memory

DOI10.1007/978-3-642-40450-4_68MaRDI QIDQ2849367zbMATH OpenOpenAlexFDO

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

Publication date 17 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40450-4_68

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms (68W40) Data structures (68P05)

Recommendations

• Towards an optimal space-and-query-time index for top-\(k\) document retrieval
• Top-\(k\) document retrieval in optimal space
• Practical compact indexes for top-\(k\) document retrieval
• Top-\(k\) document retrieval in optimal time and linear space
• Top-\(k\) document retrieval in compact space and near-optimal time

Cited in

(13)

• Document retrieval with one wildcard
• Time-optimal top-\(k\) document retrieval
• Ranked Document Retrieval in External Memory
• New space/time tradeoffs for top-\(k\) document retrieval on sequences
• Ranked document retrieval for multiple patterns
• String indexing for top-\(k\) close consecutive occurrences
• Ranked document selection
• Indexes for document retrieval with relevance
• Space-efficient frameworks for top-\(k\) string retrieval
• Top-k term-proximity in succinct space
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
• Bottom-\(k\) document retrieval
• Gapped indexing for consecutive occurrences

This page was built for publication: Top-\(k\) document retrieval in external memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849367)