Abstract
This paper presents an index clustering technique called the segmented page indexing (SP-indexing) for multidimensional index structures. The design objectives of the SP-indexing are twofold: (1) to improve the range query performance of the multidimensional indexing methods and (2) to provide a compromise between optimal index clustering and excessive full index reorganization overhead. The SP-indexing uses two kinds of I/O units: pages for random disk accesses and segments for sequential accesses. The SP-indexing improves the range query performance by offering high-performance sequential disk access within a segment. Experimental results demonstrate that the SP-indexing improves the range query performance up to several times compared with the traditional page-based indexing methods with respect to the total elapsed time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-tree: An efficient and robust access method for points and rectangles,” Proc. of ACM SIGMOD International Conference on Management of Data, pp. 322–331, 1990.
S. Berchtold, D.A. Keim, H.-P. Kriegel, “The X-tree: An Index Structure for High-Dimensional Data,” Proc. of the 22nd International Conference on Very Large Data Bases, pp. 28–39, 1996.
J.v.d. Bercken, B. Seeger, and P. Widmayer, “A Generic Approach to Bulk Loading Multidimensional Index Structures,” Proc. of the International Conference on Very Large Data Bases, pp. 406–415, 1997.
P. Ciaccia, M. Patella, and P. Zezula, “M-tree: An Efficient Access Method for Similarity Search in Metric Space,” Proc. of the International Conference on Very Large Data Bases, pp. 426–435, 1997.
M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, “Query by image and video content: the QBIC system,” IEEE Computer, Vol. 28, pp. 23–32, Sep. 1995.
Gray and G. Graefe, “The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb,” ACM SIGMOD Record, Vol 26, No. 4, pp. 63–68, Dec. 1997.
Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 47–57, 1984.
Henrich, “The LSDh-tree: An Access Structure for Feature Vectors”, Proc. of the 14th International Conference on Data Engineering, pp. 362–369, 1998.
D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Addison Wesley, Reading, MA, 1973.
J.-H. Lee, D.-H. Kim, and C.-W. Chung, “Multidimensional Selectivity Estimation Using Compressed Histogram Information,” Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 205–214, 1999.
K.-I. Lin, H.V. Jagadish, and C. Faloutsos, “The TV-tree: An Index Structure for High-Dimensional Data,” VLDB Journal, Vol. 3, No. 4, pp. 517–542, 1994.
W. Litwin and D.B. Lomet, “The Bounded Disorder Access Method,” Proc. of the IEEE International Conference on Data Engineering, pp. 38–48, 1986.
D.B. Lomet, “A Simple Bounded Disorder File Organization with Good Performance,” ACM Transactions on Database Systems, Vol. 13, No. 4, pp. 525–551, Dec. 1988.
J. Nievergelt, H. Hinterberger, and K.C. Sevcik, “The grid file: an adaptable, symmetric multikey file structure,” ACM Transactions on Database Systems, Vol. 9, No.1, pp. 38–71, 1984.
P.E. O’Neil, “The SB-tree: An Index-Sequential Structure for High-Performance Sequential Access,” Acta Informatica, Vol. 29, pp. 241–265, 1992.
Seeger and H.-P. Kriegel, “The Buddy-tree: An Efficient and Robust Access Method for Spatial Data Base Systems,” Proc. of the 16th International Conference on Very Large Data Bases, pp. 590–601, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cha, GH., Yoon, YI. (2002). Clustered Indexing Technique for Multidimensional Index Structures. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2002. Lecture Notes in Computer Science, vol 2453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46146-9_92
Download citation
DOI: https://doi.org/10.1007/3-540-46146-9_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44126-7
Online ISBN: 978-3-540-46146-3
eBook Packages: Springer Book Archive