T-tree Index Optimization Based on Main Memory Database
Abstract
Main memory database is a database management system in which the total or most of data are stored in the main memory. In order to implement this method, new data structure and algorithm need to be designed and the goal is the efficient application of CPU time and main memory space. In this paper, main memory database and index are introduced, T-tree index algorithm which is the most representative is research and analysis, and the T-tree optimization ideas are put forward.
Keywords
Main memory database; Indexing mechanism; T- tree; T-tree optimization idea
DOI
10.12783/dtcse/itms2016/9459
10.12783/dtcse/itms2016/9459
Refbacks
- There are currently no refbacks.