Adaptive Spatial Partitioning for Multidimensional Data Streams

We propose a space-efficient scheme for summarizing multidimensional data streams Our scheme can be used for several geometric queries, including natural spatial generalizations of well-studied single-dimensional queries such as icebergs and quantiles.

[1]  Erik D. Demaine,et al.  Frequency Estimation of Internet Packet Streams with Limited Space , 2002, ESA.

[2]  Noga Alon,et al.  The Space Complexity of Approximating the Frequency Moments , 1999 .

[3]  Gurmeet Singh Manku,et al.  Approximate counts and quantiles over sliding windows , 2004, PODS.

[4]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[5]  Piotr Indyk,et al.  Maintaining Stream Statistics over Sliding Windows , 2002, SIAM J. Comput..

[6]  Pankaj K. Agarwal,et al.  Approximating extent measures of points , 2004, JACM.

[7]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[8]  Subhash Suri,et al.  Adaptive sampling for geometric problems over data streams , 2004, PODS.

[9]  Jeffrey Scott Vitter,et al.  Random sampling with a reservoir , 1985, TOMS.

[10]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, TODS.

[11]  Jiong Yang,et al.  PK-tree: A Spatial Index Structure for High Dimensional Point Data , 1998, FODO.

[12]  Rajeev Motwani,et al.  Approximate Frequency Counts over Data Streams , 2012, VLDB.

[13]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[14]  Jayadev Misra,et al.  Finding Repeated Elements , 1982, Sci. Comput. Program..

[15]  Erik D. Demaine,et al.  Identifying frequent items in sliding windows over on-line packet streams , 2003, IMC '03.

[16]  S. Muthukrishnan,et al.  How to Summarize the Universe: Dynamic Maintenance of Quantiles , 2002, VLDB.

[17]  Divyakant Agrawal,et al.  Medians and beyond: new aggregation techniques for sensor networks , 2004, SenSys '04.

[18]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[19]  Bruce G. Lindsay,et al.  Approximate medians and other quantiles in one pass and with limited memory , 1998, SIGMOD '98.

[20]  Sanjeev Khanna,et al.  Space-efficient online computation of quantile summaries , 2001, SIGMOD '01.

[21]  Csaba D. Tóth,et al.  Range counting over multidimensional data streams , 2004, SCG '04.

[22]  Richard M. Karp,et al.  A simple algorithm for finding frequent elements in streams and bags , 2003, TODS.

[23]  Michiel H. M. Smid,et al.  An optimal algorithm for the on-line closest-pair problem , 2005, Algorithmica.

[24]  Rajeev Motwani,et al.  Computing Iceberg Queries Efficiently , 1998, VLDB.

[25]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[26]  Rina Panigrahy,et al.  Better streaming algorithms for clustering problems , 2003, STOC '03.

[27]  Sudipto Guha,et al.  Dynamic multidimensional histograms , 2002, SIGMOD '02.

[28]  Leonidas J. Guibas,et al.  Linear time algorithms for visibility and shortest path problems inside simple polygons , 2011, SCG '86.

[29]  Bruce G. Lindsay,et al.  Random sampling techniques for space efficient online computation of order statistics of large datasets , 1999, SIGMOD '99.

[30]  Divesh Srivastava,et al.  Finding Hierarchical Heavy Hitters in Data Streams , 2003, VLDB.

[31]  George Varghese,et al.  Automatically inferring patterns of resource consumption in network traffic , 2003, SIGCOMM '03.

[32]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[33]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.