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 |
|---|---|---|---|---|
| 618 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00018990567 |
| 1,648 | Finitely Representable Databases | 1994 | PODS | 0.00011007456 |
| 4,782 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9233349e-05 |
| 12,789 | On Genericity and Parametricity | 1996 | PODS | 4.1905499e-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,328 | Data Path Queries over Embedded Graph Databases | 2022 | PODS | 4.1905499e-05 |
| 364 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025657601 |
| 1,833 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS | 0.00010365844 |
| 4,343 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2665123e-05 |
| 6,380 | Finite Queries do not Have Effective Syntax | 1995 | PODS | 5.0841675e-05 |
| 5,467 | Relative Information Completeness | 2009 | PODS | 5.4904942e-05 |
| 7,594 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.6983854e-05 |
| 1,552 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 0.00011393892 |
| 12,217 | Completeness of Queries over Incomplete Databases | 2011 | VLDB | 4.1905499e-05 |
| 1,738 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010704219 |