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

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Zhu Zhilin & Patrick Wang

Pages:

206-211

DOI:

10.4028/www.scientific.net/AMM.40-41.206

Citation:

Z. L. Zhu "Optimization of T-Tree Index of Main Memory Database in Critical Application", Applied Mechanics and Materials, Vols. 40-41, pp. 206-211, 2011

Online since:

November 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.