A CST+-Tree Index Structure for Efficient Range Search
- Authors
- Lee, Jae-won; Lee, Ig-hoon; Kahng, Minsuk; Shim, Junho; Lee, Sang-goo
- Issue Date
- Jul-2010
- Publisher
- INT INFORMATION INST
- Keywords
- Main memory; Index structure; cache; CST+-Tree; Range search
- Citation
- INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, v.13, no.4, pp 1295 - 1314
- Pages
- 20
- Journal Title
- INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL
- Volume
- 13
- Number
- 4
- Start Page
- 1295
- End Page
- 1314
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/13177
- ISSN
- 1343-4500
1344-8994
- Abstract
- As main memory access has become a performance bottleneck for main memory-based applications in modern computing environments, a central processing unit (CPU) cache has been introduced to reduce the average latency of memory access. In main memory database areas, although T-Tree is regarded as one of the prominent index structures for main memory, it does not take account of a CPU cache. In order to improve upon the performances of T-Tree by exploiting the cache, a cache sensitive T-Tree (CST-Tree) has been proposed. However, CST-Tree has limitations on range search, because unnecessary nodes are traversed. Therefore, we propose CST+-Tree which has the merits of CST-Tree, but CST+-Tree allows for efficient range search by linking data nodes with linked lists. In range search, we revealed that CST+-Tree was about 60% faster in the Sun system and 70% faster in the Intel system than CST-Tree. Moreover, in point search, CST+-Tree and CST-Tree exhibited a similar performance.
- Files in This Item
-
Go to Link
- Appears in
Collections - 공과대학 > 소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.