Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries

Data and Knowledge Engineering

Volumn 75, Issue , 2012, Pages 1-33

  Ali, Mohammed Eunus ^a   Tanin, Egemen ^b   Zhang, Rui ^b   Kotagiri, Ramamohanarao ^b  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Continuous queries; Moving objects; Uncertain data; Voronoi diagrams

Indexed keywords

COMMUNICATION OVERHEADS; CONTINUOUS QUERIES; DATA SETS; ENVIRONMENTAL MONITORING; INCREMENTAL APPROACH; LOWER BOUNDS; MOVING OBJECTS; MOVING QUERY; NEAREST NEIGHBOR QUERIES; NEAREST NEIGHBORS; ORDERS OF MAGNITUDE; PRE-COMPUTATION; SAFE REGION; SAMPLING-BASED; UNCERTAIN DATABASE; UNCERTAIN DATAS; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY; GRAPHIC METHODS; LOCATION BASED SERVICES;

QUERY PROCESSING;

EID: 84861099407     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2012.02.001     Document Type: Article

References (46)

1. G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain Managing uncertainty in moving objects databases ACM TODS 29 3 2004 463 507
2. S. Madden, M.J. Franklin, and J.M.H.W. Hong The design of an acquisitional query processor for sensor networks SIGMOD 2003 491 502
3. Q. Liu, W. Yan, H. Lu, and S. Ma Occlusion robust face recognition with dynamic similarity features ICPR 2006 544 547 (Pubitemid 46553180)
4. R. Cheng, D.V. Kalashnikov, and S. Prabhakar Evaluating probabilistic queries over imprecise data SIGMOD 2003 551 562
5. R. Cheng, S. Prabhakar, and D.V. Kalashnikov Querying imprecise data in moving object environments IEEE TKDE 16 9 2004 1112 1127
6. R. Cheng, X. Xie, M.L. Yiu, J. Chen, and L. Sun UV-Diagram: A Voronoi Diagram for Uncertain Data ICDE 2010
7. H.-P. Kriegel, P. Kunath, and M. Renz Probabilistic nearest-neighbor query on uncertain objects DASFAA 2007 337 348
8. G. Beskales, M.A. Soliman, and I.F. IIyas Efficient search for the top-k probable nearest neighbors in uncertain databases Proceedings of the VLDB Endow 1 1 2008 326 339
9. C. Re, N. Dalvi, and D. Suciu Efficient top-k query evaluation on probabilistic data ICDE 2007 886 895 (Pubitemid 47422092)
10. M.A. Soliman, and I.F. Ilyas Top-k query processing in uncertain databases ICDE 2007 896 905 (Pubitemid 47422093)
11. Y. Qi, R. Jain, S. Singh, and S. Prabhakar Threshold query optimization for uncertain data SIGMOD 2010 315 326
12. A. Knight, Q. Yu, and M. Rege Efficient range query processing on uncertain data IRI 2011 263 268
13. A. Okabe, B. Boots, K. Sugihara, and S.N. Chiu Spatial Tessellations: Concepts and Applications of Voronoi Diagrams 2000 John Wiley & Sons, Inc.
14. W. Evans, and J. Sember Guaranteed Voronoi Diagrams of Uncertain Sites CCCG 2008
15. R. Cheng, J. Chen, M.F. Mokbel, and C.-Y. Chow Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data ICDE 2008 973 982
16. G. Trajcevski, R. Tamassia, H. Ding, P. Scheuermann, and I.F. Cruz Continuous probabilistic nearest-neighbor queries for uncertain trajectories EDBT 2009 874 885
17. X. Lian, and L. Chen Probabilistic group nearest neighbor queries in uncertain databases IEEE TKDE 20 6 2008 809 824 (Pubitemid 351606074)
18. X. Dai, M.L. Yiu, N. Mamoulis, Y. Tao, and M. Vaitis Probabilistic spatial queries on existentially uncertain data SSTD 2005 400 417 (Pubitemid 41433177)
19. M.L. Yiu, N. Mamoulis, X. Dai, Y. Tao, and M. Vaitis Efficient evaluation of probabilistic advanced spatial queries on existentially uncertain data IEEE TKDE 21 1 2009 108 122
20. T. Mitchell Machine Learning 1997 McGraw-Hill
21. Y. Tao, and D. Papadias Time-parameterized queries in spatio-temporal databases SIGMOD 2002 334 345 (Pubitemid 34985559)
22. S. Nutanong, R. Zhang, E. Tanin, and L. Kulik Analysis and evaluation of v*-knn: an efficient algorithm for moving knn queries VLDB Journal 19 3 2010 307 332
23. M.E. Ali, E. Tanin, R. Zhang, and L. Kulik A motion-aware approach for efficient evaluation of continuous queries on 3d object databases VLDB Journal 19 5 2010 603 632
24. S. Babu, and J. Widom Continuous queries over data streams SIGMOD Record 30 3 2001 109 120 (Pubitemid 33610406)
25. L. Liu, and M.T. Özsu Encyclopedia of Database Systems 2009 Springer US
26. Y. Zhu, V. Raghavan, and E.A. Rundensteiner A new look at generating multi-join continuous query plans: a qualified plan generation problem DKE 69 5 2010 424 443
27. H.K. Park, and W.S. Lee Adaptive optimization for multiple continuous queries DKE 71 1 2012 29 46
28. J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee Location-based spatial queries SIGMOD 2003 443 454
29. M.I. Karavelas Voronoi diagrams for moving disks and applications WADS 2001 62 74 (Pubitemid 33315635)
30. S. Fortune A sweepline algorithm for Voronoi diagrams Algorithmica 2 1987 153 174
31. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao Query processing in spatial network databases VLDB 2003 802 813
32. M. Kolahdouzan, and C. Shahabi Voronoi-based k nearest neighbor search for spatial network databases VLDB 2004 840 851
33. G. Zhao, K. Xuan, D. Taniar, and B. Srinivasan Incremental k-nearest-neighbor search on road networks Journal of Interconnection Networks 2008 455 470
34. G. Zhao, K. Xuan, W. Rahayu, D. Taniar, M. Safar, M. Gavrilova, and B. Srinivasan Voronoi-based continuous k nearest neighbor search in mobile navigation IEEE TIE 58 2009 2247 2257
35. K. Mouratidis, M.L. Yiu, D. Papadias, and N. Mamoulis Continuous nearest neighbor monitoring in road networks VLDB 2006 43 54
36. K. Xuan, G. Zhao, D. Taniar, B. Srinivasan, M. Safar, and M. Gavrilova Network Voronoi diagram based range search AINA 2009 741 748
37. K. Xuan, G. Zhao, D. Taniar, B. Srinivasan, M. Safar, and M. Gavrilova Continuous range search based on network Voronoi diagram International Journal of Grid and Utility Computing 1 2009 328 335
38. M. de Berg, K. Dobrindt, and O. Schwarzkopf On lazy randomized incremental construction STOC 1994 105 114
39. M.A. Mostafavi, C. Gold, and M. Dakowicz Delete and insert operations in Voronoi Delaunay methods and applications Computers & Geosciences 29 4 2003 523 530 (Pubitemid 36619429)
40. S. Berchtold, B. Ertl, D.A. Keim, H.-P. Kriegel, and T. Seidl Fast nearest neighbor search in high-dimensional space ICDE 1998 209 218
41. S. Berchtold, D.A. Keim, H.-P. Kriegel, and T. Seidl Indexing the solution space: a new technique for nearest neighbor search in high-dimensional space IEEE TKDE 12 1 2000 45 57
42. H. Samet Foundations of Multidimensional and Metric Data Structures 2006 Morgan Kaufmann CA
43. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger The R*-Tree: an efficient and robust access method for points and rectangles SIGMOD 1990 322 331
44. A. Guttman R-trees: a dynamic index structure for spatial searching SIGMOD 1984 47 57 (Pubitemid 15469534)
45. TIGER http://www.census.gov/geo/www/tiger/
46. M. E. Ali, E. Tanin, R. Zhang, R. Kotagiri, Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries, CoRR abs/1106.5979, 2011.