Optimized algorithms for predictive range and KNN queries on moving objects

Information Systems

Volumn 35, Issue 8, 2010, Pages 911-932

  Zhang, Rui ^a   Jagadish, H V ^b   Dai, Bing Tian ^c   Ramamohanarao, Kotagiri ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF MICHIGAN   (United States)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

kNN; Moving objects; Nearest neighbor query; Range query; Spatio temporal databases; Transformed Minkowski Sum

Indexed keywords

MINKOWSKI SUM; MOVING OBJECTS; NEAREST NEIGHBOR QUERIES; RANGE QUERY; SPATIO-TEMPORAL DATABASE;

ALGORITHMS; TRACKING (POSITION);

OPTIMIZATION;

EID: 77955551615     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2010.05.004     Document Type: Article

References (31)

1. P.K. Agarwal, L. Arge, and J. Erickson Indexing moving points PODS 2000
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger The R*-tree: an efficient and robust access method for points and rectangles SIGMOD 1990
3. R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis Nearest neighbor and reverse nearest neighbor queries for moving objects IDEAS 2002 44 53
4. R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis Nearest and reverse nearest neighbor queries for moving objects VLDB Journal 15 3 2006 229 249
5. C. Bohm A cost model for query processing in high-dimensional data spaces TODS 25 2 2000 129 178
6. S Chen, C.S. Jensen, and D. Lin A benchmark for evaluating moving object indexes PVLDB 1 2 2008 1574 1585
7. 2b-tree: a self-tunable spatio-temporal b-tree index for moving objects SIGMOD Conference 2008 29 42
8. G. Ewald Combinatorial Convexity and Algebraic Geometry 1996 Springer
9. G.R. Hjaltason, and H. Samet Ranking in spatial databases SSD 1995
10. H. Hu, J. Xu, and D.L. Lee A generic framework for monitoring continuous spatial queries over moving objects SIGMOD Conference 2005 479 490
11. G.S. Iwerks, H. Samet, and K.P. Smith Continuous k-nearest neighbor queries for continuously moving points with updates VLDB 2003 512 523
12. H.V. Jagadish, A. Silberschatz, and S. Sudarshan Recovering from main-memory lapses VLDB 1993 391 404
13. C. Jensen, D. Lin, and B.C. Ooi Query and update efficient B-tree based indexing of moving objects VLDB 2004
14. G. Kollios, D. Gunopulos, and V.J. Tsotras On indexing mobile objects PODS 1999
15. K. Mouratidis, M. Hadjieleftheriou, and D. Papadias Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring SIGMOD Conference 2005 634 645
16. J.M. Patel, Y. Chen, and V.P. Chakka STRIPES: an efficient index for predicted trajectories SIGMOD 2004
17. K. Raptopoulou, A. Papadopoulos, and Y. Manolopoulos Fast nearest-neighbor query processing in moving-object databases GeoInformatica 7 2 2003 113 137
18. N. Roussopoulos, S. Kelley, and F. Vincent Nearest neighbor queries SIGMOD 1995
19. S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez Indexing the positions of continuously moving objects SIGMOD 2000
20. H. Samet The quadtree and related hierarchical data structures ACM Computing Survey 16 2 1984 187 260
21. Y.N. Silva, X. Xiong, and W.G. Aref The rum-tree: supporting frequent updates in r-trees using memos VLDB Journal 18 3 2009 719 738
22. A.P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao Modeling and querying moving objects ICDE 1997
23. Y. Tao, and D. Papadias Spatial queries in dynamic environments TODS 28 2 2003 101 139
24. Y. Tao, D. Papadias, and J. Sun The TPR*-tree: an optimized spatio-temporal access method for predictive queries VLDB 2003
25. Y. Tao, J. Sun, and D. Papadias Analysis of predictive spatio-temporal queries TODS 28 4 2003 295 336
26. Y. Tao, and X. Xiao Primal or dual: which promises faster spatiotemporal search? VLDB Journal 17 5 2008 1253 1270
27. Y. Tao, J. Zhang, D. Papadias, and N. Mamoulis An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces IEEE Transactions on Knowledge and Data Engineering 16 10 2004 1169 1184
28. X. Xiong, M.F. Mokbel, and W.G. Aref Sea-cnn: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases ICDE 2005 643 654
29. ual-tree: indexing moving objects by space filling curves in the dual space VLDB Journal 17 3 2008 379 400
30. X. Yu, K.Q. Pu, and N. Koudas Monitoring k-nearest neighbor queries over moving objects ICDE 2005 631 642
31. R. Zhang, D. Lin, K. Ramamohanarao, and E. Bertino Continuous intersection joins over moving objects ICDE 2008 863 872