R-trees with update memos

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 22-

  Xiong, Xiaopeng ^a   Aref, Walid G ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; MULTI-DIMENSIONAL OBJECTS; RUM-TREE; THEORETICAL ANALYSIS;

CLEANING; DATA STORAGE EQUIPMENT; DIMENSIONAL STABILITY; OPERATIONAL AMPLIFIERS; REFUSE DISPOSAL;

TREES (MATHEMATICS);

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

References (25)

1. 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.
2. T. Brinkhoff. A Framework for Generating Network-Based Moving Objects. GeoInformatica, 6(2), 2002.
3. V. P. Chakka, A. Everspaugh, and J. M. Patel. Indexing Large Trajectory Data Sets with SETI. In Proc. of the Conf. on Innovative Data Systems Research, CIDR, 2003.
4. R. Cheng, Y. Xia, S. Prabhakar, and R. Shah. Change Tolerant Indexing for Constantly Evolving Data. In ICDE, 2005.
5. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD, 1984.
6. M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, and D. Gunopulos. Efficient Indexing of Spatiotemporal Objects. In EDBT, pages 251-268, Prague, Czech Republic, Mar. 2002.
7. I. Kamel and C. Faloutsos. Hilbert R-tree: An Improved R-tree using Fractals. In VLDB, pages 500-509, 1994.
8. G. Kollios, D. Gunopulos, and V. J. Tsotras. On Indexing Mobile Objects. In PODS, 1999.
9. D. Kwon, S. Lee, and S. Lee. Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree. In Mobile Data Management, MDM, 2002.
10. M.-L. Lee, W. Hsu, C. S. Jensen, and K. L. Teo. Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In VLDB, 2003.
11. M. A. Nascimento and J. R. O. Silva. Towards historical R-trees. In Proc. of the ACM Symp. on Applied Computing, SAC, pages 235-240, Feb. 1998.
12. D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel Approaches in Query Processing for Moving Object Trajectories. In VLDB, pages 395-406, Sept. 2000.
13. K. Porkaew, I. Lazaridis, and S. Mehrotra. Querying Mobile Objects in SpatioTemporal Databases. In SSTD, pages 59-78, Redondo Beach, CA, July 2001.
14. S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch. Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Transactions on Computers, 51(10):1124-1140, 2002.
15. C. M. Procopiuc, P. K. Agarwal, and S. Har-Peled. STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. In Proc. of the Workshop on Algorithm Engineering and Experimentation, ALENEX, pages 178-193, Jan. 2002.
16. N. Roussopoulos and D. Leifker. Direct spatial search on pictorial databases using packed R-trees. pages 17-31, 1985.
17. S. Saltenis and C. S. Jensen. Indexing of Moving Objects for Location-Based Services. In ICDE, 2002.
18. S. Saltenis and C. S. Jensen. Indexing of now-relative spatio-bitemporal data. The VLDB Journal, 11(1):1-16, 2002.
19. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In SIGMOD, 2000.
20. T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The r+-tree: A dynamic index for multi-dimensional objects. In VLDB, pages 507-518, 1987.
21. Y. Tao and D. Papadias. Efficient Historical R-trees. In SSDBM, pages 223-232, July 2001.
22. Y. Tao and D. Papadias. MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In VLDB, 2001.
23. Y. Tao, D. Papadias, and J. Sun. The TP R*-Tree: An Optimized Spatiotemporal Access Method for Predictive Queries. In VLDB, 2003.
24. Y. Theodoridis, M. Vazirgiannis, and T. Sellis. Spatio-Temporal Indexing for Large Multimedia Applications. In Proc. of the IEEE Conference on Multimedia Computing and Systems, ICMCS, June 1996.
25. X. Xiong and W. G. Aref. R-trees with Update Memos. Purdue University Department of Computer Sciences Technical Report, No. CSD TR05-020, 2005.