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.0939851e-05
Overall Rank: 2,808 | 80.49%
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,450	Theory of Database Queries (Extended Abstract)	1988	PODS	0.00011926567
1,833	The Expressiveness of a Family of Finite Set Languages	1991	PODS	0.00010365844
2,520	Untyped Sets, Invention, and Computable Queries	1989	PODS	8.6044305e-05
2,546	Towards Tractable Algebras for Bags (Extended Abstract)	1993	PODS	8.5606179e-05
3,043	Tractable Query Languages for Complex Object Databases	1991	PODS	7.6632326e-05
3,195	On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions	1989	SIGMOD	7.4052272e-05
3,392	The Powerset Algebra As A Result Of Adding Programming Constructs To The Nested Relational Algebra	1988	SIGMOD	7.1418515e-05
8,448	On the power of Rule-Based Languages with Sets	1991	PODS	4.5039113e-05
12,866	Database Method Schemas and Object Creation	1993	PODS	4.1905499e-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.0011268747
93	Remarks on the Algebra of Non First Normal Form Relations	1982	PODS	0.00051290296
303	Relative Information Capacity of Simple Relational Database Schemata	1984	PODS	0.00028289399
375	PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract)	1988	PODS	0.00025262028
443	A Calculus for Complex Objects	1986	PODS	0.00023059917
485	A New Approach to Database Logic	1984	PODS	0.00022061287
490	Horn Clauses and the Fixpoint Query Hierarchy	1982	PODS	0.00021979489
652	Logic Programming With Sets	1987	PODS	0.00018643929
910	Sets and Negation in a Logic Database Language (LDL1)	1987	PODS	0.00015398775
1,920	A Transaction Language Complete for Database Update and Specification	1987	PODS	0.00010092077
2,560	Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions	1988	PODS	8.541561e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
12,673	String Operations in Query Languages	2001	PODS	4.1905499e-05
1,833	The Expressiveness of a Family of Finite Set Languages	1991	PODS	0.00010365844
7,244	Positive Higher-Order Queries	2010	PODS	4.7856771e-05
4,343	Languages for Relational Databases over Interpreted Structures	1997	PODS	6.2665123e-05
2,520	Untyped Sets, Invention, and Computable Queries	1989	PODS	8.6044305e-05
7,773	Formal Semantics and Analysis of Object Queries	2003	SIGMOD	4.6506061e-05
3,195	On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions	1989	SIGMOD	7.4052272e-05
13,432	A Dichotomy in the Intensional Expressive Power of Nested Relational Calculi augmented with Aggregate Functions and a Powerset Operator	2013	PODS	-
3,043	Tractable Query Languages for Complex Object Databases	1991	PODS	7.6632326e-05
432	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00023349408