Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases

Summary: Classifies universal-quantification queries in object/object-relational databases and compares anti-semijoin, division, grouping, and difference plans. Anti-semijoins dominate and object features enable them where relational rewrites cannot, exposing SQL optimizers’ blind spot. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 8620
Venue: VLDB
Year: 1997
Pagerank: 5.6793385e-05
Overall Rank: 7,183 | 50.72%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. J. Claussen (University of Passau)
2. A. Kemper (University of Passau)
3. G. Moerkotte (University of Mannheim)
4. K. Peithner (University of Passau)

BibTeX Citation

@article{claussen_vldb97,
        title = {{Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases}},
        author = {Claussen, J. and Kemper, A. and Moerkotte, G. and Peithner, K.},
        journal = {PVLDB},
        series = {{VLDB} '97},
        pages = {286--295},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,951	Query Unnesting in Object-Oriented Databases	1998	SIGMOD	6.0313489e-05
5,996	The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication	2015	PODS	6.0150613e-05

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
95	Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers	1987	VLDB	0.00034607909
129	Optimization of Nested SQL Queries Revisited	1987	SIGMOD	0.0003068101
1,052	Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins	1990	SIGMOD	0.00012405308
1,341	Experiences Building the Open OODB Query Optimizer	1993	SIGMOD	0.00011108876
1,462	Advanced Query Processing in Object Bases Using Access Support Relations	1990	VLDB	0.00010701465
1,568	Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates	1997	VLDB	0.0001034191
3,656	Bypassing Joins in Disjunctive Queries	1995	VLDB	7.2224287e-05
3,708	Providing Better Support for a Class of Decision Support Queries	1996	SIGMOD	7.1814701e-05
4,530	Processing Queries with Quantifiers: A Horticultural Approach	1983	PODS	6.6446379e-05
5,352	Range Nesting: A Fast Method To Evaluate Quantified Queries	1983	SIGMOD	6.2528892e-05
6,072	Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited	1989	SIGMOD	5.9870797e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,950	Translating and Optimizing SQL Queries Having Aggregates	1987	VLDB
2	11,135	Query Optimization by Quantifier Elimination	2024	PODS
3	7,495	On the Calculation of Optimality Ranges for Relational Query Execution Plans	2018	SIGMOD
4	143	Optimization of Nonrecursive Queries	1986	VLDB
5	290	An Overview of Query Optimization in Relational Systems	1998	PODS
6	2,465	Optimization of Queries with User-defined Predicates	1996	VLDB
7	2,296	Containment and Minimization of Positive Conjunctive Queries in OODB's (Extended Abstract)	1992	PODS
8	1,073	A General Framework for the Optimization of Object-Oriented Queries	1992	SIGMOD
9	6,072	Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited	1989	SIGMOD
10	12,289	Efficient Implementation of Generalized Quantification in Relational Query Languages	2013	VLDB