Space-efficient data-analysis queries on grids

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.

[1]  G. Golub,et al.  Updating formulae and a pairwise algorithm for computing sample variances , 1979 .

[2]  Prosenjit Bose,et al.  Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing , 2009, WADS.

[3]  Moshe Lewenstein,et al.  Two-Dimensional Range Minimum Queries , 2007, CPM.

[4]  Yakov Nekrich.  Orthogonal Range Searching in Linear and Almost-Linear Space , 2007, WADS.

[5]  J. Shane Culpepper,et al.  Top-k Ranked Document Search in General Text Databases , 2010, ESA.

[6]  Rodrigo González,et al.  Rank/select on dynamic compressed sequences and applications , 2009, Theor. Comput. Sci..

[7]  Timothy M. Chan,et al.  Orthogonal range searching on the RAM, revisited , 2011, SoCG '11.

[8]  Roberto Grossi,et al.  High-order entropy-compressed text indexes , 2003, SODA '03.

[9]  J. Ian Munro,et al.  Finding Frequent Elements in Compressed 2D Arrays and Strings , 2011, SPIRE.

[10]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[11]  Johannes Fischer,et al.  Optimal Succinctness for Range Minimum Queries , 2008, LATIN.

[12]  Timothy M. Chan,et al.  Linear-Space Data Structures for Range Mode Query in Arrays , 2011, Theory of Computing Systems.

[13]  Prosenjit Gupta,et al.  Efficient Top-k Queries for Orthogonal Ranges , 2011, WALCOM.

[14]  Allan Grønlund Jørgensen,et al.  Data Structures for Range Median Queries , 2009, ISAAC.

[15]  Gonzalo Navarro,et al.  Dynamic entropy-compressed sequences and full-text indexes , 2006, TALG.

[16]  Simon J. Puglisi,et al.  Range Quantile Queries: Another Virtue of Wavelet Trees , 2009, SPIRE.

[17]  Gonzalo Navarro,et al.  Top-k document retrieval in optimal time and linear space , 2012, SODA.

[18]  Gonzalo Navarro,et al.  Transposition invariant string matching , 2005, J. Algorithms.

[19]  Bernard Chazelle,et al.  A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..

[20]  Kunihiko Sadakane,et al.  Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.

[21]  B. Welford.  Note on a Method for Calculating Corrected Sums of Squares and Products , 1962 .

[22]  Stephane Durocher,et al.  Range majority in constant time and linear space , 2011, Inf. Comput..

[23]  Gonzalo Navarro,et al.  Rank and select revisited and extended , 2007, Theor. Comput. Sci..

[24]  Gonzalo Navarro,et al.  Colored range queries and document retrieval , 2010, Theor. Comput. Sci..

[25]  Marek Karpinski,et al.  Searching for Frequent Colors in Rectangles , 2008, CCCG.

[26]  Kunihiko Sadakane,et al.  Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.

[27]  Gonzalo Navarro,et al.  A Fun Application of Compact Data Structures to Indexing Geographic Data , 2010, FUN.

[28]  J. Ian Munro,et al.  An Implicit Binomial Queue with Constant Insertion Time , 1988, SWAT.

[29]  Maxime Crochemore,et al.  Improved Algorithms for the Range Next Value Problem and Applications , 2008, STACS.

[30]  Gonzalo Navarro,et al.  New algorithms on wavelet trees and applications to information retrieval , 2010, Theor. Comput. Sci..

[31]  Maxime Crochemore,et al.  Improved algorithms for the range next value problem and applications , 2012, Theor. Comput. Sci..

[32]  J. IAN MUNRO,et al.  An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time , 1986, J. Comput. Syst. Sci..

[33]  Gonzalo Navarro,et al.  Compact Rich-Functional Binary Relation Representations , 2010, LATIN.

[34]  J. Ian Munro,et al.  Succinct Representations of Dynamic Strings , 2010, SPIRE.

[35]  S. Srinivasa Rao,et al.  On Space Efficient Two Dimensional Range Minimum Data Structures , 2011, Algorithmica.

[36]  Yakov Nekrich.  Orthogonal range searching in linear and almost-linear space , 2009, Comput. Geom..

[37]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..

[38]  Mihai Patrascu.  Lower bounds for 2-dimensional range counting , 2007, STOC '07.

[39]  Rajeev Raman,et al.  On the Size of Succinct Indices , 2007, ESA.

[40]  Stephen Alstrup,et al.  New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[41]  Gerth Stølting Brodal,et al.  Dynamic Planar Range Maxima Queries , 2011, ICALP.