Jayendra Venkateswaran
ABSTRACT
Modern database applications like geographic information systems, multimedia databases, and digital libraries dealing with huge volumes of high dimensional data, make use of multidimensional index structures. Among them, SR-tree has been shown to outperform the R-Tree and its variants and the SS-Tree. For static datasets, packed index structures provide better retrieval performance. This paper presents schemes for SR-Tree packing based on different pre-processing techniques. The results show that these schemes consistently outperform packed R-Tree and conventional SR-Tree structures in terms of storage space and query performance.
- T. Bially. Space-Filling Curves: Their Generation and Their Application to Bandwidth Reduction. IEEE Transactions on Information Theory, 15(6):658--664, 1969.Google Scholar
Digital Library
- A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD Conference, pages 47--57, 1984. Google ScholarDigital Library
- I. Kamel and C. Faloutsos. Hilbert R-tree: An Improved R-tree using Fractals. In VLDB, pages 500--509, 1994. Google ScholarDigital Library
- N. Katayama and S. Satoh. The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In SIGMOD Conference, pages 369--380, 1997. Google ScholarDigital Library
- S. T. Leutenegger, J. M. Edgington, and M. A. Lopez. STR: A simple and efficient algorithm for R-tree packing. Technical report, 1997. Google ScholarDigital Library
- R. S. Norbert Beckmann, Hans-Peter Kriegel and B. Seeger. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD Conference, pages 322--331, 1990. Google ScholarDigital Library
- H. Sagan. Space-Filling Curves. Springer Verlag, New York, NY, USA, 1994.Google Scholar
- H. Samet. The design and analysis of spatial data structures. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1990. Google ScholarDigital Library
- D. A. White and R. Jain. Similarity Indexing with the SS-tree. In ICDE, pages 516--523, 1996. Google ScholarDigital Library
Index Terms
- Schemes for SR-Tree packing
Recommendations
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of dataRecently, similarity queries on feature vectors have been widely used to perform content-based retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor ...
The SR-tree: an index structure for high-dimensional nearest neighbor queries
Recently, similarity queries on feature vectors have been widely used to perform content-based retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor ...
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
ADC '00: Proceedings of the Australasian Database ConferenceWhile the B-tree (or the B+-tree) is the most popular index structure in disk-based relational database systems, the T-tree has been widely accepted as a promising index structure for main memory databases where the entire database (or most of them) ...
Comments