A Study of Index Structures for Main Memory Database Management Systems

Do you want to read the rest of this conference paper?

… Because of the system contains big memory, it becomes feasible to store and manage database within main memory. It is quite likely that databases, at least for some applications where real time access and high data performance are required, will eventually fit entirely in main memory [6,7]. that is causing a growing number of IMDB researchers became interested in it architecture, data organization, and access methods. …

… This paper focuses on the use of the index structure to access data which reside in main memory. In the end of 80’s, Lehman and Carey evolved the T-tree from AVL-Tree and B-Tree as an index structure for main memory database [6]. in that time, experiments indicate that T-Tree outperform B+-Tree in main memory [3] proposed T*-Tree, which is an improvement from T-tree for better use of query operations, including range queries and which contains all other good features of T-tree. …

… To get a more realistic delete cost, we first insert one million data items to the index structure and then we only delete 400,00 data items from the index structure…