On the Expressive Power of Database Queries with Intermediate Types

Summary: Defines CALC_k,s to quantify set-height of input/output and intermediate types in the complex-object calculus and studies semantics with arbitrarily many or bounded invented values. Shows invented-value semantics leaves relational calculus unchanged and CALC0,∞=CALC0,1; proves CALC0,s has ≥EXPSPACE complexity, the CALC0,s hierarchy is strict (CALC0,s < CALC0,s+2), and ⋃_s CALC0,s is strictly weaker than the class of computable database queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 814
Venue: PODS
Year: 1988
Pagerank: 8.1019352e-05
Overall Rank: 2,800 | 80.53%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Richard Hull
2. Jianwen Su

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,448	Theory of Database Queries (Extended Abstract)	1988	PODS	0.00011938045
1,835	The Expressiveness of a Family of Finite Set Languages	1991	PODS	0.00010375854
2,515	Untyped Sets, Invention, and Computable Queries	1989	PODS	8.6128871e-05
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
3,189	On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions	1989	SIGMOD	7.4116834e-05
3,392	The Powerset Algebra As A Result Of Adding Programming Constructs To The Nested Relational Algebra	1988	SIGMOD	7.1485699e-05
8,454	On the power of Rule-Based Languages with Sets	1991	PODS	4.5082358e-05
12,857	Database Method Schemas and Object Creation	1993	PODS	4.1945683e-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
12	The Functional Data Model and the Data Language DAPLEX	1979	SIGMOD	0.0011248121
97	Remarks on the Algebra of Non First Normal Form Relations	1982	PODS	0.0005080702
302	Relative Information Capacity of Simple Relational Database Schemata	1984	PODS	0.00028316973
374	PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract)	1988	PODS	0.00025286717
440	A Calculus for Complex Objects	1986	PODS	0.00023084404
485	A New Approach to Database Logic	1984	PODS	0.00022085103
490	Horn Clauses and the Fixpoint Query Hierarchy	1982	PODS	0.00022016773
649	Logic Programming With Sets	1987	PODS	0.00018662857
912	Sets and Negation in a Logic Database Language (LDL1)	1987	PODS	0.00015414126
1,916	A Transaction Language Complete for Database Update and Specification	1987	PODS	0.00010101977
2,553	Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions	1988	PODS	8.5500139e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,741	Relational Expressive Power of Constraint Query Languages	1996	PODS	0.00010714223
1,835	The Expressiveness of a Family of Finite Set Languages	1991	PODS	0.00010375854
7,248	Positive Higher-Order Queries	2010	PODS	4.7902631e-05
4,346	Languages for Relational Databases over Interpreted Structures	1997	PODS	6.2725564e-05
2,515	Untyped Sets, Invention, and Computable Queries	1989	PODS	8.6128871e-05
7,773	Formal Semantics and Analysis of Object Queries	2003	SIGMOD	4.655071e-05
3,189	On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions	1989	SIGMOD	7.4116834e-05
13,419	A Dichotomy in the Intensional Expressive Power of Nested Relational Calculi augmented with Aggregate Functions and a Powerset Operator	2013	PODS	-
3,040	Tractable Query Languages for Complex Object Databases	1991	PODS	7.6707607e-05
431	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00023370207