Abstract
Constraint databases have recently been proposed as a powerful framework to model and retrieve spatial data. In a constraint database, a spatial object is represented as a quantifier free conjunction of (usually linear) constraints, called generalized tuple. The set of solutions of such quantifier free formula represents the set of points belonging to the extension of the object. The relational algebra can be easily extended to deal with generalized relations. However, such algebra has some limitations when it is used for modeling spatial data. First of all, there is no explicit way to deal with the set of points representing a spatial object as a whole. Rather, only point-based computations can be performed using this algebra. Second, practical constraint database languages typically use linear constraints. This allows to use efficient algorithms but, at the same time, some interesting queries cannot be represented (for example, the distance between two objects cannot be computed). Finally, no update language for spatial constraint databases has been defined yet. The aim of this paper is to overcome some of the previous limitations. In particular, we extend the model and the algebra to directly deal with the set of points represented by a generalized tuple (a spatial object), retaining at the same time the ability of expressing all computations that can be expressed by other constraint database languages. Moreover, we discuss the introduction of external functions in the proposed algebra, in order to cover all the functionalities that cannot be expressed in the chosen logical theory. Finally, we propose an update language for spatial constraint databases, based on the same principles of the algebra.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and P. Kanellakis. Query Languages for Complex Object Databases. SIGACT News, 21(3):9–18, 1990.
W.G. Aref and H. Samet. Extending a Database with Spatial Operations. In LNCS 525: Proc. of the Second Symposium on Advances in Spatial Databases, pages 299–319, 1991.
A. Belussi, E. Bertino, M. Bertolotto, and B. Catania. Generalized Relational Algebra: Modeling Spatial Queries in Constraint Databases. In LNCS 1034: Proc. of the First Int. CONTESSA Database Workshop, Constraint Databases and their Applications, pages 40–67, 1995.
A. Belussi, E. Bertino, and B. Catania. An Extended Algebra for Constraint Databases. Technical report n. 179–96, University of Milano, 1996. Submitted for publication.
E. Bertino, B. Catania, and B. Shidlovsky. Towards Optimal Indexing for Segment Databases. Technical Report n. 196-97, University pf Milano, Italy. Submitted for publication.
E. Bertino, B. Catania, and L. Wong. Finitely Representable Nested Relations. Submitted for publication.
A. Brodsky and Y. Kornatzky. The L yriC Language: Querying Constraint Objects. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1995.
A.K. Chandra and D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, 21:156–178, 1980.
J. Chomicki, D. Goldin, and G. Kuper. Variable Independence and Aggregation Closure. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 40–48, 1996.
E. Clementini, P. Di Felice, and P. van Oosterom. A Small Set of Formal Topological Relationships Suitable for End-User Interaction. In LNCS 692: Proc. of the Third Int. Symp. on Advances in Spatial Databases, pages 277–295, 1993.
L. De Floriani, P. Marzano, and E. Puppo. Spatial Queries and Data Models. In LNCS 716: Spatial Information Theory: a Theoretical Basis for GIS, pages 123–138, 1993.
M.J. Egenhofer. Reasoning about Binary Topological Relations. In LNCS 525: Proc. of the Second Int. Symp. on Advances in Spatial Databases, pages 143–160, 1991.
S. Grumbach and J. Su. Dense-Order Constraint Databases. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 66–77, 1995.
R.H. Güting and M. Schneider. Realm-Based Spatial Data Types: The ROSE Algebra. VLDB Journal, 4: 243–286, 1995.
P.C. Kanellakis and D.Q. Goldin. Constraint Programming and Database Query Languages. In LNCS 789: Proc. of the Int. Symp. on Theoretical Aspects of Computer Software, pages 96–120, 1994. See also Technical Report CS-94-31, Brown University, Providence, USA, 1994.
Paris Kanellakis, Gabriel Kuper, and Peter Revesz. Constraint query languages. Journal of Computer and System Sciences, 51:25–52, 1995.
H. Katsumo and A.O. Mendelzon. On the Difference Between Updating a Knowledge Base and Revising it. Belief Revision, Cambridge Tracts in Theoretical Computer Science, 1992. Cambridge University Press.
G.M. Kuper. Aggregation in Constraint Databases. In Proc. of the First Int. Workshop on Principles and Practice of Constraint Programming, 1993.
J.L. Lassez. Querying Constraints. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 288–298, 1990.
E.E. Moise. Geometric Topology in Dimension Two and Three. Springer Verlag, 1977.
J. Paredaens. Spatial Databases, The Final Frontier. In LNCS 893: Proc. of the Fifth Int. Conf. on Database Theory, 1995.
J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a Theory of Spatial Database Queries. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 279–288, 1994.
J. Paredaens and D. Van Gucht. Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 29–38, 1988.
F. P. Preparata and M.I. Shamos. Computational Geometry — an Introduction, Springer Verlag, New York, 1985.
P.Z. Revesz. Model-Theoretic Minimal Change Operators for Constraint Databases. In LNCS 1186: Proc. of the Sixth Int. Conf. on Database Theory, 1997.
N. Roussopoulos, C. Faloutsos, and T. Sellis. An Efficient Pictorial Database System for PSQL. IEEE Transaction on Software Engineering, 14(5):639–650, 1988.
M. Scholl and A. Voisard. Thematic Map Modeling. In Proc. of the Symp. on the Design and Implementation of Large Spatial Databases, pages 167–190, 1989.
P. Svensson. GEO-SAL: a Query Language for Spatial Data Analysis. In LNCS 525: Proc. of the Second Int. Symp. on Advances in Spatial Databases, pages 119–140, 1991.
L. Vandeurzen, M. Gyssens, and D. Van Gucht On the Desirability and Limitations of Linear Spatial Database Models. In LNCS 951: Proc. of the Fourth Int. Symp. on Advances in Spatial Databases, pages 14–28, 1995.
A. Wallance. An Introduction to Algebraic Topology. Pergamon Press, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belussi, A., Bertino, E., Catania, B. (1997). Manipulating spatial data in constraint databases. In: Scholl, M., Voisard, A. (eds) Advances in Spatial Databases. SSD 1997. Lecture Notes in Computer Science, vol 1262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63238-7_27
Download citation
DOI: https://doi.org/10.1007/3-540-63238-7_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63238-2
Online ISBN: 978-3-540-69240-9
eBook Packages: Springer Book Archive