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
Multidimensional access methods
ACM Computing Surveys (CSUR)
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th 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
Optimal Multidimensional Query Processing Using Tree Striping
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Improving OLAP Performance by Multidimensional Hierarchical Clustering
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Efficient query processing for multi-dimensionally clustered tables in DB2
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Clotho: decoupling memory page layout from storage organization
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Ag-Tree: a novel structure for range queries in data warehouse environments
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
How to design Kansei retrieval systems?
WAIM'10 Proceedings of the 11th international conference on Web-age information management
| Hi-index | 0.00 |
This paper is about how to efficiently evaluate partially-dimensional range queries, which are often used in many actual applications. If the existing multidimensional indices are employed to evaluate partially-dimensional range queries, then a great deal of information that is irrelevant to the queries also has to be read from disk. A modification of R*-tree is described in this paper to ameliorate such a situation. Discussions and experiments indicate that the proposed modification can clearly improve the performance of partially-dimensional range queries, especially for large datasets.