Controlled decomposition strategy for complex spatial objects

  • Yong-Ju Lee
  • Dong-Man Lee
  • Soo-Jung Ryu
  • Chin-Wan Chung
Advanced Database and Information Systems Methods 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)


The efficient query processing for complex spatial objects is one of most challenging requirements in many non-traditional applications such as geographic information systems, computer-aided design and multimedia databases. The performance of spatial query processing can be improved by decomposing a complex object into a small number of simple components. This paper investigates a natural trade-off between the number and the complexity of decomposed components. In particular, we propose a new object decomposition method which can control the number of components using a parameter. The proposed method is able to finetune the trade-off by controlling the parameter. An optimal value of the parameter is explored through experimental measurements. The decomposition method with this optimal value outperforms traditional decomposition methods. The gain by applying the optimal value is more clear as the complexity of spatial objects increases.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    O. Guenther, A. Buchmann, “Research Issues in Spatial Databases,” ACM SIG-SIGMOD RECORD, Vol. 19, No. 4, 1990, pp. 61–68.CrossRefGoogle Scholar
  2. [2]
    B. C. Ooi, Efficient Query Processing in Geographic Information Systems, Lecture Notes in Computer Science 471, Springer-Verlag, 1990.Google Scholar
  3. [3]
    R. H. Güting, “An Introduction to Spatial Database Systems,” VLDB Journal, Vol. 3, No. 4, 1994, pp. 357–399.CrossRefGoogle Scholar
  4. [4]
    T. Brinkhoff, H. P. Kriegel, and R. Schneider, “Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems,” in Proc. 9th Int. Conf. on Data Engineering, Vienna, Austria, 1993, pp. 40–49.Google Scholar
  5. [5]
    H. P. Kriegel, H. Horn, and M. Schiwietz, “The Performance of Object Decomposition Techniques for Spatial Query Processing,” Proc. of 2nd Symp. on Large Spatial Databases, Lecture Notes in Computer Science 525, Springer-Verlag, 1991, pp. 257–276.Google Scholar
  6. [6]
    J. A. Orenstein, “Redundancy in Spatial Databases,” Proc. of ACM SIGMOD, 1989, pp. 294–305.Google Scholar
  7. [7]
    J. A. Orestein, “Spatial Query Processing in An Object-oriented Database System, ” Proc. of ACM SIGMOD, 1986, pp. 326–336.Google Scholar
  8. [8]
    C. Faloutsos, W. Rego, “Tri-Cell: A Data Structure for Spatial Objects,” Information Systems, Vol. 14, No. 2, 1989, pp. 131–139.CrossRefGoogle Scholar
  9. [9]
    F. Preparata, M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.Google Scholar
  10. [10]
    A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD, 1984, pp. 47–57.Google Scholar
  11. [11]
    T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-tree: A Dynamic Index for Multi-dimensional Objects,” Proc. 13th Very Large Data Bases, Conf. Sep. 1987, pp. 507–518.Google Scholar
  12. [12]
    N. Beckmann, H. P, Kriegel, R. Schneider, and B. Seeger, “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,” in Proc. ACM SIGMOD International Conference on Management of Data, Atlantic City, USA, 1990, pp. 322–331.Google Scholar
  13. [13]
    H. Samet, The design and Analysis of Spatial Data Structures, Addison-Wesley Pub., 1990.Google Scholar
  14. [14]
    H. Samet, “Hierarchical Saptial Data Structures,” Proc. of 1st Symp. on Large Spatial Databases, Lecture Notes in Computer Science 409, Springer-Verlag, 1989, pp. 193–212.Google Scholar
  15. [15]
    O. Gunther, “The Design of the Cell tree: An Object-oriented Index Structure for Geometric Databases,” Proc. Data Engineering Conference, 1989, pp. 598–605.Google Scholar
  16. [16]
    R. Schneider, H.P. Kriegel, “The TR*-tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations,” Proc. 7th Workshop on Computational Geometry, Bern, Switzerland, Lecture Notes in Computer Science 553, Springer-Verlag, 1991, pp. 249–264.Google Scholar
  17. [17]
    A. Henrich, H. W. Six, and P. Widmayer, “The LSD Tree: Spatial Access to Multidimensional Point and Non-point Objects,” Proc. 15th Very Large Date Bases Conf., Amsterdam, Aug. 1989, pp. 45–53.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yong-Ju Lee
    • 1
  • Dong-Man Lee
    • 2
  • Soo-Jung Ryu
    • 2
  • Chin-Wan Chung
    • 2
  1. 1.Information & Computer CenterKorea Environmental Technology Research InstituteSeoulSouth Korea
  2. 2.Department of Information and Communication EngineeringKorea Advanced Institute of Science and TechnologySeoulSouth Korea

Personalised recommendations