Top-k Ranked Document Search in General Text Databases
From MaRDI portal
Publication:3586396
DOI10.1007/978-3-642-15781-3_17zbMath1287.68035OpenAlexW1752316941MaRDI QIDQ3586396
Simon J. Puglisi, Shane Culpepper, Andrew Turpin, Gonzalo Navarro
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_17
Related Items (16)
Space-Efficient Frameworks for Top- k String Retrieval ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Colored range queries and document retrieval ⋮ Space-efficient data-analysis queries on grids ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Wavelet trees for all ⋮ Computing the Burrows-Wheeler transform of a string and its reverse in parallel ⋮ Spaces, Trees, and Colors ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Efficient Top-k Queries for Orthogonal Ranges ⋮ General Document Retrieval in Compact Space ⋮ Indexes for Document Retrieval with Relevance ⋮ Unnamed Item ⋮ Practical Compact Indexes for Top-kDocument Retrieval
This page was built for publication: Top-k Ranked Document Search in General Text Databases
