Finitely Representable Databases
Summary: Defines infinite yet finitely representable databases via constraint-based decidable FO theories, motivated by spatial applications. Proves this class violates core classical and finite-model-theory results (compactness, completeness, locality, 0/1-laws), undermining tools for relational-calculus query definability. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Stephane Grumbach
- 2. Jianwen Su
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 618 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00018990567 |
| 1,414 | Towards a Theory of Spatial Database Queries (Extended Abstract) | 1994 | PODS | 0.00012104556 |
| 1,738 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010704219 |
| 2,365 | Topological Queries in Spatial Databases | 1996 | PODS | 8.9531668e-05 |
| 3,787 | Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract) | 1996 | PODS | 6.7633131e-05 |
| 4,782 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9233349e-05 |
| 5,719 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS | 5.3551435e-05 |
| 5,725 | Measuring Infinite Relations (Extended Abstract) | 1995 | PODS | 5.35129e-05 |
| 8,317 | Towards Practical Constraint Databases (Extended Abstract) | 1996 | PODS | 4.5392079e-05 |
| 12,803 | Space-Bounded FOIES | 1995 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 303 | Relative Information Capacity of Simple Relational Database Schemata | 1984 | PODS | 0.00028289399 |
| 618 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00018990567 |
| 2,010 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS | 9.8046157e-05 |
| 3,617 | Completeness Results for Recursive Data Bases | 1993 | PODS | 6.9095022e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,343 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2665123e-05 |
| 6,151 | Probabilistic Databases with an Infinite Open-World Assumption | 2019 | PODS | 5.1805044e-05 |
| 7,108 | Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. | 2016 | PODS | 4.8244082e-05 |
| 4,782 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9233349e-05 |
| 8,265 | Checking Consistency of Database Constraints: a Logical Basis | 1986 | VLDB | 4.5412367e-05 |
| 3,787 | Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract) | 1996 | PODS | 6.7633131e-05 |
| 4,401 | On Preservation under Homomorphisms and Unions of Conjunctive Queries | 2004 | PODS | 6.2096576e-05 |
| 3,856 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD | 6.6938945e-05 |
| 12,300 | The Finite Model Theory Toolbox of a Database Theoretician | 2009 | PODS | 4.1905499e-05 |
| 6,380 | Finite Queries do not Have Effective Syntax | 1995 | PODS | 5.0841675e-05 |