Database Paper Browser

Back to papers

New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions

Summary: New techniques show that graph properties definable in nested-collection query languages (set/bag semantics with aggregates) are finite or cofinite, settling that parity, TC and balanced-tree tests are inexpressible in bag/nested-relational languages. Prove a bounded-degree property for the nested-relational language that yields a uniform source of many inexpressibility results. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1027
Venue
PODS
Year
1994
Pagerank
4.6523963e-05
Overall Rank
7,782 | 45.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
335 Optimization of Real Conjunctive Queries 1993 PODS 0.00027036073
1,783 Normal Forms and Conservative Properties for Query Languages over Collection Types 1993 PODS 0.00010568101
1,835 The Expressiveness of a Family of Finite Set Languages 1991 PODS 0.00010375854
2,546 Towards Tractable Algebras for Bags (Extended Abstract) 1993 PODS 8.5701687e-05
3,040 Tractable Query Languages for Complex Object Databases 1991 PODS 7.6707607e-05
5,974 A Query Language for NC 1994 PODS 5.246329e-05
Previous Page 1 / 1 Next

Semantically Similar Papers