Space-efficient data-analysis queries on grids
type: Item
instance of: scholarly article
title: Space-efficient data-analysis queries on grids
zbMATH Open document ID: 1291.68155
author: Gonzalo Navarro
author: Yakov Nekrich
author: Luís M. S. Russo
published in: Theoretical Computer Science
publication date: 2014-01-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6243792
zbMATH Keywords: range queries
zbMATH Keywords: databases
zbMATH Keywords: succinct data structures
zbMATH Keywords: dynamic data structures
zbMATH Keywords: statistical database queries
zbMATH Keywords: orthogonal range queries
zbMATH Keywords: point dominance
zbMATH Keywords: rectangle visibility
zbMATH Keywords: wavelet tree
zbMATH Keywords: range minimum queries
zbMATH Keywords: alpha majority
zbMATH Keywords: quantile
zbMATH Keywords: top-\(k\)
zbMATH Keywords: mode
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.11.031
OpenAlex ID: W2080990114
cites work: Orthogonal range searching in linear and almost-linear space
cites work: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
cites work: Time-space trade-offs for predecessor search
cites work: Orthogonal range searching on the RAM, revisited
cites work: Dynamic Planar Range Maxima Queries
cites work: Q4471381
cites work: A Functional Approach to Data Structures and Its Use in Multidimensional Searching
cites work: Rank and select revisited and extended
cites work: Compact Rich-Functional Binary Relation Representations
cites work: New algorithms on wavelet trees and applications to information retrieval
cites work: Efficient Top-k Queries for Orthogonal Ranges
cites work: New Data Structures for Orthogonal Range Queries
cites work: Two-Dimensional Range Minimum Queries
cites work: Data Structures for Range Median Queries
cites work: Range Majority in Constant Time and Linear Space
cites work: Time-Optimal Top-$k$ Document Retrieval
cites work: Linear-space data structures for range mode query in arrays
cites work: On the Size of Succinct Indices
cites work: Q5417613
cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
cites work: Dynamic entropy-compressed sequences and full-text indexes
cites work: Rank/select on dynamic compressed sequences and applications
cites work: Optimal Succinctness for Range Minimum Queries
cites work: Q3796732
cites work: Top-k Ranked Document Search in General Text Databases
cites work: Q4910720
cites work: Transposition invariant string matching
cites work: Colored range queries and document retrieval
cites work: Q3953128
DOI: 10.1016/J.TCS.2012.11.031
description: scientific article; zbMATH DE number 6243792