## Finitely Representable Databases (1995)

Citations: | 55 - 8 self |

### BibTeX

@MISC{Grumbach95finitelyrepresentable,

author = {Stéphane Grumbach and Jianwen Su},

title = {Finitely Representable Databases},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

: We study classes of infinite but finitely representable databases based on constraints, motivated by new database applications such as geographical databases. We formally define these notions and introduce the concept of query which generalizes queries over classical relational databases. We prove that in this context the basic properties of queries (satisfiability, containment, equivalence, etc.) are nonrecursive. 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. We then mainly concentrate on dense order databases, and exhibit...