A benchmark for evaluating moving object indexes

Proceedings of the VLDB Endowment

Volumn 1, Issue 2, 2008, Pages 1574-1585

  Chen, Su ^a   Jensen, Christian S ^b   Lin, Dan ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b AALBORG UNIVERSITY   (Denmark)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; EFFICIENCY; INDEXING (OF INFORMATION); QUERY PROCESSING;

EMPIRICAL STUDIES; FUTURE POSITION; INDEXING TECHNIQUES; PERFORMANCE PROPERTIES; PROTOTYPE IMPLEMENTATIONS; QUERY EFFICIENCY; SCIENCE AND ENGINEERING; STORAGE REQUIREMENTS;

BENCHMARKING;

EID: 77953126964     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1454159.1454229     Document Type: Article

References (25)

1. TPR*-tree. http://www.rtreeportal.org/code.html.
2. U.S. Census Bureau - TIGER/Line. http://www.census.gov/geo/www/tiger/.
3. 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, pp. 322-331, 1990.
4. L. Biveinis, S. Š;altenis, and C. S. Jensen. Main-memory operation buffering for efficient r-tree update. In Proc. VLDB, pp. 591-602, 2007.
5. T. Brinkhoff. A framework for generating network-based moving objects. GeoInformatica, 6(2): 153-180, 2002.
6. +-tree Index for Moving Objects. Proc. ACM SIGMOD, pp. 29-42, 2008.
7. C. Düntgen, T. Behr, and R. H. Güting. BerlinMOD: a benchmark for moving object databases. Technical Report 340, FernUniversität Hagen, Germany, 2007.
8. R. A. Finkel and J. L. Bentley. Quadtrees: A data structure for retrieval on composite keys. Acta Inf., 4(1): 1-9, 1974.
9. A. Guttman. R-Trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD, pp. 47-57, 1984.
10. +-tree based indexing of moving objects. In Proc. VLDB, pp. 768-779, 2004.
11. +-tree-based indexing of moving objects. In Proc. MDM, p. 12 (9 pages), 2006.
12. C. S. Jensen, D. Tiešytė, and N. Tradišauskas. The COST benchmark-comparison and evaluation of spatio-temporal indexes. In Proc. DASFAA, pp. 125-140, 2006.
13. D. Kwon, S. Lee, and S. Lee. Indexing the current positions of moving objects using the lazy update. In Proc. MDM, pp. 113-120, 2002.
14. M. L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Teo. Supporting frequent updates in R-trees: a bottom-up approach. In Proc. VLDB, pp. 608-619, 2003.
15. J. Myllymaki and J. Kaufman. DynaMark: a benchmark for dynamic spatial indexing. In Proc. MDM, pp. 92-105, 2003.
16. J. M. Patel, Y. Chen, and V. P. Chakka. STRIPES: An efficient index for predicted trajectories. In Proc. ACM SIGMOD, pp. 637-646, 2004.
17. S. Šaltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In Proc. ACM SIGMOD, pp. 331-342, 2000.
18. H. Samet. The design and analysis of spatial data structures. Addison-Wesley, Boston, MA, USA, 1990.
19. Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In Proc. VLDB, pp. 790-801, 2003.
20. Y. Tao and X. Xiao. Primal or dual: which promises faster spatiotemporal search?, The VLDB Journal, 18 pages, to appear.
21. Y. Theodoridis. Ten benchmark database queries for location-based services. The Computer Journal, 46(6): 713-725, 2003.
22. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Benchmarking access methods for time-evolving regional data. Data Knowl. Eng., 49(3): 243-286, 2004.
23. P. Werstein. A performance benchmark for spatiotemporal databases. In Proc. Annual Colloquium of the Spatial Information Research Centre, pp. 365-373, 1998.
24. X. Xiong and W. G. Aref. R-trees with update memos. In Proc. ICDE, p. 22, 2006 (extended version to appear in The VLDB Journal).
25. dual-tree: indexing moving objects by space-filling curves in the dual space. The VLDB Journal, 17(3): 379-400, 2006.