A low overhead index structure for dynamic main memory database management systems
- Authors
- Jeon, HS; Kim, TJ; Noh, SH; Lee, J; Lim, HC
- Issue Date
- Sep-2001
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- T-2-tree; main memory database systems; index structure
- Citation
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E84D, no.9, pp.1164 - 1170
- Journal Title
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- Volume
- E84D
- Number
- 9
- Start Page
- 1164
- End Page
- 1170
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/27188
- ISSN
- 0916-8532
- Abstract
- In this paper, an effective index structure for dynamic main memory database systems, which we call the T-2- tree, is presented. A notion of a thread pointer is introduced to overcome some of the limitations of the T-tree and the T*-tree. There are several advantages to this structure. First, the T-2-tree reduces the number of rotate operations and the overhead required for balancing the tree by restraining new node creation and deletion. Second, the T-2-tree shows good performance for sequential search of range queries as these requests can be effectively handled using the successor pointer. Finally, the T-2-tree allows for higher space utilization amplicating the aforementioned benefits. These advantages are obtained with minimal changes to the existing T-tree structure. Experimental studies showing evidence of the benefits of the T-2-tree are also presented.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering Major > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.