HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Adaptive index structures
Authors: Tao, Yufei
Papadias, Dimitris
Keywords: Random accesses
Adaptive indexes
Issue Date: 2002
Citation: Very large data bases : proceedings, Hong Kong, 20-24 Aug. 2002, IEEE, New York, USA, 2002, p. 418-429
Abstract: Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of random accesses. In this paper, we propose a general framework for adaptive indexes that improve overall query cost. The performance gain is achieved by allowing index nodes to contain a variable number of disk pages. Update algorithms dynamically re-structure adaptive indexes depending on the data and query characteristics. Extensive experiments show that adaptive B- and R-trees significantly outperform their conventional counterparts, while incurring minimal update overhead.
Rights: © 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
vldb02ais.pdfpre-published version238KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.