UV-diagram: A Voronoi diagram for uncertain data

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 796-807

  Cheng, Reynold ^a   Xie, Xike ^a   Yiu, Man Lung ^b   Chen, Jinchuan ^c   Sun, Liwen ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BUSINESS APPLICATIONS; DATA SPACE; NEAREST NEIGHBORS; NEAREST-NEIGHBOR QUERY; NON-ZERO PROBABILITY; POLYNOMIAL-TIME; QUERY POINTS; SPATIAL DATABASE; STORAGE COSTS; UNCERTAIN DATAS; VORONOI DIAGRAMS;

POLYNOMIAL APPROXIMATION;

COMPUTATIONAL GEOMETRY;

EID: 77952758928     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447917     Document Type: Conference Paper

References (38)

1. A. Okabe, B. Boots, K. Sugihara, and S. Chiu, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed. Wiley, 2000.
2. J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. L. Lee, "Location-based spatial queries," in SIGMOD, 2003.
3. B. Zheng, J. Xu, W.-C. Lee, and L. Lee, "Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services," VLDB J., vol. 15, no. 1, pp. 21-39, 2006.
4. S. Berchtold, B. Ertl, D. A. Keim, H. peter Kriegel, and T. Seidl, "Fast nearest neighbor search in high-dimensional space," in ICDE, 1998.
5. J. Xu and B. Zheng, "Energy efficient index for querying location-dependent data in mobile broadcast environments," in ICDE, 2003.
6. S. Nutanong, R. Zhang, E. Tanin, and L. Kulik, "The V*-Diagram: a query-dependent approach to moving knn queries," VLDB, 2008.
7. G. Albers et al, "Voronoi diagrams of moving points," Intl. Journal on Computational Geometry and Applications, vol. 8, no. 3, 1998.
8. P. Wang et al, "Understanding the spreading patterns of mobile phone viruses," Science Express, vol. 324, no. 5930, 2009.
9. R. Agrawal and R. Srikant, "Privacy-preserving data mining," in SIGMOD, 2000.
10. C. C. Aggarwal, "On unifying privacy and uncertain data models," in ICDE, 2008.
11. V. Ljosa and A. Singh, "APLA: Indexing arbitrary probability distributions," in ICDE, 2007.
12. -, "Top-k spatial joins of probabilistic objects," in ICDE, 2008.
13. N. Beckmann et al, "The R*-tree: An efficient and robust access method for points and rectangles," in SIGMOD, 1990.
14. R. Cheng, D. V. Kalashnikov, and S. Prabhakar, "Querying imprecise data in moving object environments," TKDE, vol. 16, no. 9, 2004.
15. R. Cheng, J. Chen, M. Mokbel, and C.-Y. Chow, "Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data," in ICDE, 2008.
16. M. Mokbel, C. Chow, and W. Aref, "The new casper: Query processing for location services without compromising privacy," in VLDB, 2006.
17. M. de Berg et al, Computational Geometry: Algorithms and Applications. Springer-Verlag, 1997.
18. P. Sistla et al, "Querying the uncertain position of moving objects," in Temporal Databases: Research and Practice, 1998.
19. R. Cheng, D. Kalashnikov, and S. Prabhakar, "Evaluating probabilistic queries over imprecise data," in SIGMOD, 2003.
20. N. Dalvi and D. Suciu, "Efficient query evaluation on probabilistic databases," in VLDB, 2004.
21. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. S. Vitter, "Efficient indexing methods for probabilistic threshold queries over uncertain data," in VLDB, 2004.
22. J. Pei, B. Jiang, X. Lin, and Y. Yuan, "Probabilistic skylines on uncertain data," in VLDB, 2007.
23. X. Lian and L. Chen, "Monochromatic and bichromatic reverse skyline search over uncertain databases," in SIGMOD, 2008.
24. M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking queries on uncertain data: A probabilistic threshold approach," in SIGMOD, 2008.
25. H. Kriegel, P. Kunath, and M. Renz, "Probabilistic nearest-neighbor query on uncertain objects," in DASFAA, 2007.
26. X. Lian and L. Chen, "Probabilistic group nearest neighbor queries in uncertain databases," TKDE, vol. 20, no. 6, 2008.
27. M. Cheema et al, "Probabilistic reverse nearest neighbor queries on uncertain data," TKDE, vol. 16, no. 9, 2009.
28. X. Lian and L. Chen, "Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data," in VLDBJ, 2009.
29. G. Beskales, M. Soliman, and I. Ilyas, "Efficient search for the top-k probable nearest neighbors in uncertain databases," in VLDB, 2008.
30. B. Chazelle and H. Edelsbrunner, "An improved algorithm for constructing kth-order voronoi diagrams," IEEE Trans. Computing, vol. 36, no. 11, 1987.
31. M. I. Karavelas, "Voronoi diagrams for moving disks and applications," in WADS, 2001.
32. B. Kao, S. Lee, D. Cheung, W. Ho, and K. Chan, "Clustering uncertain data using voronoi diagrams," in ICDM, 2008.
33. M. Jooyandeh, A. Mohades, and M. Mirzakhah, "Uncertain voronoi diagram," Inf. Process. Lett., vol. 109, no. 13, pp. 709-712, 2009.
34. J. Sember and W. Evans, "Guaranteed voronoi diagrams of uncertain sites," in CCCG, 2008.
35. R. Cheng, X. Xie, M. Yiu, J. Chen, and L. Sun, "UV-diagram: A voronoi diagram for uncertain data (technical report)," 2009. [Online]. Available: http://www.cs.hku.hk/research/techreps/document/TR-2009-13.pdf
36. A. Akopyan and A. Zaslavski, Geometry of Conics. American Mathematical Society, 2007.
37. W. Aref and I. Ilyas, "Sp-gist: An extensible database index for supporting space partitioning trees," JIS, vol. 17, no. 1, 2001.
38. M.Hadjieleftheriou, "Spatial index library version 0.44.2b." [Online]. Available: http://u-foria.org/marioh/spatialindex/index.html