New space/time tradeoffs for top-\(k\) document retrieval on sequences
type: Item
instance of: scholarly article
title: New space/time tradeoffs for top-\(k\) document retrieval on sequences
zbMATH Open document ID: 1317.68049
author: Gonzalo Navarro
author: Sharma V. Thankachan
published in: Theoretical Computer Science
publication date: 2014-06-23T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6306358
zbMATH Keywords: document retrieval
zbMATH Keywords: top-\(k\) queries
zbMATH Keywords: string databases
zbMATH Keywords: compressed data structures
describes a project that uses: Wumpus
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.05.005
OpenAlex ID: W2112908352
cites work: Q3588654
cites work: Spaces, Trees, and Colors
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Efficient index for retrieving top-\(k\) most frequent documents
cites work: Space-Efficient Framework for Top-k String Retrieval Problems
cites work: Q5743458
cites work: Top-k Document Retrieval in External Memory
cites work: Compressed representations of sequences and full-text indexes
cites work: An analysis of the Burrows—Wheeler transform
cites work: Alphabet Partitioning for Compressed Rank/Select and Applications
cites work: Alphabet-Independent Compressed Text Indexing
cites work: Colored range queries and document retrieval
cites work: Improved compressed indexes for full-text document retrieval
cites work: Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
cites work: Top-\(k\) document retrieval in optimal space
cites work: Q4828998
cites work: Space-Efficient Algorithms for Document Retrieval
cites work: Top-k Ranked Document Search in General Text Databases
cites work: Q5365051
cites work: New algorithms on wavelet trees and applications to information retrieval
cites work: Q5417613
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Practical Entropy-Compressed Rank/Select Dictionary
cites work: New Lower and Upper Bounds for Representing Sequences
cites work: Succinct data structures for flexible text retrieval systems
cites work: Time bounds for selection
cites work: Constructing Efficient Dictionaries in Close to Sorting Time
cites work: Encodings for Range Selection and Top-k Queries
cites work: Space-efficient data-analysis queries on grids
cites work: Q4508365
cites work: Optimal Trade-Offs for Succinct String Indexes
cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
DOI: 10.1016/J.TCS.2014.05.005
description: scientific article; zbMATH DE number 6306358