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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Feng, Y., & Makinouchi, A. (2006). Efficient evaluation of partially-dimensional range queries using adaptive R*-tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4080 LNCS, pp. 687–696). Springer Verlag. https://doi.org/10.1007/11827405_67
Mendeley helps you to discover research relevant for your work.