Database Paper Browser

Back to papers

Exact and Approximate Aggregation in Constraint Query Languages

Summary: Proves constraint-query languages cannot define exact or approximate aggregation; VC-dimension based approximations are insufficient. Proposes FO+POLY+SUM: SUM over range-restricted queries, computes volumes for linear constraints and (with an ML tweak) probabilistic polynomial-volume approximations. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1165
Venue
PODS
Year
1999
Pagerank
5.9659829e-05
Overall Rank
4,719 | 67.21%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
14 Online Aggregation 1997 SIGMOD 0.0010813443
184 New Sampling-Based Summary Statistics for Improving Approximate Query Answers 1998 SIGMOD 0.00036655704
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
2,475 Querying Aggregate Data 1999 PODS 8.6942707e-05
2,973 Variable Independence and Aggregation Closure 1996 PODS 7.7895983e-05
3,892 Querying Spatial Databases via Topological Invariants 1998 PODS 6.6540282e-05
4,343 Languages for Relational Databases over Interpreted Structures 1997 PODS 6.2665123e-05
4,366 An Expressive Language for Linear Spatial Database Queries (extended abstract) 1998 PODS 6.2427716e-05
4,376 Safe Constraint Queries 1998 PODS 6.233754e-05
5,725 Measuring Infinite Relations (Extended Abstract) 1995 PODS 5.35129e-05
Previous Page 1 / 1 Next

Semantically Similar Papers