Database Paper Browser

Back to papers

Theory of Database Queries (Extended Abstract)

Summary: Surveys foundational theory of query languages: equivalence of first-order logic and relational algebra, and the completeness vs. efficiency trade-off. Emphasizes practically useful restricted classes (SPJ, tableaux, sargable), unique minimal forms for SPJ, and the influence of logic programming on query optimization theory. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
810
Venue
PODS
Year
1988
Pagerank
0.00011926567
Overall Rank
1,450 | 89.93%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
603 On the Complexity of Bounded-Variable Queries 1995 PODS 0.00019334592
2,288 Local Verification of Global Integrity Constraints in Distributed Databases 1993 SIGMOD 9.093171e-05
7,363 IDLOG: Extending the Expressive Power of Deductive Database Languages 1990 SIGMOD 4.7461604e-05
8,173 The Power of Methods With Parallel Semantics 1991 VLDB 4.5640563e-05
8,448 On the power of Rule-Based Languages with Sets 1991 PODS 4.5039113e-05
8,567 Semi-determinism (extended abstract) 1992 PODS 4.4893996e-05
12,801 Combinatorial Games in Database Theory 1995 PODS 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 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