Arrow Research search
Back to TCS

TCS 2013

Space-efficient data-analysis queries on grids

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on geometric queries such as dominance and rectangle visibility, and on semigroup and group queries such as sum, average, variance, minimum and maximum. We also introduce new solutions to queries less frequently considered in the literature such as two-dimensional quantiles, majorities, successor/predecessor, mode, and various top- k queries, considering static and dynamic scenarios.

Authors

Keywords

  • Range queries
  • Databases
  • Succinct data structures
  • Dynamic data structures
  • Statistical database queries
  • Orthogonal range queries
  • Point dominance
  • Rectangle visibility
  • Wavelet tree
  • Range minimum queries
  • Alpha majority
  • Quantile
  • Top- k
  • Mode

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
867397496814278663
v2026.09.13