Browse > Article

A Sequential Indexing Method for Multidimensional Range Queries  

Cha Guang-Ho (숙명여자대학교 멀티미디어과학과)
Publication Information
Journal of KIISE:Databases / v.32, no.3, 2005 , pp. 254-262 More about this Journal
Abstract
This paper presents a new sequential indexing method called segment-page indexing (SP-indexing) for multidimensional range queries. The design objectives of SP-indexing are twofold:(1) improving the range query performance of multidimensional indexing methods (MIMs) and (2) providing a compromise between optimal index clustering and the full index reorganization overhead. Although more than ten years of database research has resulted in a great variety of MIMs, most efforts have focused on data-level clustering and there has been less attempt to cluster indexes. As a result, most relevant index nodes are widely scattered on a disk and many random disk accesses are required during the search. SP-indexing avoids such scattering by storing the relevant nodes contiguously in a segment that contains a sequence of contiguous disk pages and improves performance by offering sequential access within a segment. Experimental results demonstrate that SP-indexing improves query performance up to several times compared with traditional MIMs using small disk pages with respect to total elapsed time and it reduces waste of disk bandwidth due to the use of simple large pages.
Keywords
multidimensional index; sequential disk access; index clustering; SP-indexing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Knuth, D., The Art of Computer Programming: Sorting and Searching, Vol. 3, 1973, Addison Wesley, MA, USA
2 Lee, J.-H., Kim, D.-H., and Chung, C.-W., 'Multidimensional Selectivity Estimation Using Compressed Histogram Information,' Proc. of ACM SIGMOD, pp. 205-214, 1999   DOI
3 M. Flickner et al., 'Query by image and video content: The QBIC system,' IEEE computer, vol. 28, no. 9, pp. 23-32, 1995   DOI   ScienceOn
4 Brinkhoff, T. and Kriegel, H.-P., 'The Impact of Global Clustering on Spatial Database Systems,' Proc. of VLDB Conf., pp. 168-179, 1994, Morgan Kaufmann Pub., Orlando, USA
5 김기홍, 차상균, '효율적 공간 질의 처리를 위한 트리구조 공간 색인의 형제 노드 클러스터링', 정보과학회 논문지(B), 제26권 제4호, pp. 487-499, 1999. 4
6 Berchtold, S., Keim, D.A., and Kriegel, H.-P., 'The X -tree: An Index Structure for High-Dimensional Data,' Proc. of VLDB Conf., pp. 28-39, 1996
7 Tao, Y. and Papadias, D. 'Adaptive Index Structures,' Proc. of VLDB Conf., pp. 418-429, 2002
8 Bohm, C. and Kriegel, H.-P., 'Dynamically Optimizing High-Dimensional Index Structures,' Proc. of EDBT Conf., pp. 36-50, 2000   DOI
9 Henrich, A., 'The $LSD^h$-tree: An Access Structure for Feature Vectors,' Proc. of ICDE, pp. 362-369, 1998
10 Gray, J. and Graefe, G., 'The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb,' ACM SIGMOD Record, Vol. 26, No. 4, pp. 63-68, 1997   DOI   ScienceOn
11 O'Neil, P.E., 'The SB-tree: An Index-Sequential Structure for High-Performance Sequential Access,' Acta Informatica, Vol. 29, p. 241-265, 1992   DOI
12 Henrich, A., Six, H.-W., and Widmayer, P. 'The LSD-tree: spatial access to multidimensional point and non-point objects,' Proc. of ICDE, pp. 44-53, 1989
13 Litwin, W. and Lomet, D.B., 'The Bounded Disorder Access Method,' Proc. of ICDE, pp. 38-48, 1986
14 Lomet, D.B., 'A Simple Bounded Disorder File Organization with Good Performance,' ACM TODS, Vol. 13, No. 4, 525-551, 1988   DOI   ScienceOn
15 Keehn, D.G. and Lacy, J.O., 'VSAM data set design parameters,' IBM Systems Journal, Vol. 3, pp. 186-212, 1974   DOI   ScienceOn