Maintenance of k-nn and spatial join queries on continuously moving points

ACM Transactions on Database Systems

Volumn 31, Issue 2, 2006, Pages 485-536

  Iwerks, Glenn S ^a,b   Samet, Hanan ^a   Smith, Kenneth P ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b MITRE CORPORATION   (United States)

Author keywords

Continuously moving objects; K nearest neighbor; Materialized view maintenance; Moving object databases; Spatial join; Temporal databases

Indexed keywords

CONTINUOUSLY MOVING OBJECTS; K-NEAREST NEIGHBOR; MATERIALIZED VIEW MAINTENANCE; MOVING OBJECT DATABASES; SPATIAL JOIN; TEMPORAL DATABASES;

DATA ACQUISITION; FUNCTIONS; INVERSE KINEMATICS; KNOWLEDGE ACQUISITION; MOBILE ROBOTS; VECTORS;

QUERY LANGUAGES;

EID: 33745275587     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1138394.1138396     Document Type: Article

References (49)

1. AGARWAL, P. K., ARGE, L., AND ERICKSON, J. 2000. Indexing moving points. In Proceedings of the 19th ACM Symposium on Principles of Database Systems (Dallas, TX). ACM, New York, 175-186.
2. AGARWAL, P. K. AND PROCOPIUC, C. M. 2002. Advances in indexing for mobile objects. IEEE Bull. Tech. Comm. Data Eng. 25, 2, 25-34.
3. ARGE, L., PROCOPIUC, O., RAMASWAMY, S., SUEL, T., VAHRENHOLD, J., AND VITTER, J. S. 2000. A unified approach for indexed and non-indexed spatial joins. In Proceedings of the 7th International Conference on Extending Database Technology - EDBT2000 (Konstanz, Germany). 413-429.
4. ARYA, S., MOUNT, D. M., NETANYAHU, N. S., SILVERMAN, R., AND WU, A. Y. 1998. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 46, 6 (Nov.), 891-923.
5. BASCH, J., GUIBAS, L. J., AND HERSHBERGER, J. 1997. Data structures for mobile data, In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA). ACM, New York, 747-756.
6. BENETIS, R., JENSEN, C., KARCIAUSKAS, G., AND SALTENIS, S. 2002. Nearest neighbor and reverse nearest neighbor queries for moving objects. In Proceedings of the International Database Engineering and Applications Symposium (IDEAS) (Edmonton, Ont., Canada). 44-53.
7. BRINKHOFF, T., KRIEGEL, H. P., AND SEEGER, B. 1993. Efficient processing of spatial joins using R-trees. In Proceedings of the ACM SIGMOD Conference (Washington, DC). ACM, New York, 237-246.
8. DOUGLAS, D. AND PEUCKER, T. 1973. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartograph. 10, 2, 112-122.
9. FUJIMOTO, R. M. 1990. Parallel discrete event simulation. Commun. ACM 33, 10 (Oct.), 30-53.
10. GEDIK, B., WU, K., YU, P., AND LIU, L. 2004. Motion adaptive indexing for moving continual queries over moving objects. In Proceedings of the Conference on Information and Knowledge Management (Washington, DC). 427-436.
11. GUPTA, A., MUMICK, I. S., AND SUBRAHMANIAN, V. S. 1993. Maintaining views incrementally. In Proceedings of the ACM SIGMOD Conference (Washington, DC). ACM, New York, 157-166.
12. GÜTING, R. H., BÖHLEN, M. H., ERWIG, M., JENSEN, C. S., LORENTZOS, N. A., SCHNEIDER, M., AND VAZIRGIANNIS, M. 2000. A foundation for representing and querying moving objects. ACM Trans. Datab. Syst. (TODS) 25, 1 (Mar.), 1-42.
13. GÜTING, R. H. AND SCHNEIDER, M. 2005. Moving Objects Databases. Morgan-Kaufmann, San Francisco, CA.
14. GUTTMAN, A. 1984. R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference (Boston, MA). ACM, New York, 47-57.
15. HELLERSTEIN, J. M., NAUGHTON, J. F., AND PFEFFER, A. 1995. Generalized search trees for database systems. In Proceedings of the 21st International Conference on Very Large Data Bases (Zurich, Switzerland). 562-573.
16. HJALTASON, G. R. AND SAMET, H. 1998. Incremental distance join algorithms for spatial databases. In Proceedings of the ACM SIGMOD Conference (Seattle, WA). ACM, New York, 237-248.
17. HJALTASON, G. R. AND SAMET, H. 1999. Distance browsing in spatial databases. ACM Trans. Datab. Syst. 24, 2 (June), 265-318. (Also University of Maryland Computer Science TR-3919).
18. IWERKS, G. S., SAMET, H., AND SMITH, K. 2003. Continuous k-nearest neighbor queries for continuously moving points with updates. In Proceedings of the 29th International Conference on Very Large Data Bases (Berlin, Germany). 512-523.
19. IWERKS, G. S., SAMET, H., AND SMITH, K. 2004. Maintenance of spatial semijoin queries on moving points. In Proceedings of the 30th International Conference on Very Large Data Bases (Toronto, Ont., Canada).
20. JENSEN, C. S. AND SALTENIS, S. 2002. Towards increasingly update efficient moving-object indexing. IEEE Bull. Tech. Comm. Data Eng. 25, 2 (June), 35-40.
21. KALASHNIKOV, D. V., PRABHAKAR, S., AND HAMBRUSCH, S. E. 2004. Main memory evaluation of monitoring queries over moving objects. Distrib. Para. Datab. 15, 2 (Mar.), 117-135.
22. LEMA, J. A. C., FORLIZZI, L., GÜTING, R. H., NARDELLI, E., AND SCHNEIDER, M. 2003. Algorithms for moving objects databases. Comput. J. 46, 6, 680-712.
23. LO, M.-L. AND RAVISHANKAR, C. V. 1996. Spatial hash-joins. In Proceedings of the ACM SIGMOD Conference (Montréal, Ont., Canada). ACM, New York, 247-258.
24. MOKBEL, M. F., GHANEM, T. M., AND AREF, W. G. 2003. Spatio-temporal access methods. IEEE Bull. Tech. Comm. Data Eng. 26, 2 (June), 40-49.
25. MOKBEL, M. F., XIONG, X., AND AREF, W. G. 2004. SINA: Scalable incremental processing of continuous queries in spatio-temporal databases. In Proceedings of the ACM SIGMOD Conference (Paris, France). ACM, New York.
26. MOKHTAR, H., SU, J., AND IBARRA, O. 2002. On moving object queries. In Proceedings of the 21st ACM Symposium on Principles of Database Systems (Madison, WI). ACM, New York, 188-198.
27. NAKAMURA, Y. AND YAMANE, K. 2000. Dynamics computation of structure-varying kinematic chains and its application to human figures. IEEE Trans. Rob. Automat. 16, 2 (Apr.), 124-134.
28. NASCIMENTO, M. A., SILVA, R., AND THEODORIDIS, Y. 1999. Evaluation of access structures for discretely moving points. In Proceedings of the International Workshop on Spatio-Temporal Database Management (Edinburgh, UK), 171-188.
29. ÖZSOYOǦLU, G. AND SNODGRASS, R. T. 1995. Temporal and real-time databases: A survey. IEEE Trans. Knowl. Data Eng. 7, 4 (Aug.), 513-532.
30. PATEL, J. M. AND DEWITT, D. J. 1996. Partition based spatial-merge join. In Proceedings of the ACM SIGMOD Conference (Montréal, Ont., Canada). ACM, New York, 259-270.
31. PFOSER, D. 2002. Indexing the trajectories of moving objects. IEEE Bull. Tech. Comm. Data Eng 25, 2 (June), 3-9.
32. PFOSER, D. AND JENSEN, C. S. 1999. Capturing the uncertainty of moving-object representations. In Proceedings of the Advances in Spatial Databases - Sixth International Symposium, SSD'99 (Hong Kong). Lecture Notes in Computer Science, vol 1651. Springer-Verlag, New York, 111-132.
33. PROCOPIUC, C. M., AGARWAL, P. K., AND HAR, S.PELED. 2002. Star-tree: An efficient self-adjusting index for moving objects. In Proceedings of the Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments (San Francicsco, CA). 178-193.
34. RAPTOPOULOU, K., PAPADOPOULOS, A. N., AND MANOLOPOULOS, Y. 2003. Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7, 2, 113-137.
35. ROUSSOPOULOS, N., KELLEY, S., AND VINCENT, F. 1995. Nearest neighbor queries. In Proceedings of the ACM SIGMOD Conference (San Jose, CA). ACM, New York, 71-79.
36. SALTENIS, S., JENSEN, C. S., LEUTENEGGER, S. T., AND LOPEZ, M. A. 2000. Indexing the positions of continuously moving objects. In Proceedings of the ACM SIGMOD Conference (Dallas, TX). ACM, New York, 331-342.
37. SAMET, H. 1990. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.
38. SCIS. 1996. IEEE Std. 1278 1-1995. IEEE Computer Society, Standards Committee on Interactive Simulation, USA.
39. SISTLA, A. P., WOLFSON, O., CHAMBERLAIN, S., AND DAO, S. 1997. Modeling and querying moving objects. In Proceedings of the 13th IEEE Conference on Data Engineering (ICDE) (Birmingham, UK). IEEE Computer Society Press, Los Alamitos, CA, 422-432.
40. SONG, Z. AND ROUSSOPOULOS, N. 2001. K-nearest neighbor search for moving query point. In Proceedings of the Advances in Spatial and Temporal Databases (SSTD) (Redondo Beach, CA). Lecture Notes in Computer Science, vol. 2121. Springer-Verlag, New York, 79-96.
41. TAO, Y. AND PAPADIAS, D. 2003. Spatial queries in dynamic environments. ACM Trans. Datab. Syst. (TODS) 28, 2 (June), 101-139.
42. TAO, Y., PAPADIAS, D., AND SUN, J. 2003a. The tpr*-tree: An optimized spatio-temporal access method for predictive queries. In Proceedings of the 29th International Conference on Very Large Data Bases (Berlin, Germany). 790-801.
43. TAO, Y., SUN, J., AND PAPADIAS, D. 2003b. Selectivity estimation for predictive spatio-temporal queries. In Proceedings of 19th IEEE International Conference on Data Engineering (ICDE) (Bangalore, India). IEEE Computer Society Press, Los Alamitos, CA, 417-428.
44. TAYEB, J., ULUSOY, Ö., AND WOLFSON, O. 1998. A quadtree-based dynamic attribute indexing method. Comput. J. 41, 3, 185-200.
45. TRAJCEVSKI, G., SCHEUERMANN, P., WOLFSON, O., AND NEDUNGADI, N. 2004a. CAT: Correct answers of continuous queries using triggers. In Proceedings of the International Conference on Extending Database Technology (EDBT) (Heraklion, Greece). 837-840.
46. TRAJCEVSKI, G., WOLFSON, O., HINRICHS, K., AND CHAMBERLAIN, S. 2004b. Managing uncertainty in moving objects databases. ACM Trans. Datab. Syst. (TODS) 29, 3 (Sept.), 463-507.
47. WOLFSON, O., CHAMBERLAIN, S., DAO, S., JIANG, L., AND MENDEZ, G. 1998. Cost and imprecision in modeling the position of moving objects. In Proceedings of the 14th IEEE International Conference on Data Engineering (ICDE). 588-596.
48. XIONG, X., MOKBEL, M. F., AND AREF, W. G. 2005. SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In Proceedings of the International Conference of Data Engineering (Tokyo, Japan).
49. XIONG, X., MOKBEL, M. F., AREF, W. G., HAMBRUSCH, S. E., AND PRABHAKAR, S. 2004. Scalable spatio-temporal continuous query processing for location-aware services. In Proceedings of the International Conference on Scientific and Statistical Database (Santorini Island, Greece).