Optimization of T-Tree Index of Main Memory Database in Critical Application

Abstract:

One approach to achieving high performance in the DBMS in the critical application is to store the database in main memory rather than on disk. One can then design new data structures and algorithms oriented towards increasing the efficiency of the main memory database -MMDB. In this paper we present some results on index structures from an ongoing study of MMDB. We propose a new index structure, the T-tail Tree. We give the main algorithm of the T-tail Tree and the performance of these algorithms. Our results indicate that T-tail Tree provides good overall performance in main memory.

• Periodical: Applied Mechanics and Materials (Volumes 40-41)
• Pages: 206-211
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.40-41.206
• Online since: November 2010
• Authors: Zhi Lin Zhu
• Keywords: Application Server, BOOM, T Tree, T-Tail Tree

References

[1] Tobin J. Lehman and Michacel J. Carey. A Study of Index Structures for Main Memory Database Management Systems. In Proc. of ACM-SIGMOD Int'l Conference on Management of Data, (1986), pp.239-250.

DOI: 10.1145/16856.16878

[2] Hongjun Lu, Yuet Yeung Ng and Zengping Tian. T-Tree or B-Tree: Main Memory Database Index Structure Reviewed. Australasian Database Conference，(2000),P. 65-73.

DOI: 10.1109/adc.2000.819815

[3] Yan Weimin, Wu Weimin. Data structure (C language version). Tsinghua University press, Beijing(1996).

[4] H. Garcia-Molina, J.D. Uilman, J. Widom. Database System Implementation. Mechanical industry publishing house(2001).

[5] Sang-Wook Kim and Sang-Hyun Park. Development of an Index Manager for a Main Memory DBMS Tachyon.

DOI: 10.1109/cmpsac.2002.1045075

[6] Hector Garcia Molina, Kenneth Salem. Main Memoy Database Systems: An Overview. IEEE Transactions on Knowledge and Data Engineering, Vol 4, No 6(1992).