Space-Efficient Algorithms for Document Retrieval

DOI10.1007/978-3-540-73437-6_22zbMath1138.68401OpenAlexW2144759920MaRDI QIDQ3506923

Niko Välimäki, Veli Mäkinen

Publication date: 17 June 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_22

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (15)

On succinct representations of binary trees ⋮ Fast construction of wavelet trees ⋮ Colored range queries and document retrieval ⋮ Top-\(k\) document retrieval in optimal space ⋮ Efficient index for retrieving top-\(k\) most frequent documents ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Wavelet trees for all ⋮ On space efficient two dimensional range minimum data structures ⋮ A simple algorithm for computing the document array ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ General Document Retrieval in Compact Space ⋮ Indexes for Document Retrieval with Relevance ⋮ Unnamed Item

This page was built for publication: Space-Efficient Algorithms for Document Retrieval