Linear-space data structures for range frequency queries on arrays and trees
type: Item
instance of: scholarly article
title: Linear-space data structures for range frequency queries on arrays and trees
zbMATH Open document ID: 1411.68034
author: Stephane Durocher
author: Rahul Shah
author: Matthew Skala
author: Sharma V. Thankachan
published in: Algorithmica
publication date: 2016-03-23T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6559783
zbMATH Keywords: data structures
zbMATH Keywords: range query
zbMATH Keywords: path query
zbMATH Keywords: linear space
zbMATH Keywords: frequency
zbMATH Keywords: color query
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1977261082
cites work: Hash, Displace, and Compress
cites work: Better Space Bounds for Parameterized Range Majority and Minority
cites work: New Lower and Upper Bounds for Representing Sequences
cites work: Improved compressed indexes for full-text document retrieval
cites work: Q4508365
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Towards optimal range medians
cites work: Linear-space data structures for range mode query in arrays
cites work: Linear-Space Data Structures for Range Minority Query in Arrays
cites work: Filtering Search: A New Approach to Query-Answering
cites work: Succinct Representations of Binary Trees for Range Minimum Queries
cites work: On Cartesian Trees and Range Minimum Queries
cites work: A simple linear-space data structure for constant-time range minimum query
cites work: Range Majority in Constant Time and Linear Space
cites work: Range majority in constant time and linear space
cites work: Low space data structures for geometric range mode query
cites work: Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees
cites work: Preserving order in a forest in less than logarithmic time and linear space
cites work: Optimal Succinctness for Range Minimum Queries
cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths
cites work: Colored range queries and document retrieval
cites work: Towards Optimal Range Medians
cites work: Q2762514
cites work: Path Queries in Weighted Trees
cites work: Succinct Data Structures for Path Queries
cites work: Space-Efficient Framework for Top-k String Retrieval Problems
cites work: Q5365082
cites work: Q5365051
cites work: Algorithms and Computation
cites work: Q5705139
cites work: Q4828998
cites work: Q5743458
cites work: Succinct representations of weighted trees supporting path queries
cites work: Q5417613
cites work: The Spatial Complexity of Oblivious k-Probe Hash Functions
cites work: Array Range Queries
cites work: A data structure for dynamic trees
DOI: 10.1007/S00453-014-9947-8
description: scientific article; zbMATH DE number 6559783