Continuous probabilistic nearest-neighbor queries for uncertain trajectories

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09

Volumn , Issue , 2009, Pages 874-885

  Trajcevski, Goce ^a   Tamassia, Roberto ^b   Ding, Hui ^a   Scheuermann, Peter ^a   Cruz, Isabel F ^c  

^a NORTHWESTERN UNIVERSITY   (United States)

^b BROWN UNIVERSITY   (United States)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT STRUCTURES; CONTINUOUS NEAREST NEIGHBORS; EFFICIENT ALGORITHM; MODEL YIELDS; MOVING OBJECTS; NEAREST-NEIGHBOR QUERY; PARAMETERIZED; SPATIO-TEMPORAL;

ALGORITHMS; TRACKING (POSITION);

DATABASE SYSTEMS;

EID: 70349162749     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516460     Document Type: Conference Paper

References (40)

1. F. Aurenhammer. Voronoi diagrams-a survey of a fundamental geometric data structure. ACM Gomput. Surv., 23(3), 1991.
2. R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis. Nearest and reverse nearest neighbor queries for moving objects. VLDB Journal, 15(3):229-249, 2006.
3. H. Cao, O. Wolfson, and G. Trajcevski. Spatio-temporal data reduction with deterministic error bounds. VLDB Journal, 15(3), 2006.
4. R. Cheng, J. Chen, M. F. Mokbel, and C.-Y. Chow. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In ICDE, 2008.
5. R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving objects environments. IEEE Transactions on Knowledge and Data Engineering, 16(9), 2003.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 2001.
7. B. V. Gnedenko. Course of Probability Theory. Nauka, 1988.
8. R. Güting and M. Schneider. Moving Objects Databases. Morgan Kaufmann, 2005.
9. M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, and D. Gunopulos. Efficient indexing of spatiotemporal objects. In EDBT, 2002.
10. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems, 24(2):265-318, 1999.
11. K. Hornsby and M. Egenhofer. Modeling moving objects over multiple granularities. Ann. Math. Artif. Intell., 36(1-2):177-194, 2002.
12. Y.-K. Huang, C.-C. Chen, and C. Lee. Continuous k-nearest neighbor query for moving objects with uncertain velocity. Geolnformatica, 2007. DOI 10.1007/sl0707-007-0041-0.
13. G. Iwerks, H. Samet, and K. Smith. Maintenance of K-nn and spatial join queries on continuously moving points. ACM Transactions on Database Systems, 31(2), 2006.
14. M. Karavelas. Voronoi diagrams for moving disks and applications. In WADS, pages 62-74, 2001.
15. G. Kollios, D. Gunopulos, and V. Tsotras. Nearest neighbor queries in a mobile environment. In Spatio-Temporal Database Management, pages 119-134, 1999.
16. J. Lema, L. Forlizzi, R. Güting, E. Nardelli, and M. Schneider. Algorithms for moving objects databases. Computing Journal, 46(6), 2003.
17. J. S. Lim. Two-Dimensional Signal and Image Processing. Prentice Hall, 1990.
18. M. Mokbel, X. Xiong, and W. Aref. SINA: Scalable incremental processing of continuous queries in spatio-temporal databases. In ACM SIGMOD, 2004.
19. K. Mouratidis, M. Yiu, D. Papadias, and N. Mamoulis. Continuous nearest neighbor monitoring in road networks. In VLDB, pages 43-54, 2006.
20. P. Olofsson. Probability, Statistics and Stochastic Processes. Wiley-Interscience. 2005.
21. J. Pei, M. Hua, Y. Tao, and X. Lin. Query answering techniques on uncertain and probabilistic data: tutorial summary. In ACM SIGMOD, 2008.
22. D. Pfoser and C. Jensen. Capturing the uncertainty of moving objects representation. In SSD, 1999.
23. K. Raptopoulou, A. Papadopoulos, and Y. Manolopoulos. Fast nearest-neighbor query processing in moving-object databases. Geolnformatica, 7(2):113-137, 2003.
24. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In ACM SIGMOD, pages 71-79, 1995.
25. H. Royden. Real Analysis. Macmillan Co., 1963.
26. J. Schiller and A. Voisard. Location-based Services. Morgan Kaufmann Publishers, 2004.
27. C. Shahabi, M. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. Geolnformatica, 7(3):255-273, 2003.
28. G. Shakharovich, T. Darrel, and P. Indyk, editors. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, 2006.
29. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995.
30. M. Soliman, I. Ilyas, and K.-C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.
31. D. Suciu and N. Dalvi. Foundations of probabilistic answers to queries. In ACM SIGMOD, 2005. Tutorial.
32. P.-N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Addison-Wesley, 2005.
33. Y. Tao and D. Papadias. Spatial queries in dynamic environments. ACM Transactions on Database Systems, 28(2), 2003.
34. Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. In VLDB, 2002.
35. Y. Tao, X. Xiao, and R. Cheng. Range search on multidimensional uncertain data. ACM Transactions on Database Systems, 32(3), 2007.
36. G. Trajcevski, R. Tamassia, H. Ding, P. Scheuermann, and I. F. Cruz. Moving convolutions and continuous probabilistic nearest-neighbor queries for uncertain trajectories. Technical Report NWU-EECS-08-12, Northwestern University, Department of EECS, 2008. http://www. eecs. northwestern.edu/docs/ techreports/.
37. G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain. Managing uncertainty in moving objects databases. A CM Transactions on Database Systems, 29(3), 2004.
38. O. Wolfson, A. P. Sistla, S. Chamberlain, and Y. Yesha. Updating and querying databases that track mobile units. Distributed, and Parallel Databases, 7, 1999.
39. X. Xiong, M. Mokbel, and W. Aref. SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In ICDE, pages 643-654, 2005.
40. X. Yu, K. Pu, and N. Koudas. Monitoring k-nearest neighbor queries over moving objects. In ICDE, pages 631-642, 2005.