DEDALE, a spatial constraint database

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1369 LNCS, Issue , 1998, Pages 38-59

  Grumbach, Stéphane ^a   Rigaux, Philippe ^b   Scholl, Michel ^a,b   Segoufin, Luc ^a  

^a INRIA ROCQUENCOURT   (France)

^b CEDRIC CNAM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTRAINT DATABASES; CONSTRAINT SOLVING; GEOMETRIC OPERATIONS; LINEAR CONSTRAINTS; OBJECT-ORIENTED FRAMEWORKS; SPATIAL CONSTRAINTS; SPATIAL INFORMATIONS; SPECIAL FUNCTIONS;

QUERY LANGUAGES;

EID: 84893431897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64823-2_4     Document Type: Conference Paper

References (35)

1. D. Abel and B.-C. Ooi, editors. Proc. Intl. Symp. on Large Spatial Databases (SSD). LNCS No, 692. Springer-Verlag, 1993.
2. 2. Morgan Kaufmann, San Mateo, California, 1992.
3. La Base de Données Topographiques de l'I.G.N. Bulletin d'Information de l'I.G.N., No. 59, 1991.
4. 3 constraint object-oriented database system: an overview. In Constraint Databases and Applications, Proc. second international workshop on Constraint Databases Systems (CDB97), Lecture Notes in Computer Science, pages 134-159, 1997.
5. R.G.G. Cattell, editor. The Object Database Standard ODMG-93. Morgan Kaufmann, San Francisco, California, 1994.
6. B. Chazelle and D.P. Dobkin. Optimal Convex Decomposition. In G.T. Toussaint, editor, Computational Geometry, pages 63-133. North Holland, 1985.
7. B. Chazelle. Triangulating a Simple Polygon in Linear Time. Discrete and Computational Geometry, 6:485-524, 1991.
8. E.F. Codd. A relational model of data for large shared data banks. Communications of ACM, 13:6:377-387, 1970.
9. M.J. Egenhofer and J. Herring, editors. Proc. Intl. Symp. on Large Spatial Databases (SSD). LNCS No. 951. Springer-Verlag, 1995.
10. A. Founder and D.Y. Montuno. Triangulating simple polygons and equivalent problems. ACM Transactions on Graphics, 3:153-174, 1984.
11. M.R. Garey, D.S. Johnson, F.P. Preparata, and R.E. Tarjan. Triangulating a Simple Polygon. Information Processing Letter, 7(4):175-180, 1978.
12. S. Grumbach and Z. Lacroix. Computing queries on linear constraint databases. In Fifth Int. Workshop on Database Programming Languages, 1995.
13. S. Grumbach and J. Su. Dense order constraint databases. In 14th ACM Symp. on Principles of Database Systems, pages 66-77, San Jose, May 1995.
14. S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173, 1997. Invited to a special issue.
15. S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. In D. Leivant, editor, Logic and Computational Complexity, Indianapolis, 1994. Springer Verlag. LNCS 960.
16. R. Gueting. An Introduction to Spatial Database Systems. The VLDB Journal, 3(4), 1994.
17. S. Hertel and K. Mehlorn. Fast Triangulation of Simple Polygons. In Proc. Intl. Conf. on Foundations of Computer Theory, LNCS No. 158, pages 207-218. Springer-Verlag, 1983.
18. J.M. Keil. Decomposing a Polygon into Simpler Components. SIAM Journal of Computing, 14(4):799-817, 1985.
19. P. Kanellakis and D. Goldin. Constraint programming and database query languages. In Manuscript, 1994.
20. P. Kanellakis, G Kuper, and P. Revesz. Constraint query languages. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 299-313, Nashville, 1990.
21. K. Lin, H.V. Jagadish, and Christos Faloutsos. The tv-tree - an index for high-dimensional data. VLDB Journal, 1994.
22. Peter Mayle. A Year in Provence. Knopf, New York, 1990.
23. S. Morehouse. The Architecture of ARC/INFO. In Proc. Intl. Symp. on Computer-Assisted Cartography (Auto-Carto 9), pages 266-277, 1989.
24. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1994.
25. J.-P. Peloux and P. Rigaux. A Loosely Coupled Interface to an Object-Oriented Geographic Database. In Proc. Intl. Conf. on Spatial Information Theory (COSIT), 1995.
26. F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer Verlag, 1985.
27. C.H. Papadimitriou, D. Suciu, and V. Vianu. Topological queries in spatial databases. In 15th ACM Symp. on Principles of Database Systems, Montréal, June 1996.
28. J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proc. 13th ACM Symp. on Principles of Database Systems, pages 279-288, 1994.
29. J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals. In Proceedings 10th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1995.
30. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
31. R. Seidel. A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Computational Geometry, 1(1), 1991.
32. 2. Technical Report RRC-96-09; ftp://ftp.cnam.fr/pub/CNAM/cedric/tech-reports/RRC-96-09.ps.Z, Cedric Lab, CNAM, Paris, 1996.
33. R.E. Tarjan and C.J. van Wyk. An O(n log log n) Time Algorithm for Triangulating a Simple Polygon. SIAM Journal of Computing, 17(1):143-178, 1988.
34. V. Gaede and O. Guenther. Multidimensional Access Methods. Technical Report TR-96-043, ICSI, 1996.
35. L. Vandeurzen, M. Gyssens, and D. Van Gucht. On the desirability and limitations of linear spatial database models. In Advances in Spatial Databases, 4th Int. Symp., SSD'95, pages 14-28. Springer, 1995.