Abstract
This chapter introduces DEDALE, one of the first implementations of a database system based on the linear constraint model. DEDALE is a long term project started in 1996 as a cooperation between the VERSO group at INRIA and the VERTIGO group at CNAM. DEDALE is intended to demonstrate the practical relevance of this model to handle geometric applications in various areas such as GIS or spatio-temporal databases. The system represents and manipulates multi-dimensional point-sets as linear constraint relations which are nested into classical relational tuples. Although the (global) dimension is arbitrary, the orthographic dimension (orthodim) (see Section 14.3.2) is at most two. This restriction allows for a trade-off between efficiency of evaluation and representation power.
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.
Similar content being viewed by others
Bibliographic Notes
S. Grumbach, P. Rigaux, M. Scholl, and L. Segoufin. DEDALE, A spatial constraint database. In Proceedings of the 6th International Workshop on Database Programming Languages (DBPL’97), volume 1369 of Lecture Notes in Computer Science, pages 38–59. Springer-Verlag, 1997.
S. Grumbach, P. Rigaux, and L. Segoufin. The DEDALE system for complex spatial queries. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD’98), pages 213–224. ACM Press, 1998.
S. Grumbach, P. Rigaux, and L. Segoufin. Spatio-temporal data handling with constraints. In Proceedings of the 6th International Symposium on Advances in Geographic Information Systems (ACMGIS’98), pages 106–111, 1998.
A. Belussi, E. Bertino, and B. Catania. Manipulating spatial data in constraint databases. In Max J. Egenhofer and John R. Herring, editors, 5th Symposium on Large Spatial Databases (SSD’97), volume 1262 of Lecture Notes in Computer Science, pages 115–141. Springer-Verlag, 1997.
F. Bancilhon, C. Delobel, and P. C. Kanellakis, editors. Building an Object-Oriented Database System: The Story of 02. Morgan Kaufmann, 1992.
F. Bancilhon, S. Cluet, and C. Delobel. A query language for the 02 object-oriented database system. In Proceedings of the 2nd International Workshop on Database Programming Languages (DBPL’89), pages 122–138. Morgan Kaufmann, 1989.
Technology. O2Engine API Reference Manual, 1998.
Technology. O2Engine Spatial Toolkit, 1998.
M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan. Triangulating a simple polygon. Information Processing Letters (IPL), 7 (4): 175–179, 1978.
A. Fournier and D. Y. Montuno. Triangulating simple polygons and equivalent problems. ACM Transactions on Graphics (TOG), 3 (2): 153–174, 1984.
B. Chazelle. Triangulating a simple polygon in linear time. GEOM- ETRY: Discrete and Computational Geometry, 6: 485–524, 1991.
R. Seidel. A simple and fast incremental and randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry: Theory and Applications (CGTA), 1: 51–64, 1991.
F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, 1985.
B. Chazelle and D. P. Dobkin. Optimal convex decomposition. In G. T. Toussaint, editor, Computational Geometry, volume 2, pages 63–133. North-Holland, 1985.
J. M. Keil. Decomposing a polygon into simpler components. SIAM Journal on Computing, 14 (4): 799–817, 1985.
S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proceedings of the 4th Conference on Fundamentals of Computation Theory (FCT), volume 158 of Lecture Notes in Computer Science, pages 207–218. Springer-Verlag, 1983.
M. Stonebraker, J. Frew, K. Gardels, and J. Meredith. The SEQUOIA 2000 benchmark. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD’93), pages 2–11. ACM Press, 1993.
G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25 (2): 73–170, 1993.
L. Becker and R. H. Güting. Rule-based optimization and query processing in an extensible geometric database system. ACM Transactions on Databases Systems (TODS), 17 (2): 247–303, 1992.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grumbach, S., Rigaux, P., Scholl, M., Segoufin, L. (2000). The DEDALE Prototype. In: Kuper, G., Libkin, L., Paredaens, J. (eds) Constraint Databases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04031-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-04031-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08542-0
Online ISBN: 978-3-662-04031-7
eBook Packages: Springer Book Archive