![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
CDB 1995: Friedrichshafen, Germany
- Gabriel M. Kuper, Mark Wallace:
Constraint Databases and Applications, ESPRIT WG CONTESSA Workshop, Friedrichshafen, Germany, September 8-9, 1995, Proceedings. Lecture Notes in Computer Science 1034, Springer 1996, ISBN 3-540-60794-3 - Helmut Simonis:
Application Development with the CHIP System. 1-21 - Foto N. Afrati, Theodoros Andronikos, Theodoros G. Kavalieros:
On the Expressiveness of First-Order Constraint Languages. 22-39 - Alberto Belussi, Elisa Bertino, Michela Bertolotto, Barbara Catania:
Generalized Relational Algebra: Modeling Spatial Queries in Constraint Databases. 40-67 - Jo-Hag Byon, Peter Z. Revesz
:
DISCO: A Constraint Database System with Sets. 68-83 - Volker Gaede, Oliver Günther:
Constraint-Based Query Optimization and Processing. 84-101 - Michael Freeston:
The Application of Multi-Dimensional Indexing Methods to Constraints. 102-119 - Luis Hermosilla, Gabriel M. Kuper:
Towards the Definition of a Spatial Object-Oriented Data Model with Constraints. 120-131 - Joachim Reinert:
Ambiguity for Referential Integrity Is Undecidable. 132-147 - Mark Wallace, Stéphane Bressan, Thierry Le Provost:
Magic Checking: Constraint Checking for Database Query Optimization. 148-166 - Tatyana M. Yakhno, G. B. Cheblakov, V. Z. Zilberfain:
FISSURE: FInder of Solutions with SUbdefinite REsources. 167-185
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.