Abstract
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases.
We investigate a hierarchy of monotonicity classes of spatial transformations that is determined by the number of degrees of freedom of the transformations. The result of a monotonic transformation with kdegrees of freedom on a spatial database is completely determined by its result on subsets of casdinality at most k of the spatial database. The result of a transformation in the largest class of the hierarchy on a spatial database is determined by its result on arbitrary large subsets of the database. The latter is the class of all the monotonic spatial transformations. We give a sound and complete language for the monotonic spatial transformations that can be expressed in the relational calculus augmented with polynomial inequalities and that belong to a class with a finite number of degrees of freedom. In particular, we show that these transformations are finite unions of transformations that can be written in a particular conjunctive form. We also address the problem of finding sound and complete languages for monotonic transformations that are expressible in the calculus and have an infinite number of degrees of freedom. We show that Lyndon's theorem, which is known to fail in finite model theory, also fails in this setting: monotonic spatial transformations expressible in the calculus do not correspond to the transformations expressible by a positive formula.
We show that it is undecidable whether a query expressed in the relay tional calculus augmented with polynomial inequalities is a monotonic spatial transformation of a certain degree. On the other hand, various interesting properties (e.g., equivalence, genericity), which are undecidable for general spatial transformations expressible in the calculus, become decidable for monotonic spatial transformations of finite degree.
Preview
Unable to display preview. Download preview PDF.
References
D. Abel and B.C. Ooi, editors. Advances in spatial databases-3rd Symposium SSD'93, volume 692 of Lecture Notes in Computer Science, Springer-Verlag, 1993.
M. Ajtai and Y. Gurevich. Monotone versus Positive. Journal of the Association for Computing Machinery, Vol. 34, pages 1004–1015, October 1987.
J. Barwise, editor. Handbook of Mathematical Logic. North-Holland Publishing Company, Amsterdam, 1989.
M. Benedikt, G. Doug, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. In Proceedings 15th ACM Symposium on Principles of Database Systems (PODS'96), pages 1–16, ACM Press, 1996.
M. Benedikt and L. Libkin. Languages for Relational Databases over Interpreted Structures. In Proceedings 16th ACM Symposium on Principles of Database Systems (PODS'97), pages 87–98, ACM Press, 1997.
J. Bochnak, M. Coste, and M.-P. Roy. Géométrie algébrique réelle. Springer-Verlag, 1987.
A. Buchmann, editor. Design and implementation of large spatial databases-First Symposium SSD'89, volume 409 of Lecture Notes in Computer Science. Springer-Verlag, 1989.
G.E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata theory and formal languages, volume 33 of Lecture Notes in Computer Science, pages 134–183, Springer-Verlag, 1975.
M. Coste. Ensembles semi-algébriques. In G'eométrie algébrique réelle et formes quadratiques, volume 959 of Lecture Notes in Mathematics, pages 109–138, Springer-Verlag, 1982.
M.J. Egenhofer and J.R. Herring, editors. Advances in Spatial Databases, volume 951 of Lecture Notes in Computer Science, Springer-Verlag, 1995.
O. Gunther and H.-J. Schek, editors. Advances in spatial databases-2nd Symposium SSD'91, volume 525 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
Y. Gurevich. Toward logic tailored for computational complexity. In Computation and Proof Theory, M. Richter et al., editors, volume 1104 of Lecture Notes in Mathematics, pages 175–216, Springer, 1984.
M. Gyssens, J. Van den Bussche, and D. Van Gucht. Complete geometrical query languages. In Proceedings of the 16th ACM Symposium on Principles of Database Systems (PODS'97), pages 62–67, ACM Press, 1997.
W. Hodges. Model Theory. Cambridge University press, Cambridge, 1995.
P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51(1):26–52, August 1995.
B. Kuijpers, J. Paredaens, M. Smits, and J. Van den Bussche. Termination properties of spatial Datalog programs. In Proceedings of “Logic in Databases” (LID'96), D. Pedreschi and C. Zaniolo, editors, volume 1154 of Lecture Notes in Computer Science, pages 101–116, Springer-Verlag, 1996.
B. Kuijpers and M. Smits.On expressing topological connectivity in spatial Datalog. In Proceedings of the workshop Constraint Databases and Their Applications (CDB'97), V. Gaede, A. Brodsky, O. Gunter, D. Srivastava, V. Vianu, M. Wallace, editors, volume 1191 of Lecture Notes in Computer Science, pages 116–133, Springer-Verlag, 1997.
G. McColm. The dimension of the Negation of Transitive Closure. The Journal of Symbolic Logic, Vol. 60, Nr. 2, pages 392–414, June 1995.
L. Libkin. Personal communication. August 1997.
J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proceedings of the 13th ACM Symposium on Principles of Database Systems (PODS'94), pages 279–28, ACM Press, 1994.
A. P. Stolboushkin. Finitely Monotone Properties. In Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science (LICS'95), pages 324-330, IEEE Computer Society Press, 1995.
A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuijpers, B. (1998). Degrees of monotonicity of spatial transformations. In: Cluet, S., Hull, R. (eds) Database Programming Languages. DBPL 1997. Lecture Notes in Computer Science, vol 1369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64823-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-64823-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64823-9
Online ISBN: 978-3-540-68534-0
eBook Packages: Springer Book Archive