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,741 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010714223 |
| 4,346 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2725564e-05 |
| 4,379 | Safe Constraint Queries | 1998 | PODS | 6.2397591e-05 |
| 5,709 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS | 5.3602702e-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 |
|---|---|---|---|---|
| 620 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00019005954 |
| 1,649 | Finitely Representable Databases | 1994 | PODS | 0.00011017687 |
| 1,741 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010714223 |
| 4,778 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9290535e-05 |
| 6,382 | Finite Queries do not Have Effective Syntax | 1995 | PODS | 5.0890445e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,448 | Theory of Database Queries (Extended Abstract) | 1988 | PODS | 0.00011938045 |
| 4,379 | Safe Constraint Queries | 1998 | PODS | 6.2397591e-05 |
| 4,346 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2725564e-05 |
| 4,405 | On Preservation under Homomorphisms and Unions of Conjunctive Queries | 2004 | PODS | 6.2156238e-05 |
| 12,682 | Fixed-Point Query Languages for Linear Constraint Databases | 2000 | PODS | 4.1945683e-05 |
| 581 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019767772 |
| 1,649 | Finitely Representable Databases | 1994 | PODS | 0.00011017687 |
| 5,709 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS | 5.3602702e-05 |
| 1,741 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010714223 |
| 4,778 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS | 5.9290535e-05 |