The S-tree: An efficient index for multidimensional objects

  • Charu Aggarwal1
  • Joel Wolf
  • Philip Yu
  • Marina Epelman
Spatial Access Methods
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1262)


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.


Leaf Node Data Object Binary Tree Average Path Length Sweep Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aref, W., Samet, H.: Optimization Strategies for Spatial Query Processing. Proceedings of the VLDB Conference. (1991) 81–90.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Bentley, J.: Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM. 18(9) (1975) 509–517.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Faloutsos, C, Roseman, S.: Fractals for Secondary Key Retrieval. Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). (1989) 247–252.Google Scholar
  6. 6.
    Gargantini, I.: An Effective Way to Represent Quad Trees. Communications of the ACM. 25(12) (1982) 905–910.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the ACM SIGMOD Conference. (1984) 47–57.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    Jagadish, H.: Linear Clustering of Objects with Multiple Attributes. Proceedings of the ACM SIGMOD Conference. (1990) 332–342.Google Scholar
  11. 11.
    Kamel, I., Faloutsos, C: Hilbert R-Tree: An Improved R-tree using fractals. Proceedings of the 20th VLDB conference. (1994)Google Scholar
  12. 12.
    Kamel, I., Faloutsos, C: On Packing R-Trees. Proceedings of the 2nd International Conference on Information and Knowledge Management. 490–499.Google Scholar
  13. 13.
    Knuth, D.: The Art of Computer Programming, Vol. 3: Sorting and Searching. (1973).Google Scholar
  14. 14.
    Lomet, D., Salzberg, B.: The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. ACM TODS. (1990) 15(4) 625–658.Google Scholar
  15. 15.
    Orenstein, J.: Spatial Query Processing in an Object-oriented Database System. Proceedings of the ACM SIGMOD Conference. (1986) 326–336.Google Scholar
  16. 16.
    Robinson, J.: The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proceedings of the ACM SIGMOD Conference. (1981) 10–18.Google Scholar
  17. 17.
    Roussopoulos, N., Leifker, D.: Direct Spatial Search on Pictorial Databases using Packed R-Trees. Proceedings of the ACM SIGMOD Conference. (1985)Google Scholar
  18. 18.
    Samet, H.: The Design and Analysis of Spatial Data Structures. Addison Wesley. (1989)Google Scholar
  19. 19.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Charu Aggarwal1
    • 1
  • Joel Wolf
    • 1
  • Philip Yu
    • 1
  • Marina Epelman
    • 2
  1. 1.IBM T.J. Watson Research CenterYorktown Heights
  2. 2.Massachusetts Institute of TechnologyCambridge

Personalised recommendations