Database Paper Browser

Back to papers

Normal Forms and Conservative Properties for Query Languages over Collection Types

Summary: Proves strong normalization and normal forms for collection-type query languages: for any input/output nesting heights i,o, definability (without the powerset operator) is independent of intermediate nesting height. Uniform for sets, bags, lists and variant types; generalizes Paredaens–Van Gucht and complements Grumbach–Vianu’s powerset negative results, with implications for query optimization. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
985
Venue
PODS
Year
1993
Pagerank
0.00010568101
Overall Rank
1,783 | 87.60%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers