Completeness Results for Recursive Data Bases
Summary: Completeness characterizations for computable (infinite recursive) relational databases: quantifier-free first-order logic is complete for the unrestricted class of computable databases. For “highly symmetric” databases (automorphism group of finite index at each tuple-width) a modified Chandra–Harel QL is complete; BP-completeness is also analyzed. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Tirza Hirst
- 2. David Harel
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 620 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00019005954 |
| 1,649 | Finitely Representable Databases | 1994 | PODS | 0.00011017687 |
| 4,778 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9290535e-05 |
| 12,780 | On Genericity and Parametricity | 1996 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,326 | Data Path Queries over Embedded Graph Databases | 2022 | PODS | 4.1945683e-05 |
| 363 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025715157 |
| 1,835 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS | 0.00010375854 |
| 4,346 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2725564e-05 |
| 6,382 | Finite Queries do not Have Effective Syntax | 1995 | PODS | 5.0890445e-05 |
| 5,460 | Relative Information Completeness | 2009 | PODS | 5.4957751e-05 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |
| 1,529 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 0.00011496686 |
| 12,209 | Completeness of Queries over Incomplete Databases | 2011 | VLDB | 4.1945683e-05 |
| 1,741 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010714223 |