Abstract
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.
This work was supported by the National Geographic Information Systems Technology Development of the Ministry of Science and Technology of Korea.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
O. Guenther, A. Buchmann, “Research Issues in Spatial Databases,” ACM SIG-SIGMOD RECORD, Vol. 19, No. 4, 1990, pp. 61–68.
B. C. Ooi, Efficient Query Processing in Geographic Information Systems, Lecture Notes in Computer Science 471, Springer-Verlag, 1990.
R. H. Güting, “An Introduction to Spatial Database Systems,” VLDB Journal, Vol. 3, No. 4, 1994, pp. 357–399.
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.
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.
J. A. Orenstein, “Redundancy in Spatial Databases,” Proc. of ACM SIGMOD, 1989, pp. 294–305.
J. A. Orestein, “Spatial Query Processing in An Object-oriented Database System, ” Proc. of ACM SIGMOD, 1986, pp. 326–336.
C. Faloutsos, W. Rego, “Tri-Cell: A Data Structure for Spatial Objects,” Information Systems, Vol. 14, No. 2, 1989, pp. 131–139.
F. Preparata, M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD, 1984, pp. 47–57.
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.
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.
H. Samet, The design and Analysis of Spatial Data Structures, Addison-Wesley Pub., 1990.
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.
O. Gunther, “The Design of the Cell tree: An Object-oriented Index Structure for Geometric Databases,” Proc. Data Engineering Conference, 1989, pp. 598–605.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, YJ., Lee, DM., Ryu, SJ., Chung, CW. (1996). Controlled decomposition strategy for complex spatial objects. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034682
Download citation
DOI: https://doi.org/10.1007/BFb0034682
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61656-6
Online ISBN: 978-3-540-70651-9
eBook Packages: Springer Book Archive