Top-k document retrieval in external memory

DOI10.1007/978-3-642-40450-4_68zbMATH Open1394.68129OpenAlexW227213435MaRDI QIDQ2849367FDOQ2849367

Sharma V. Thankachan, Cheng Sheng, Rahul Shah, 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

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

Mathematics Subject Classification ID

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

Cited In (13)

• Spaces, Trees, and Colors
• Document retrieval with one wildcard
• 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
• Time-Optimal Top-$k$ Document Retrieval
• Ranked document selection
• Top-\(k\) term-proximity in succinct space
• Bottom-\(k\) document retrieval
• Gapped indexing for consecutive occurrences
• Indexes for Document Retrieval with Relevance
• Space-Efficient Frameworks for Top- k String Retrieval

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)