The VLDB Journal

, Volume 18, Issue 1, pp 57–75 | Cite as

Approximate voronoi cell computation on spatial data streams

Regular Paper

Abstract

Several studies have exploited the properties of Voronoi diagrams to improve the efficiency of variations of the nearest neighbor search on stored datasets. However, the significance of Voronoi diagrams and their basic building blocks, Voronoi cells, has been neglected when the geometry data is incrementally becoming available as a data stream. In this paper, we study the problem of Voronoi cell computation for fixed 2-d site points when the locations of the neighboring sites arrive as a spatial data stream. We show that the non-streaming solution to the problem does not meet the memory requirements of many realistic scenarios over a sliding window. Hence, we propose AVC-SW, an approximate streaming algorithm that computes (1 + ε)-approximations to the actual exact Voronoi cell in O(κ) where κ is its sample size. With the sliding window model and random arrival of points, we show both analytically and experimentally that for given window size w and parameter k, AVC-SW reduces the expected memory requirements of the classic algorithm from O(w) to \(O(k \log (\frac{w}{k} + 1))\) regardless of the distribution of the points in the 2-d space. This is a significant improvement for most of the real-world scenarios where wk.

Keywords

Voronoi cell Spatial data stream  Sliding window Approximation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate voronoi diagrams. In: Proceedings of the 34th ACM Symp. on Theory of Computing (STOC), pp. 721–730 (2002)Google Scholar
  2. 2.
    Arya, S., Vigneron, A.: Approximating a voronoi cell. Tech. rep. (2003). HKUST-TCSC-2003-10Google Scholar
  3. 3.
    Banaei-Kashani, F., Shahabi, C.: SWAM: A family of access methods for similarity-search in peer-to-peer data networks. In: Proceedings of the Thirteenth Conference on Information and Knowledge Management (CIKM’04), pp. 304–313 (2004)Google Scholar
  4. 4.
    Overmars M., Schwarzkopf O., Berg M. and Kreveld M. (2000). Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg MATHGoogle Scholar
  5. 5.
    Cormode, G., Muthukrishnan, S.: Radial histograms for spatial streams. DIMACS TR 2003-11 (2003) (in press)Google Scholar
  6. 6.
    Feigenbaum, J., Kannan, S., Zhang, J.: Computing diameter in the streaming and sliding-window models. Algorithmica (2004) (in press)Google Scholar
  7. 7.
    Gardner, M.: The Sixth Book of Mathematical Games from Scientific American. University of Chicago Press (1984)Google Scholar
  8. 8.
    Hagedoorn, M.: Nearest neighbors can be found efficiently if the dimension is small relative to the input size. In: Proceedings of the 9th International Conference on Database Theory—ICDT 2003, Lecture Notes in Computer Science, vol. 2572, pp. 440–454. Springer, Heidelberg (2003)Google Scholar
  9. 9.
    Har-Peled, S.: A replacement for voronoi diagrams of near linear size. In: Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 94–103 (2001)Google Scholar
  10. 10.
    Hershberger, J., Shrivastava, N., Suri, S.: Cluster hull: A technique for summarizing spatial data streams. In: Proceedings of 22nd IEEE Conf. Data Engineering, ICDE’06. IEEE Computer Society (2006)Google Scholar
  11. 11.
    Hershberger, J., Suri, S.: Adaptive sampling for geometric problems over data streams. In: Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM (2004)Google Scholar
  12. 12.
    Indyk, P.: Algorithms for dynamic geometric problems over data streams. In: Proceedings of the Thirty-Sixth annual ACM Symposium on Theory of Computing, pp. 373–380. ACM Press (2004). doi: 10.1145/1007352.1007413
  13. 13.
    Indyk, P.: Streaming algorithms for geometric problems. In: Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG’04) (2004). Invited TalkGoogle Scholar
  14. 14.
    Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the 30th International Conference on Very Large Data Bases (VLDB’04) (2004)Google Scholar
  15. 15.
    Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of data, pp. 201–212. ACM Press (2000). doi: 10.1145/342009.335415
  16. 16.
    Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the sky: efficient skyline computation over sliding windows. In: Proceedings of the 21st International Conference on Data Engineering (ICDE’05), pp. 502–513. IEEE Computer Society (2005)Google Scholar
  17. 17.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)Google Scholar
  18. 18.
    Muthukrishnan, S.: Data streams: algorithms and applications. Tech. rep., Computer Science Department, Rutgers University (2003)Google Scholar
  19. 19.
    Okabe A., Boots B., Sugihara K. and Chiu S.N. (2000). Spatial Tessellations, Concepts and Applications of Voronoi Diagrams, 2nd edn. Wiley, New York MATHGoogle Scholar
  20. 20.
    Seidel R. and Aragon C.R. (1996). Randomized search trees. Algorithmica 16(4/5): 464–497 MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Sharifzadeh, M., Shahabi, C.: Supporting spatial aggregation in sensor network databases. In: Proceedings of the 12th ACM International Symposium on Advances in Geographic Information Systems, pp. 166–175 (2004)Google Scholar
  22. 22.
    Sharifzadeh M. and Shahabi C. (2005). Utilizing Voronoi cells of location data streams for accurate computation of aggregate functions in sensor networks. GeoInformatica 10(1): 9–36 CrossRefGoogle Scholar
  23. 23.
    Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44–53 (2000)Google Scholar
  24. 24.
    Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: Proceedings of the 27th International Conference on Very Large Data Bases (VLDB’01), pp. 99–108. Morgan Kaufmann Publishers Inc. (2001)Google Scholar
  25. 25.
    Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.L.: Location-based spatial queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 443–454. ACM Press (2003). doi: 10.1145/872757.872812

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA

Personalised recommendations