Continuous intersection joins over moving objects

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 863-872

  Zhang, Rui ^a   Lin, Dan ^b   Ramamohanarao, Kotagiri ^a   Bertino, Elisa ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERSECTIONS; OPTIMIZATION; QUERY PROCESSING; TECHNOLOGY;

COMPUTATION COSTS; COMPUTATIONALLY EXPENSIVE; DATA ENGINEERING; EXPERIMENTAL STUDIES; INTERNATIONAL CONFERENCES; JOIN ALGORITHMS; MOVING OBJECTS; NEW CONCEPT; ORDERS-OF-MAGNITUDE; TIME DIMENSIONS; TIME INTERVALS;

CONSTRAINED OPTIMIZATION;

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

References (22)

1. K. L. Morse, 'Interest management in large-scale distributed simulations, Tech. Rep. ICS-TR-96-27, 1996.
2. J. S. Dahmann, R. Fujimoto, and R. M. Weatherly, "The department of defense high level architecture," in Winter Simulation Conference.
3. Y. Tao and D. Papadias, "Time-parameterized queries in spatio-temporal databases," in SIGMOD, 2002.
4. S. Saltenis, C. S.Jensen, S. T. Leutenegger, and M. A. Lopez, "Indexing the positions of continuously moving objects," in SIGMOD, 2000.
5. Y. Tao, D. Papadias, and J. Sun, "The TPR*-tree: An optimized spatiotemporal access method for predictive queries," in VLDB, 2003.
6. G. S. Iwerks, H. Samet, and K. P. Smith, 'Maintenance of spatial semijoin queries on moving points." in VLDB, 2004.
7. M. F. Mokbel, X. Xiong, and W. G. Aref, "Sina: Scalable incremental processing of continuous queries in spatio-temporal databases." in SIGMOD, 2004, pp. 623-634.
8. C. Jensen, D. Lin, and B.C.Ooi, 'Query and update efficient B+-tree based indexing of moving objects," in VLDB, 2004.
9. G. Kollios, D. Gunopulos, and V. J. Tsotras, 'On indexing mobile objects," in PODS, 1999.
10. J. M. Patel, Y. Chen, and V. P. Chakka, "STRIPES: An efficient index for predicted trajectories,"in SIGMOD, 2004.
11. J. Orenstein, "Spatial query processing in an object-oriented database system," in SIGMOD, 1986, pp. 326-336.
12. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: An efficient and robust access method for points and rectangles," in SIGMOD, 1990.
13. R. Zhang, D. Lin, R. Kotagiri, and E. Bertino, 'Continuous intersection joins over moving objects. A full version of this paper," http://www.cs.mu.oz.au/~rui/publication/TR_mj.pdf.
14. T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient processing of spatial joins using r-trees." in SIGMOD, 1993.
15. J. M. Patel and D. J. DeWitt, 'Partition based spatial-merge join," in SIGMOD, 1996, pp. 259-270.
16. R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis, "Nearest and reverse nearest neighbor queries for moving objects." VLDB Journal, vol. 15, no. 3, pp. 229-249, 2006.
17. G. S. Iwerks, H. Samet, and K. P. Smith, "Maintenance of k-nn and spatial join queries on continuously moving points." TODS, vol. 31, no. 2, pp. 485-536, 2006.
18. D. Pfoser, C. S. Jensen, and Y. Theodoridis, "Novel approaches in query processing for moving object trajectories," in VLDB, 2000.
19. K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, 'Conceptual partitioning: An effi cient method for continuous nearest neighbor monitoring." in SIGMOD, 2005.
20. B. Gedik, K.-L. Wu, P. S. Yu, and L. Liu, 'Motion adaptive indexing for moving continual queries over moving objects." in CIKM, 2004.
21. S. Arumugam and C Jermaine, 'Closest-point-of-approach join for moving object histories." in ICDE, 2006.
22. M.-L. Lo and C. V. Ravishankar, 'Spatial hash-joins,"in SIGMOD, 1996, pp. 247-258.