Efficient transformations for Klee's measure problem in the streaming model

Given a stream of rectangles over a discrete space, we consider the problem of computing the total number of distinct points covered by the rectangles. This is the discrete version of the two-dimensional Klee's measure problem for streaming inputs. Given 0 < ? , ? < 1 , we provide ( ? , ? ) -approximations for bounded side length rectangles and for bounded aspect ratio rectangles. For the case of arbitrary rectangles, we provide an O ( log ? U ) -approximation, where U is the total number of discrete points in the two-dimensional space. The time to process each rectangle and the total required space are polylogarithmic in U. The time to answer a query for the total area is constant. We construct efficient transformation techniques that project rectangle areas to one-dimensional ranges and then use a streaming algorithm for the one-dimensional Klee's measure problem to obtain these approximations. The projections are deterministic, and to our knowledge, these are the first approaches of this kind that provide efficiency and accuracy trade-offs in the streaming model.

[1]  Bogdan S. Chlebus.  On the Klee's Measure Problem in Small Dimensions , 1998, SOFSEM.

[2]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[3]  V. Klee.  Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? , 1977 .

[4]  Chung Keung Poon,et al.  Two improved range-efficient algorithms for F0 estimation , 2009, Theor. Comput. Sci..

[5]  Tobias Friedrich,et al.  Approximating the volume of unions and intersections of high-dimensional geometric objects , 2008, Comput. Geom..

[6]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[7]  Gabriel M. Kuper,et al.  Constraint Databases , 2010, Springer Berlin Heidelberg.

[8]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.

[9]  Michael Benedikt,et al.  Exact and approximate aggregation in constraint query languages , 1999, PODS '99.

[10]  Mark H. Overmars,et al.  New Upper Bounds in Klee's Measure Problem , 1991, SIAM J. Comput..

[11]  Srikanta Tirthapura,et al.  Range-Efficient Counting of Distinct Elements in a Massive Data Stream , 2007, SIAM J. Comput..

[12]  David P. Woodruff,et al.  Tight lower bounds for the distinct elements problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[13]  Jan van Leeuwen,et al.  The Measure Problem for Rectangular Ranges in d-Space , 1981, J. Algorithms.

[14]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[15]  Jan Vahrenhold.  An in-place algorithm for Klee's measure problem in two dimensions , 2007, Inf. Process. Lett..

[16]  Timothy M. Chan.  A (slightly) faster algorithm for Klee's measure problem , 2010, Comput. Geom..

[17]  Timothy M. Chan,et al.  Space-Efficient Algorithms for Klee's Measure Problem , 2005, CCCG.

[18]  Bruce W. Weide,et al.  On the complexity of computing the measure of ∪[ai,bi] , 1978, CACM.

[19]  David P. Woodruff,et al.  Rectangle-efficient aggregation in spatial data streams , 2012, PODS '12.

[20]  Karl Bringmann,et al.  An improved algorithm for Kleeʼs measure problem on fat boxes , 2012, Comput. Geom..

[21]  David Eppstein,et al.  Parallel Construction of Quadtrees and Quality Triangulations , 1993, Int. J. Comput. Geom. Appl..

[22]  Gokarna Sharma,et al.  An Efficient Transformation for the Klee's Measure Problem in the Streaming Model , 2012, CCCG.

[23]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .