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: 984
Venue: PODS
Year: 1993
Pagerank: 9.1244275e-05
Overall Rank: 2,130 | 85.39%
DOI: 10.1145/153850.153853

Incoming Non-self Citations Over Time

Authors

1. Limsoon Wong (University of Pennsylvania)

BibTeX Citation

@inproceedings{wong_pods93,
        address = {New York, NY, USA},
        series = {{PODS} '93},
        title = {{Normal Forms and Conservative Properties for Query Languages over Collection Types}},
        url = {https://dl.acm.org/doi/10.1145/153850.153853},
        doi = {10.1145/153850.153853},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Wong, Limsoon},
        year = {1993}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,777	Deciding Containment for Queries with Complex Objects (Extended Abstract)	1997	PODS	9.7849758e-05
1,890	Relational Expressive Power of Constraint Query Languages	1996	PODS	9.5330753e-05
2,825	Towards an Effective Calculus for Object Query Languages	1995	SIGMOD	8.0869692e-05
5,951	Query Unnesting in Object-Oriented Databases	1998	SIGMOD	6.0313489e-05
6,563	Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (Extended Abstract)	1994	PODS	5.8384765e-05
7,086	A Query Language for NC	1994	PODS	5.7073076e-05
7,339	Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure	1994	PODS	5.6393827e-05
7,386	Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores	2025	VLDB	5.6273882e-05
7,849	New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions	1994	PODS	5.5324391e-05
9,512	Poisson Sampling over Acyclic Joins	2026	SIGMOD	5.2571354e-05
12,208	An Approach towards the Study of Symmetric Queries	2014	VLDB	5.093636e-05
13,022	Tutorial: Languages for Collection Types	1994	PODS	5.093636e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
140	Remarks on the Algebra of Non First Normal Form Relations	1982	PODS	0.00029686538
421	The Format Model: A Theory of Database Organization (extended abstract)	1982	PODS	0.00018742219
2,701	Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions	1988	PODS	8.240179e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,120	Formal Semantics and Analysis of Object Queries	2003	SIGMOD
2	13,022	Tutorial: Languages for Collection Types	1994	PODS
3	2,897	On the Expressive Power of Database Queries with Intermediate Types	1988	PODS
4	7,654	Positive Higher-Order Queries	2010	PODS
5	13,097	On the power of Rule-Based Languages with Sets	1991	PODS
6	1,890	Relational Expressive Power of Constraint Query Languages	1996	PODS
7	13,620	A Dichotomy in the Intensional Expressive Power of Nested Relational Calculi augmented with Aggregate Functions and a Powerset Operator	2013	PODS
8	8,971	Equivalence of Nested Queries with Mixed Semantics	2009	PODS
9	4,336	Languages for Relational Databases over Interpreted Structures	1997	PODS
10	7,849	New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions	1994	PODS