T-tree or B-tree: Main memory database index structure revisited

Proceedings - 11th Australasian Database Conference, ADC 2000

Volumn , Issue , 2000, Pages 65-73

  Lu, Hongjun ^a,c   Ng, Yuet Yeung ^a   Tian, Zengping ^a,b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b FUDAN UNIVERSITY   (China)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

LOCKS (FASTENERS); RELATIONAL DATABASE SYSTEMS; TREES (MATHEMATICS);

B TREES; CONCURRENT ACCESS; DISK-BASED; INDEX STRUCTURE; MAIN MEMORY; MAIN MEMORY DATABASE; MULTIPLE USER; SIMULATION STUDIES;

CONCURRENCY CONTROL;

EID: 84962886218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ADC.2000.819815     Document Type: Conference Paper

References (24)

1. A. C. Ammann, M. B. Hanrahan, R. Krishnamurthy, "Design of a Memory Resident DBMS", Proc. IEEE COMPCON Conf. Los Alamitos, CA, 1985 pp.54-57.
2. A. Aho, J. Hoperoft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, 1974.
3. D. Bitton, M. B. Hanrahan, C. Turbyfill, "Performance of Complex Queries in Main Memory Database Systems", Proceedings of the International Conference On Data Engineering, Los Angeles, California, 1987, pp. 72-81.
4. P. Bohannon, D. Lieuwen, R. Rastogi, A. Silberschatz, S. Seshadri, S. Sudarshan, "The Architecture of the Dalí Main-Memory Storage Manager", Multimedia Tools and Applications, Volume 4, Number 2, 1997, pp. 115-151.
5. D. Comer, "The Ubiquitous B-tree", ACM Computer Surveys, Volume 11, Number 2, June 1979, pp. 121-137.
6. D. J. DeWitt et all., "Implementation Techniques for Main Memory Database Systems", Proceedings of ACM-SIGMOD Int'l Conference on Management of Data, Boston, MA, June 1984, pp.1-8.
7. C. S. Ellis, "Concurrent Search and Insertion in AVL-trees", IEEE Transactions on Computers, Volume 29, Number 9, September 1980, pp. 811-917.
8. th International Conference on Very Large Databases, Vancouver, British Columbia, Canada. 1992, pp.533-544.
9. J. Gray, "Notes on Database Operating Systems", Operating Systems: An Advanced Course, Volume 60, Springer-Verlag, New York, 1979.
10. H. Garcia-Molina, K. Salem, "Main Memory Database Systems: An Overview", IEEE Transactions on Knowledge and Data Engineering, Volume 4, Number 6, December 1992, pp. 509-516.
11. th International Conference on Very Large Databases, Santiago, Chile,1994, pp. 48-59.
12. T. Johnson, D. Shasha, "A Framework for the Performance Analysis of Concurrent B-tree Algorithms", Proceedings of ACM-SIGMOD Int'l Conference on Management of Data, Atlantic City, New Jersey, 1990, pp. 273-287.
13. T. Johnson, D. Shasha, "The Performance of Current B-Tree Algorithm", ACM Transactions on Database Systems, Volume 18, Number 1, 1993, pp.51-101.
14. V. Kumar, "Concurrency Control and Recovery in Main Memory Databases", The Journal of Computer Information Systems, Vol. 30, No. 3, USA, Spring 1990, pp. 24-30.
15. th Int. Conf. On Very Large Database, Kyoto, August 1986, pp. 294-303.
16. T. J. Lehman, V. Gottemukkala, "The Design and Performance Evaluation of a Lock Manager for a Memory-Resident Database System", V. Kumar (Ed.), Performance of Concurrency Control Mechanisms in Centralised Database Systems, Prentice-Hall, 1996. pp.406-428
17. T. Lehman, E. J. Shekita, L. Cabrera, "An Evaluation of Starburst's Memory Resident Storage Component", IEEE Transactions on Knowledge and Data Engineering, Volume 4, Number 6, December 1992, pp.555-566.
18. V. Lanin, D. Shasha, "A Symmetric Concurrent B-Tree Algorithm". Proceedings of the Fall Joint Computer Conference, Washington, DC, USA, 1986, pp. 380-389.
19. P. L. Lehman, S. B. Yao, "Efficient Locking for Concurrent Operations on B-trees", ACM Transactions on Database Systems, Volume 6, Number 4, 1981, pp.650-670.
20. C. Mohan, "ARIES/KVL: A key Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-tree Indexes", Proceedings of the 16th International Conference on Very Large Databases, Australia,1990, pp.392-405.
21. Y. Y. Ng, "Concurrency Control on Index Structures for Main Memory Database Management System", Mphil thesis, Department of Computer Science, the Hong Kong University of Science and Technology, June 1999.
22. R. Rastogi, S. Seshadri, P. Bohannon, D. Lieuwen, A. Silberschatz, S. Sudarshan, "Logical and physical versioning in main memory databases", Proceedings of the Twenty-Third International Conference on Very Large Databases, Athens, Greece, 1997, pp.86-95.
23. Y. Sagiv, "Concurrent Operations on B-Tree with Overtaking", Proceedings of ACM SIGACT/SIGMOD Symposium on the Principles of Database Systems, ACM, New York, 1985, pp. 28-37.
24. V. Srinivassan, M. J. Carey, "Performance of B+ Tree Concurrency Control Algorithms", VLDB Journal, Volume 2, Number 4, 1993, pp. 361-406.