Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract)
Summary: Over ordered divisible Abelian groups (e.g., Q with +), every order-generic FO query collapses to a pure-order query and admits an effective rewriting eliminating +. Presents a geometric finite-representation lifting technique that uniformly translates results from finite to finitely-representable (constraint) databases via first-order reductions, showing equal expressive power. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,738 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010704219 |
| 4,343 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2665123e-05 |
| 4,376 | Safe Constraint Queries | 1998 | PODS | 6.233754e-05 |
| 5,719 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS | 5.3551435e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited 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 |
| 1,738 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010704219 |
| 4,782 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9233349e-05 |
| 6,380 | Finite Queries do not Have Effective Syntax | 1995 | PODS | 5.0841675e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,450 | Theory of Database Queries (Extended Abstract) | 1988 | PODS | 0.00011926567 |
| 4,376 | Safe Constraint Queries | 1998 | PODS | 6.233754e-05 |
| 4,343 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2665123e-05 |
| 4,401 | On Preservation under Homomorphisms and Unions of Conjunctive Queries | 2004 | PODS | 6.2096576e-05 |
| 12,691 | Fixed-Point Query Languages for Linear Constraint Databases | 2000 | PODS | 4.1905499e-05 |
| 1,648 | Finitely Representable Databases | 1994 | PODS | 0.00011007456 |
| 582 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019753367 |
| 5,719 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS | 5.3551435e-05 |
| 1,738 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010704219 |
| 4,782 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9233349e-05 |