Abstract
The management of spatial data in applications such as graphics and image processing, geography as well as computer aided design (CAD) imposes stringent new requirements on spatial database systems, in particular on efficient query processing of complex spatial objects. In this paper, we propose a two-level, multi-representation query processing technique which consists of a filter and a refinement level. The efficiency of spatial query processing is improved considerably using the following two design paradigms: first, divide and conquer, i.e. decomposition of complex spatial objects into more simple spatial components such as convex polygons, triangles or trapezoids, and second, application of efficient and robust spatial access methods for simple spatial objects. The most powerful ingredient in our approach is the concept of object decomposition. Applied to the refinement level of spatial query processing, it substitutes complex computational geometry algorithms by simple and fast algorithms for simple components. In this paper, we present four different decomposition techniques for polygonal shaped objects. The second part of the paper consists of an empirical performance comparison of those techniques using real and synthetic data sets. The four types of decomposition techniques are compared to each other and to the traditional approach with respect to the performance of spatial query processing. This comparison points out that our approach using object decomposition is superior to traditional query processing strategies.
Preview
Unable to display preview. Download preview PDF.
References
Asano, Ta. & Te. Asano, ‘Minimum Partition of Polygonal Regions into Trapezoids', in Proc. 24th IEEE Annual Symposium on Foundations of Computer Science, 233–241, 1983.
Beckmann, N., H.P. Kriegel, R. Schneider & B. Seeger, ‘The R*-tree: An efficient and robust access method for points and rectangles', in Proc. 1990 ACM SIGMOD International Conference on Management of Data, 322–331, Atlantic City, USA, May 1990.
Burrough, P.A., Principles of Geographical Information Systems for Land Resource Assessment', Clarendon Press, Oxford, 1987
Chazelle, B. & D.P. Dobkin, ‘Optimal Convex Decompositions', Computational Geometry, G.T. Toissant (Ed.), Amsterdam, The Netherlands: North Holland, 63–134, 1985
Delaunay, B., 'sur la sphere vide', Izvestiya Akademii Nauk SSSR, VII Seria, Otdeline Matematicheskii i Estestvennyka Nauk, 7, 6, 793–800, 1934.
Droste, U., H.-G. Harms, H. Horn, ‘Decomposition Based Representation and Query Processing of Polygonal Object in Database Systems', Master Thesis (in German), University of Bremen, 1990
Freeston, M., ‘The BANG file: a new kind of grid file', Proc. ACM SIGMOD Int. Conf. on Management of Data, 260–269, 1987
Günther, O., ‘The design of the cell tree: an object-oriented index structure for geometric databases', in Proc. IEEE 5th Int. Conf. on Data Engineering, 598–605, Los Angeles, 1989.
Guttman A., ‘R-trees: a dynamic index structure for spatial searching', in Proc. ACM SIGMOD Int. Conf. on Management of Data, 47–57, June 1984.
Kriegel, H.-P., Brinkhoff, T., Schneider, R.: An Efficient Map Overlay Algorithm based on Spatial Access Methods and Computational Geometry. Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16–17, 1991
Kriegel, H.-P., Heep, P., Heep, S., Schiwietz, M., Schneider, R.: An Access Method Based Query Processor for Spatial Database Systems. Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16–17, 1991
Kriegel, H.-P., Heep, P., Heep, S., Schiwietz, M., Schneider, R.: A Flexible and Extensible Index Manager for Spatial Database Systems. Proc. 2nd Int. Conf. on Database and Expert Systems Applications (DEXA '91), Berlin, August 21–23, 1991
Keil, J.M. & J.R. Sack, ‘Minimum decomposition of polygonal objects', Computational Geometry, G.T. Toissant (Ed.), Amsterdam, The Netherlands: North Holland, 197–216, 1985
Kriegel, H.P. & B. Seeger., ‘PLOP-Hashing: A Grid File without directory', Proc. 4th Int. Conf. on Data Engeneering, 369–376, 1988
Kriegel, H.P.& M. Schiwietz, ‘The P-tree: an efficient access method for complex spatial objects', University of Munich, Germany, 1991, in preparation.
Kriegel, H.P., M. Schiwietz, R. Schneider & B.Seeger, ‘Performance Comparison of Point and Spatial Access Methods', in Proc. “Symposium on the Design and Implementation of Large Spatial Databases”, 89–114, Santa Barbara, USA, July 1989.
Nievergelt J., H. Hinterberger & K.C. Sevcik: ‘The grid file: an adaptable, symmetric multikey file structure', ACM Trans. on Database Systems, Vol. 9, 1, 38–71, 1984.
Orenstein, J.A. & F.A. Manola, 'spatial Data Modeling and Query Processing in PROBE', Technical Report CCA-86-05, Xerox Advanced Information Technology Devision, 1986.
Oosterom, P.J.M., ‘Reactive Data Structures for Geographic Information Systems', PhD-thesis, Department of Computer Science at Leiden University, The Netherlands, 1990.
Orenstein, J.A., ‘Redundancy in Spatial Databases', in Proc. 1989 ACM SIGMOD International Conference on Management of Data, 294–305, Portland, USA, June 1989.
Preparata, F.P. & M.I. Shamos, ‘Computational Geometry: An Introduction', Springer-Verlag, New York, 1985
Samet, H., ‘The Quadtree and Related Hierarchical Data Structures', ACM Computing Surveys, Vol. 16, No. 2, 187–260, 1984
Seeger, B., ‘Design and Implementation of multidimensional access methods’ (in German), PhDthesis, University of Bremen, Germany, 1990.
Seeger, B. & H.P. Kriegel, Techniques for design and implementation of efficient spatial access methods', in Proc. 14th Int. Conf. on Very Large Databases, 360–371, Los Angeles, USA, 1988.
Seeger, B. & H.P. Kriegel, ‘The Buddy Tree: An Efficient and Robust Access Method for Spatial Databases', in Proc. 16th Int. Conf. on Very Large Data Bases, Brisbane, Australia, August 1990.
Scholl, M. & A. Voisard, ‘Thematic Map Modelling', in Proc. “Symposium on the Design and Implementation of Large Spatial Databases”, 167–190, Santa Barbara, USA, July 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriegel, H.P. (1991). Query processing in spatial database systems. In: Maurer, H. (eds) New Results and New Trends in Computer Science. Lecture Notes in Computer Science, vol 555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038189
Download citation
DOI: https://doi.org/10.1007/BFb0038189
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54869-0
Online ISBN: 978-3-540-46457-0
eBook Packages: Springer Book Archive