{"paper":{"title":"Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rahul Shah, Sharma V. Thankachan, Wing-Kai Hon","submitted_at":"2011-08-02T12:00:02Z","abstract_excerpt":"Let $\\D = $$ \\{d_1,d_2,...d_D\\}$ be a given set of $D$ string documents of total length $n$, our task is to index $\\D$, such that the $k$ most relevant documents for an online query pattern $P$ of length $p$ can be retrieved efficiently. We propose an index of size $|CSA|+n\\log D(2+o(1))$ bits and $O(t_{s}(p)+k\\log\\log n+poly\\log\\log n)$ query time for the basic relevance metric \\emph{term-frequency}, where $|CSA|$ is the size (in bits) of a compressed full text index of $\\D$, with $O(t_s(p))$ time for searching a pattern of length $p$ . We further reduce the space to $|CSA|+n\\log D(1+o(1))$ b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0554","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}