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: 2305
Venue: SIGMOD
Year: 1984
Pagerank: 5.694968e-05
Overall Rank: 7,132 | 51.07%
DOI: 10.1145/602259.602280

Incoming Non-self Citations Over Time

Authors

1. Edward P. F. Chan (University of Toronto)

BibTeX Citation

@inproceedings{chan_sigmod84,
        title = {{Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions}},
        author = {Chan, Edward P. F.},
        series = {{SIGMOD} '84},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/602259.602280},
        url = {https://dl.acm.org/doi/10.1145/602259.602280},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,551	Efficient Query Answering in the Representative Instance Approach	1985	PODS	7.3196924e-05
8,297	Independence-reducible Database Schemes	1988	PODS	5.4574671e-05
13,121	Efficient Updates to Independent Schemes in the Weak Instance Model	1990	SIGMOD	5.093636e-05
13,171	On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies	1987	PODS	5.093636e-05
13,173	A New Basis for the Weak Instance Model	1987	PODS	5.093636e-05

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
40	Testing Implications Of Data Dependencies	1979	SIGMOD	0.00046918506
97	Efficient Optimization of a Class of Relational Expressions	1978	SIGMOD	0.00034574497
266	Can We Use The Universal Instance Assumption Without Using Nulls?	1981	SIGMOD	0.00022823892
742	Independent Database Schemas (Extended Abstract)	1982	PODS	0.00014426824
1,111	The U. R. Strikes Back	1982	PODS	0.00012131168
1,929	A Generalized Access Path Model And Its Application To A Relational Data Base System	1976	SIGMOD	9.4676007e-05
2,289	Windows On The World	1983	SIGMOD	8.7994393e-05
3,957	Specifying Connections for a Universal Relation Scheme Database	1982	SIGMOD	6.9945541e-05
4,843	Notions of Dependency Satisfaction	1982	PODS	6.482729e-05
6,153	Independent and Separable Database Schemes	1983	PODS	5.9569613e-05
7,120	An Algorithm For Servicing Multi-Relational Queries	1977	SIGMOD	5.6970022e-05
9,259	Querying Weak Instances	1984	PODS	5.2970277e-05
9,260	The Revenge Of The Jd	1983	PODS	5.2970277e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,189	Physical Data Independence, Constraints, and Optimization with Universal Plans	1999	VLDB
2	3,750	Dependency Satisfaction in Databases with Incomplete Information	1984	VLDB
3	266	Can We Use The Universal Instance Assumption Without Using Nulls?	1981	SIGMOD
4	7,930	Optimizing the Chase: Scalable Data Integration under Constraints	2014	VLDB
5	8,294	On the Optimality of Strategies for Multiple Joins	1990	PODS
6	8,301	The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract)	1986	PODS
7	10,169	Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries	2026	PODS
8	4,369	Semantic Query Optimization in the Presence of Types	2010	PODS
9	1,417	On Computing Restricted Projections of Representative Instances	1985	PODS
10	3,551	Efficient Query Answering in the Representative Instance Approach	1985	PODS