Relative information capacity of simple relational database schemata
SIAM Journal on Computing
Languages that capture complexity classes
SIAM Journal on Computing
A closed form for Datalog queries with integer order (preliminary version)
ICDT '90 Proceedings of the third international conference on database theory on Database theory
On the expressive power of the relational calculus with arithmetic constraints (extended abstract)
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Handbook of theoretical computer science (vol. A)
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Completeness results for recursive data bases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite-model theory—a personal perspective
ICDT Selected papers of the 4th international conference on Database theory
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A relational model of data for large shared data banks
Communications of the ACM
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint Programming and Database Query Languages
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Towards a theory of spatial database queries (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database querying and constraint programming
ACM SIGACT News
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dense-order constraint databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Space-bounded FOIES (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear vs. order constraint queries over rational databases (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards practical constraint databases (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Topological queries in spatial databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Uniform quantifier elimination and constraint query processing
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On the containment and equivalence of database queries with linear constraints (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Annals of Mathematics and Artificial Intelligence
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
More about recursive structures: descriptive complexity and zero-one laws
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the Structure of Queries in Constraint Query Languages
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We study classes of infinite but finitely representable databases based on constraints, motivated by new database applications such as geographical databases. The mathematical framework is based on classical decidable first-order theories. We investigate the theory of finitely representable models and prove that it differs strongly from both classical model theory and finite model theory. In particular, we show that most of the well known theorems of either one fail (compactness, completeness, locality, 0/1 laws, etc.). An immediate consequence is the lack of tools to consider the definability of queries in the relational calculus over finitely representable databases. We illustrate this very challenging problem through some classical examples.