Database Paper Browser

Back to papers

Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions

Summary: Generalizes extension joins to chase join expressions to compute total projections of the representative instance under functional dependencies. Demonstrates that unions of simple chase join expressions suffice under an independent scheme, with a simple algorithm to minimize join count. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2243
Venue
SIGMOD
Year
1984
Pagerank
5.1716335e-05
Overall Rank
6,168 | 57.10%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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.

Rank Cited Paper Year Venue Pagerank
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
58 Efficient Optimization of a Class of Relational Expressions 1978 SIGMOD 0.00064826446
135 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00042421957
458 Independent Database Schemas (Extended Abstract) 1982 PODS 0.00022657396
920 The U. R. Strikes Back 1982 PODS 0.00015338004
1,224 A Generalized Access Path Model And Its Application To A Relational Data Base System 1976 SIGMOD 0.00013194206
1,937 Windows On The World 1983 SIGMOD 0.00010029315
2,918 Notions of Dependency Satisfaction 1982 PODS 7.9051531e-05
3,380 Independent and Separable Database Schemes 1983 PODS 7.1606467e-05
3,461 Specifying Connections for a Universal Relation Scheme Database 1982 SIGMOD 7.0711544e-05
6,686 An Algorithm For Servicing Multi-Relational Queries 1977 SIGMOD 4.9624102e-05
9,012 Querying Weak Instances 1984 PODS 4.4096041e-05
9,013 The Revenge Of The Jd 1983 PODS 4.4096041e-05
Previous Page 1 / 1 Next

Semantically Similar Papers