Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval

DOI10.1007/978-3-642-31265-6_14zbMath1358.68092arXiv1108.0554OpenAlexW1504477191MaRDI QIDQ2904490

Rahul Shah, Wing-Kai Hon, Sharma V. Thankachan

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.0554

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (9)

Space-Efficient Frameworks for Top- k String Retrieval ⋮ Colored range queries and document retrieval ⋮ Top-\(k\) document retrieval in optimal space ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Spaces, Trees, and Colors ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ General Document Retrieval in Compact Space ⋮ Array Range Queries ⋮ Indexes for Document Retrieval with Relevance

This page was built for publication: Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval