Abstract
It is known that to a planar spatial database, represented by a semi-algebraic set in the plane, one can associate a structure, here called the “topological canonization”, such that two databases are topologically equivalent if and only if their topological canonizations are isomorphic. The advantage of a topological canonization is that it contains precisely the information one needs if one is only interested in topological properties of the spatial data. In this paper we represent semi-algebraic sets using plane graph structures. Canonizations are represented by plane graph structures as well (the so-called canonical structures). We discuss the basic properties of canonical structures and of canonization. We then present a method for incremental maintenance of the canonization under elementary updates on the original spatial database. Incremental maintenance takes less time than recomputing the canonization from scratch.
Post-doctoral research fellow of the Fund for Scientific Research of Flanders (FWO)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry—Algorithms and Applications. Springer, 1997.
J. Heintz, T. Recio, and M.-F. Roy. Algorithms in real algebraic geometry and applications to computational geometry. In J. Goodman, R. Pollack, and W. Steiger, editors, Discrete and Computational Geometry, volume 6. AMS-ACM, 1991.
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.
D.C. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, 1992.
B. Kuijpers, J. Paredaens, and J. Van den Bussche. Lossless representation of topological spatial data. In M.J. Egenhofer and J.R. Herring, editors, Advances in Spatial Databases, volume 951 of Lecture Notes in Computer Science, pages 1–13. Springer, 1995.
B. Kuijpers. Topological properties of spatial databases in the polynomial constraint model. PhD thesis, University of Antwerp (UIA), 1998.
D. Kozen and C.-K. Yap. Algebraic cell decomposition in NC (preliminary version). In Proceedings 26th Annual Symposium on Foundations of Computer Science, pages 515–521. IEEE, 1985.
F.P. Preparata and M.I. Shamos. Computational Geometry—An Introduction. Springer-Verlag, 1985.
C.H. Papadimitriou, D. Suciu, and V. Vianu. Topological queries in spatial databases. In Proceedings 15th ACM Symposium on Principles of Database Systems, pages 81–92. ACM Press, 1996.
J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13:255–352, 1992.
L. Segoufin and V. Vianu. Querying spatial databases via topological invariants. In Proceedings 17th ACM Symposium on Principles of Database Systems, pages 89–98. ACM Press, 1998.
D. Thompson and R. Laurini. Fundamentals of Spatial Information Systems. Number 37 in APIC Series. Academic Press, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Geerts, F., Kuijpers, B., Van den Bussche, J. (1999). Topological Canonization of Planar Spatial Data and its Incremental Maintenance. In: Polle, T., Ripke, T., Schewe, KD. (eds) Fundamentals of Information Systems. The Springer International Series in Engineering and Computer Science, vol 496. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5137-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5137-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7338-4
Online ISBN: 978-1-4615-5137-9
eBook Packages: Springer Book Archive