Spatial data base queries: Relational algebra versus computational geometry
- 120 Downloads
Conventional queries against relational databases can be expressed in relational algebra. But, when dealing with geometric and spatial queries, one also needs to use computational geometry algorithms.
Starting from examples taken in urban planning and in CADCAM, using different types of geometric modelling, we show what kinds of queries can be solved by relational algebra and computational geometry respectively. Among spatial queries, we essentially focus on:
-vacant places within a window.
Among spatial models, we present the conventional segment-oriented (wireframe) model requiring computational geometry algorithms for query evaluation, the Peano relation model allowing the using of algebra and a mixed model requiring both geometry and algebra. So, we show that the representation based on linear quadtrees together with Peano relations allows the solving of a spatial query subclass simply by using an extension of relational algebra called Peano Tuple Algebra.
We conclude this paper by pointing out the necessity to design spatial DBMS's in conjunction with the geometric representation and to extend query languages to deal with spatial queries.
Key wordsData Base Query Relational Algebra Computational Geometry Geometric Modelling CADCAM Urban Planning Peano Tuple Algebra
Unable to display preview. Download preview PDF.
- AYALA D, BRUNET P, JUAN R, NAVAZO I (1985) Object representation by means of non minimal division quadtrees and octrees. ACM Transaction on Graphics. Vol 4, 1 June 85 pp 41–59Google Scholar
- CHEN PP (1976) The Entity-Relationship Model: Toward a Unified View of Data. ACM Transactions on Database Systems 1, 1, pp 9–35.Google Scholar
- GARGANTINI I (1983) Translation, Rotation and Superposition of Linear Quadtrees. International Journal of Man-Machine Studies. Vol 18, 3, March 1983, pp 253–263.Google Scholar
- LAURINI R (1985) Graphics Data Bases Built on Peano Space-Filling Curves. EUROGRAPHICS'85, Nice, September 8–13/1985. pp 327–338. Edited by CE VANDONI, NHPC.Google Scholar
- LAURINI R (1987) Manipulation of Spatial Objects with a Peano Tuple Algebra. University of Maryland, Center for Automation Research Technical Report. CAR TR 311.Google Scholar
- LAURINI R, MILLERET F (1986a) Les Clefs de Peano: un nouveau modèle pour les bases de données multidimensionnelles et les bases d'images. 2èmes journées BASES DE DONNEES AVANCEES, Giens, France, April 22–25/1986 pp 211–230. Published by INRIA, Rocquencourt, France.Google Scholar
- LAURINI R, MILLERET F (1986b) Les clefs de Peano en Synthèse d'images: Modélisation et Opérateurs. Semaine Internationale de l'Image Electronique, Nice, April 21–25/1986 pp 659–675. Published by CESTA, Paris.Google Scholar
- LAURINI R, MILLERET F (1987) Peano Relations in CADCAM Databases. International Conference IEEE "Data and Knowledge Systems for Manufacturing and Engineering", Hartford, Connecticut October 19–20/1987.Google Scholar
- MORTON GM (1966) A Computer Oriented Geodetic Database and a New Technique in File Sequencing. IBM Canada-Ontario report, March 1966.Google Scholar
- ORENSTEIN J (1986) Spatial Query Processing in an Object-Oriented Database System. Proceedings of ACM/SIGMOD'86, Washington DC. pp 326–336. Edited by C. ZANIOLO.Google Scholar
- PREPARATA F, SHAMOS M (1986) Computational Geometry: an Introduction. Springer-VerlagGoogle Scholar
- SAMET H (1984) The Quadtree and Related Hierarchical Data Structures. Computing Surveys. Vol 16, June 1984, pp 187–260.Google Scholar