Voronoi-based nearest neighbor search for multi-dimensional uncertain databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2013, Pages 158-169

  Zhang, Peiwu ^a   Cheng, Reynold ^a   Mamoulis, Nikos ^a   Renz, Matthias ^b   Züfle, Andreas ^b   Tang, Yu ^a   Emrich, Tobias ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE VALUES; NEAREST NEIGHBOR QUERIES; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; QUERY POINTS; REAL DATA SETS; UNCERTAIN DATABASE; UNCERTAIN DATAS;

ALGORITHMS; CELLS; DATABASE SYSTEMS; QUERY PROCESSING;

CYTOLOGY;

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

References (42)

1. F. Aurenhammer, "Voronoi diagrams: a survey of a fundamental geometric data structure," ACM Computing Surveys (CSUR), 1991.
2. C. Aggarwal, "On unifying privacy and uncertain data models," in ICDE, 2008.
3. A. Deshpande et al., "Model-based approximate querying in sensor networks," VLDBJ, 2005.
4. J. Widom, "Trio: A system for integrated management of data, accuracy, and lineage," Technical Report, 2004.
5. S. Singh et al., "Orion 2.0: native support for uncertain data," in SIGMOD, 2008.
6. J. Boulos et al., "Mystiq: a system for finding more answers by using probabilities," in SIGMOD, 2005.
7. J. Huang, L. Antova, C. Koch, and D. Olteanu, "Maybms: a probabilistic database management system," in SIGMOD, 2009.
8. R. Cheng, D. Kalashnikov, and S. Prabhakar, "Querying imprecise data in moving object environments," TKDE, 2004.
9. R. Cheng et al., "UV-diagram: A Voronoi diagram for uncertain data," in ICDE, 2010.
10. G. Beskales, M. Soliman, and I. IIyas, "Efficient search for the top-k probable nearest neighbors in uncertain databases," VLDB, 2008.
11. R. Cheng et al., "Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data," in ICDE, 2008.
12. X. Lian and L. Chen, "Probabilistic group nearest neighbor queries in uncertain databases," TKDE, 2008.
13. M.A. Cheema et al., "Probabilistic reverse nearest neighbor queries on uncertain data," TKDE, 2010.
14. T. Bernecker et al., "Efficient probabilistic reverse nearest neighbor query processing on uncertain data," VLDB, 2011.
15. B. Parkinson, "GPS error analysis," Global Positioning System: Theory and applications., vol. 1, pp. 469-483, 1996.
16. T. Emrich et al., "Incremental reverse nearest neighbor ranking in vector spaces," Advances in Spatial and Temporal Databases, 2009.
17. -, "Boosting spatial pruning: on optimal pruning of mbrs," in SIGMOD, 2010.
18. C. Shahabi and M. Sharifzadeh, "Voronoi diagrams for query processing," in Encyclopedia of GIS, 2008, pp. 1235-1240.
19. M. Sharifzadeh et al., "Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries," PVLDB, 2010.
20. M. Sharifzadeh and C. Shahabi, "Approximate voronoi cell computation on spatial data streams," VLDB J., vol. 18, no. 1, pp. 57-75, 2009.
21. A. Akdogan et al., "Voronoi-based geospatial query processing with mapreduce," in The 2nd International Conference on CloudCom, 2010.
22. M. Kolahdouzan and C. Shahabi, "Voronoi-based k nearest neighbor search for spatial network databases," in VLDB, 2004.
23. J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. Lee, "Location-based spatial queries," in SIGMOD, 2003.
24. B. Zheng et al., "Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services," VLDBJ, 2006.
25. J. Xu et al., "Energy efficient index for querying location-dependent data in mobile broadcast environments," in ICDE, 2003.
26. S. Nutanong, R. Zhang, E. Tanin, and L. Kulik, "The v*-diagram: a query-dependent approach to moving knn queries," VLDB, 2008.
27. P. Wang et al, "Understanding the spreading patterns of mobile phone viruses," Science, vol. 324, no. 5930, p. 1071, 2009.
28. J. Vleugels and M. Overmars, "Approximating voronoi diagrams of convex sites in any dimension," International Journal of Computational Geometry and Applications, 1998.
29. S. Berchtold, B. Ertl, D. Keim, H. Kriegel, and T. Seidl, "Fast nearest neighbor search in high-dimensional space," in ICDE, 1998.
30. B. Kao, S. Lee, D. Cheung, W. Ho, and K. Chan, "Clustering uncertain data using voronoi diagrams," in ICDM, 2008.
31. W. Evans et al, "Guaranteed voronoi diagrams of uncertain sites," in 20th Canadian Conference on Computational Geometry, 2008.
32. M. Jooyandeh, A. Mohades, and M. Mirzakhah, "Uncertain voronoi diagram," Information processing letters, 2009.
33. P. K. Agarwal, A. Efrat, S. Sankararaman, and W. Zhang, "Nearest-neighbor searching under uncertainty," in PODS, 2012.
34. M. Ali et al., "Probabilistic voronoi diagrams for probabilistic moving nearest neighbor queries," Data and Knowledge Engineering, 2012.
35. R. Seidel, "The complexity of voronoi diagrams in higher dimensions," in the 20th Annual Allerton Conference on CCC. IEEE, 1982.
36. T. Brinkhoff, H. Kriegel, and R. Schneider, "Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems," in ICDE, 1993.
37. S. Boyd and L. Vandenberghe, Convex optimization. Cambridge University Press, 2004.
38. P. Zhang et al., "Voronoi-based nearest neighbor search for multi-dimensional uncertain databases," HKU, http://www.cs.hku.hk/~ckcheng/ tech/pvtech.pdf, Tech. Rep., 2012.
39. G. Hjaltason and H. Samet, "Distance browsing in spatial databases," TODS, 1999.
40. H. Samet, The design and analysis of spatial data structures. Addison-Wesley Longman Publishing Co., Inc., 1990.
41. A. Rathi et al., "Performance comparison of extensible hashing and linear hashing techniques," in Proc. ACM SIGSmall/PC Symposium on Small Systems, 1990.
42. N. Beckmann et al., "The r*-tree: an efficient and robust access method for points and rectangles," SIGMOD, 1990.