A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Multi-dimensional selectivity estimation using compressed histogram information
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
The Bounded Disorder Access Method
Proceedings of the Second International Conference on Data Engineering
The LSDh-Tree: An Access Structure for Feature Vectors
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
| Hi-index | 0.01 |
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.