Online B-tree merging

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2005, Pages 335-346

  Sun, Xiaowei ^a   Wang, Rui ^a   Salzberg, Betty ^a   Zou, Chendong ^b  

^a Northeastern University   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INPUT OUTPUT PROGRAMS; NETWORK PROTOCOLS; ONLINE SYSTEMS; TREES (MATHEMATICS);

CONTROL MECHANISM; ONLINE B-TREE; SYSTEM FAILURE; USER TRANSACTIONS;

MERGING;

EID: 29844436545     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066196     Document Type: Conference Paper

References (22)

1. K. J. Achyutuni, E. Omiecinski, and S. B. Navathe. Two Techniques for On-Line Index Modifi cation in Shared Nothing Parallel Databases. In Proc ACM SIGMOD Conference, pages 125-136, 1996.
2. R. Bayer and M. Schkolnick. Concurrency of Operations on B-Trees. Acta Inf., 9:1-21, 1977.
3. D. Comer. The Ubiquitous B-Tree. ACM Computing Surveys, 11(2), 1979.
4. A. Gartner, A. Kemper, D. Kossmann, and B. Zeller. Effi cient Bulk Deletes in Relational Databases. In Proc IEEE ICDE Conference, pages 183-192, 2001.
5. G. Graefe. Sorting And Indexing With Partitioned B-Trees. In Biennial Conference on Innovative Data System Research, 2003.
6. J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufmann, 1993.
7. H. V. Jagadish, P. P. S. Narayan, S. Seshadri, S. Sudarshan, and R. Kanneganti. Incremental Organization for Data Recording and Warehousing. In Proc VLDB Conference, pages 16-25, 1997.
8. T. Johnson and D. Shasha. A Framework for the Performance Analysis of Concurrent B-tree Algorithms. In Proc Symposium on Principles of Database Systems, pages 273-287, 1990.
9. M.-L. Lee, M. Kitsuregawa, B. C. Ooi, K.-L. Tan, and A. Mondai. Towards Self-Tuning Data Placement in Parallel Database System. In Proc ACM SIGMOD Conference, pages 225-236, 2000.
10. P. L. Lehman and S. B. Yao. Efficient Locking for Concurrent Operations on B-Trees. ACM Transactions on Database Systems, 6(4):650-670, 1981.
11. D. Lomet. Simple, Robust and Highly Concurrent B-trees with Node Deletion. In Proc IEEE ICDE Conference, pages 18-28, 2004.
12. D. Lomet and B. Salzberg. Access Method Concurrency with Recovery. In Proc ACM SIGMOD Conference, pages 351-360, 1992.
13. D. Lomet and B. Salzberg. Concurrency and Recovery for Index Trees. VLDB Journal, 6:224-240, 1997.
14. C. Mohan. ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. In Proc VLDB Conference, pages 392-405, 1990.
15. C. Mohan and F. Levine. ARIES/IM: an Efficient and High Concurrency Index Management Method Using Write-ahead Logging. In Proc ACM SIGMOD Conference, pages 371-380, 1992.
16. C. Mohan and I. Narang. Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates. In Proc ACM SIGMOD Conference, pages 361-370, 1992.
17. P. Muth, P. E. O'Neil, A. Pick, and G. Weikum. Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method. In Proc VLDB Conference, pages 452-463, 1998.
18. N. Ponnekanti and H. Kodavalla. Online Index Rebuild. In Proc ACM SIGMOD Conference, pages 529-538, 2000.
19. H. Schmetman. CSIM19: A Powerful Tool for Building System Models. In Proc Winter Simulation Conference, 2001.
20. + Tree Concurrency Algorithms. VLDB Journal, 2(4):361-406, 1993.
21. + trees. In Proc ACM SIGMOD Conference, pages 115-124, 1996.
22. C. Zou and B. Salzberg. Safely and Efficiently Updating References During On-line Reorganization. In Proc VLDB Conference, pages 512-522, 1998.