Efficient bulk updates on multiversion B-trees

Proceedings of the VLDB Endowment

Volumn 6, Issue 14, 2013, Pages 1834-1845

  Achakeev, Daniar ^a   Seeger, Bernhard ^a  

^a PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PERFORMANCE; BULK LOADING; INDEX STRUCTURE; LOADING ALGORITHMS; LOWER BOUNDS; MULTI-VERSION; REAL-LIFE APPLICATIONS; WORST-CASE PERFORMANCE;

LOADING;

EID: 84891120884     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2556549.2556566     Document Type: Article

References (30)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31(9):1116-1127, 1988.
2. M. Al-Kateb, A. Ghazal, A. Crolotte, R. Bhashyam, J. Chimanchode, and S. P. Pakala. Temporal query processing in teradata. In EDBT, pages 573-578, 2013.
3. Apache:. Apache hbase. http://hbase.apache.org/.
4. L. Arge. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1-24, 2003.
5. L. Arge, A. Danner, and S.-M. Teh. I/o-efficient point location using persistent b-trees. In ALENEX, pages 82-92, 2003.
6. L. Arge, K. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic r-trees. Algorithmica, 33(1):104-128, 2002.
7. L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In FOCS, pages 560-, Washington, DC, USA, 1996. IEEE Computer Society.
8. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion b-tree. VLDB J., 5(4):264-275, 1996.
9. J. V. d. Bercken, B. Seeger, and P. Widmayer. A generic approach to bulk loading multidimensional index structures. In VLDB '97, pages 406-415, 1997.
10. J. V. den Bercken and B. Seeger. Query processing techniques for multiversion access methods. In VLDB, pages 168-179, 1996.
11. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. Syst. Sci., 38(1):86-124, 1989.
12. L. Golab, T. Johnson, J. S. Seidel, and V. Shkapenyuk. Stream warehousing with datadepot. In SIGMOD, pages 847-854, 2009.
13. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry (preliminary version). In FOCS, pages 714-723, 1993.
14. M. Hadjieleftheriou, G. Kollios, J. Tsotras, and D. Gunopulos. Indexing spatiotemporal archives. The VLDB Journal, 15(2):143-164, June 2006.
15. B. Hoßbach and B. Seeger. Anomaly management using complex event processing: extending data base technology paper. In EDBT, pages 149-154, 2013.
16. IBM:. A Matter of Time: Temporal Data Management in DB2 for z/OS. http://www.ibm.com/developerworks/data/library/techarticle/dm-1204db2temporaldata/.
17. K. Kulkarni and J.-E. Michels. Temporal features in sql:2011. SIGMOD Rec., 41(3):34-43, Oct. 2012.
18. W. Le, F. Li, Y. Tao, and R. Christensen. Optimal splitters for temporal and multi-version databases. In SIGMOD, 2013.
19. S. Leutenegger, M. A. Lopez, and J. Edgington. Str: A simple and efficient algorithm for r-tree packing. In ICDE, pages 497-506, 1997.
20. D. Lomet and B. Salzberg. Access methods for multiversion data. In SIGMOD, pages 315-324, 1989.
21. D. B. Lomet, M. Hong, R. V. Nehme, and R. Zhang. Transaction time indexing with version compression. PVLDB, 1(1):870-881, 2008.
22. D. B. Lomet and F. Li. Improving transaction-time dbms performance and functionality. In ICDE, pages 581-591, 2009.
23. Oracle:. Total Recall. http://www.oracle.com/technetwork/database/applicationdevelopment/total-recall-1667156.html.
24. O. Rodeh. B-trees, shadowing, and clones. TOS, 3(4), 2008.
25. B. Salzberg and V. J. Tsotras. Comparison of access methods for time-evolving data. ACM Comput. Surv., 31(2):158-221, June 1999.
26. A. Seering, P. Cudré-Mauroux, S. Madden, and M. Stonebraker. Efficient versioning for scientific array databases. In ICDE, pages 1013-1024, 2012.
27. Y. Tao and D. Papadias. Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In VLDB, pages 431-440, 2001.
28. P. J. Varman and R. M. Verma. An efficient multiversion access structure. IEEE Trans. Knowl. Data Eng., 9(3):391-409, 1997.
29. XXL:.Xxl-java-libary. xxl.googlecode.com.
30. R. Zhang and M. Stradling. The hv-tree: a memory hierarchy aware version index. PVLDB, 3(1):397-408, 2010.