Handling frequent updates of moving objects

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2005, Pages 493-500

  Lin, Bin ^a   Su, Jianwen ^a  

^a Santa Barbara   (United States)

Author keywords

Lazy group update; Moving objects database; TPR Tree

Indexed keywords

ALGORITHMS; BUFFER STORAGE; COMPUTER SIMULATION; INDEXING (OF INFORMATION); QUERY LANGUAGES; STRATEGIC PLANNING; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

LAZY GROUP UPDATE; MOVING OBJECTS DATABASE; TPR-TREE;

DATABASE SYSTEMS;

EID: 33745768474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1099554.1099691     Document Type: Conference Paper

References (35)

1. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. In Proc. Workshop on Algorithms and Data structures, 1995.
2. L. Arge. Private communications, 2004.
3. L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. In Proc. of 1st Workshop on Algorithm Engineering and Experimentation, 1999.
4. B. Becker, S. Gschwind, T. Ohler, et al. An asymptotically optimal multiversion B-tree. VLDB Journal, 5(4), 1996.
5. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD, 1990.
6. T. Brinkhoff. Generating traffic data. Bulletin on Data Engineering, IEEE Computer Society, 26(2):19-25, 2003.
7. R. Choubey, L. Chen, and E. A. Rundensteiner. GBI: A generalized R-Tree bulk-insertion strategy. In P roc. SLSD, 1999.
8. R. Güting, M. Böhlen, M. Erwig, et al. A foundation for representing and querying moving objects. ACM TODS, 25(1), 2000.
9. A. Guttman. R-Trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD, 1984.
10. G. Kollios, D. Papadopoulos, D. Gunopulos, and V. J. Tsotras. Indexing mobile objects using dual transformations. In VLDB Journal, 2005.
11. G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects. In Proc. ACM PODS, 1999.
12. A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE TKDE, 10(1), 1998.
13. D. K won, S. Lee, and S. Lee. Indexing the current positions of moving objects using the lazy update R-tree. In Proc. MDM, 2002.
14. K. S. Larsen, Relaxed multi-way trees with group updates. In Proc. PODS, 2001.
15. M. L. Lee, W. Hsu, C. S. Jensen, and K. L. Teo. Supporting frequent updates in R-trees: a bottom-up approach. In Proc. VLDB, 2003.
16. L. Malmi and E. S. Soininen. Group updates for relaxed height-balanced trees. In Proc. PODS, 1999.
17. H. Mokhtar, J. Su, and O. Ibarra. On moving object queries. In Proc. PODS, 2002.
18. S. W. Ng. Advances in disk technology : performance issues. IEEE Computer, May 1998.
19. D. Papadopoulos, G. Kollios, D. Gunopulos, and V. I. Tsotras. Indexing mobile objects on the plane. In DEXA, 2002.
20. M. Raab and A. Steger. Balls into bins - a simple and tight analysis. In RANDOM, 1998.
21. R. Ramakrishnan et al. Science of design for information systems. ACM SIGMOD Record, 33(1), 2004.
22. J. Rao and K. A. Ross. Making B+-trees cache conscious in main memory. ACM SIGMOD, 2000.
23. J. Zhou and Ke. A. Ross. Buffering Accesses to Memory-Resident Index Structures. VLDB, 2003.
24. S. Saltenis. http://www.cs.auc.dk/simas/tpr/tpr.tar.gz.
25. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. Proc. ACM SIGMOD, 2000.
26. T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The r+-tree: A dynamic index for multi-dimensional objects. In Proc. VLDB, 1987.
27. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and querying moving objects. In Proc. ICDE, 1997.
28. Z. Song and N. Roussopoulos. Hashing moving objects. In Proc. MDM, 2001.
29. Z. Song and N. Roussopoulos. k-nearest neighbor search for moving query point. In Proc. SSTD, 2001.
30. Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In VLDB, 2003.
31. J. Tayeb, O. Ulusoy, and O. Wolfson. A quadtree based dynamic attribute indexing method. The Computer Journal, 41(3), 1998.
32. Y. Theodoridis and T. Sellis. A model for the prediction of R-tree performance. In Proc. PODS, 1996.
33. Y. Theodoridis, J. R. O. Silva, and M. A. Nascimento. On the generation of spatiotemporal datasets. In Proc. SSD, 1999.
34. O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving objects databases: issues and solutions. In Proc. SSDBM, 1998.
35. H. Zhu, J. Su, and O. Ibarra. Trajectory queries and octagons in moving object databases. In Proc. ACM CIKM, 2002.