Index clustering for high-performance sequential index access
- Authors
- Cha, GH
- Issue Date
- Mar-2004
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, v.2973, pp 39 - 51
- Pages
- 13
- Journal Title
- DATABASE SYSTEMS FOR ADVANCED APPLICATIONS
- Volume
- 2973
- Start Page
- 39
- End Page
- 51
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/16126
- ISSN
- 0302-9743
- Abstract
- This paper presents an index clustering technique called the segment-page clustering (SP-clustering). Most relevant index pages are widely scattered on a disk due to dynamic page allocation, and thus many random disk accesses are required during the query processing. The SP-clustering avoids the scattering by storing the relevant nodes contiguously in a segment that contains a sequence of contiguous disk pages and improves the query performance by offering sequential disk access within a segment. A new cost model is also introduced to estimate the performance of the SP-clustering. It takes account of the physical adjacency of pages read as well as the number of pages accessed. Experimental results demonstrate that the SP-clustering improves the query performance up to several times compared with the traditional ones with respect to the total elapsed time.
- Files in This Item
-
Go to Link
- Appears in
Collections - ICT융합공학부 > IT공학전공 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/16126)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.