Abstract
In this paper we introduce a new multidimensional index called the S-tree. Such indexes are appropriate for a large variety of pictorial databases such as cartography, satellite and medical images. The S-tree discussed in this paper is similar in flavor to the standard S-tree, but accepts mild imbalance in the resulting tree in return for significantly reduced area, overlap and perimeter in the resulting minimum bounding rectangles. In fact, the S-tree is defined in terms of a parameter which governs the degree to which this trade-off is allowed. We develop an efficient packing algorithm based on this parameter. We then analyze the S-tree analytically, giving theoretical bounds on the degree of imbalance of the tree. We also analyze the S-tree experimentally. While the S-tree is extremely effective for static databases, we outline the extension to dynamic databases as well.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aref, W., Samet, H.: Optimization Strategies for Spatial Query Processing. Proceedings of the VLDB Conference. (1991) 81–90.
Beckman, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Method for Points and Rectangles. Proceedings of the ACM SIGMOD Conference. (1990) 322–331.
Bentley, J.: Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM. 18(9) (1975) 509–517.
Faloutsos, C, Kamel, I.: Beyond Uniformity and Independence: Analysis of R-Trees using the Concept of Fractal Dimension. Proceedings of the ACM PODS Conference. (1994) 4–19.
Faloutsos, C, Roseman, S.: Fractals for Secondary Key Retrieval. Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). (1989) 247–252.
Gargantini, I.: An Effective Way to Represent Quad Trees. Communications of the ACM. 25(12) (1982) 905–910.
Gunther, O., Bilmes, J.: Tree Based Access Methods for Spatial Databases: Implementation and Performance Evaluation. IEEE Transactions on Knowledge and Data Engineering. 3(3) (1991) 342–356.
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the ACM SIGMOD Conference. (1984) 47–57.
Hinrichs, K., Nievergelt, J.: The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects. Proceedings of the WG'83. (1983) 100–113.
Jagadish, H.: Linear Clustering of Objects with Multiple Attributes. Proceedings of the ACM SIGMOD Conference. (1990) 332–342.
Kamel, I., Faloutsos, C: Hilbert R-Tree: An Improved R-tree using fractals. Proceedings of the 20th VLDB conference. (1994)
Kamel, I., Faloutsos, C: On Packing R-Trees. Proceedings of the 2nd International Conference on Information and Knowledge Management. 490–499.
Knuth, D.: The Art of Computer Programming, Vol. 3: Sorting and Searching. (1973).
Lomet, D., Salzberg, B.: The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. ACM TODS. (1990) 15(4) 625–658.
Orenstein, J.: Spatial Query Processing in an Object-oriented Database System. Proceedings of the ACM SIGMOD Conference. (1986) 326–336.
Robinson, J.: The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proceedings of the ACM SIGMOD Conference. (1981) 10–18.
Roussopoulos, N., Leifker, D.: Direct Spatial Search on Pictorial Databases using Packed R-Trees. Proceedings of the ACM SIGMOD Conference. (1985)
Samet, H.: The Design and Analysis of Spatial Data Structures. Addison Wesley. (1989)
Sellis, T., Roussopoulos, N., Faloutsos, C: The R+ tree: A Dynamic Index Structure for Multi-Dimensional Objects. Proceedings of the 13th International Conference on VLDB. (1987) 507–518.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aggarwal1, C., Wolf, J., Yu, P., Epelman, M. (1997). The S-tree: An efficient index for multidimensional objects. In: Scholl, M., Voisard, A. (eds) Advances in Spatial Databases. SSD 1997. Lecture Notes in Computer Science, vol 1262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63238-7_39
Download citation
DOI: https://doi.org/10.1007/3-540-63238-7_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63238-2
Online ISBN: 978-3-540-69240-9
eBook Packages: Springer Book Archive