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: h9a6d3ed700b32b22
Venue: SIGMOD
Year: 1984
Pagerank: 5.5671882e-05
Overall Rank: 7,279 | 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,619	Efficient Query Answering in the Representative Instance Approach	1985	PODS	7.1558272e-05
8,465	Independence-reducible Database Schemes	1988	PODS	5.3350162e-05
13,411	Efficient Updates to Independent Schemes in the Weak Instance Model	1990	SIGMOD	4.9793485e-05
13,461	On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies	1987	PODS	4.9793485e-05
13,463	A New Basis for the Weak Instance Model	1987	PODS	4.9793485e-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
41	Testing Implications Of Data Dependencies	1979	SIGMOD	0.00045899672
102	Efficient Optimization of a Class of Relational Expressions	1978	SIGMOD	0.00033914384
278	Can We Use The Universal Instance Assumption Without Using Nulls?	1981	SIGMOD	0.00022313978
769	Independent Database Schemas (Extended Abstract)	1982	PODS	0.00014104125
1,138	The U. R. Strikes Back	1982	PODS	0.00011865234
1,982	A Generalized Access Path Model And Its Application To A Relational Data Base System	1976	SIGMOD	9.2569646e-05
2,346	Windows On The World	1983	SIGMOD	8.6020356e-05
4,035	Specifying Connections for a Universal Relation Scheme Database	1982	SIGMOD	6.8390986e-05
4,964	Notions of Dependency Satisfaction	1982	PODS	6.337274e-05
6,281	Independent and Separable Database Schemes	1983	PODS	5.8238839e-05
7,272	An Algorithm For Servicing Multi-Relational Queries	1977	SIGMOD	5.5691782e-05
9,433	Querying Weak Instances	1984	PODS	5.1781766e-05
9,434	The Revenge Of The Jd	1983	PODS	5.1781766e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,198	Incomplete Information and Dependencies in Relational Databases	1983	SIGMOD
2	3,807	Dependency Satisfaction in Databases with Incomplete Information	1984	VLDB
3	278	Can We Use The Universal Instance Assumption Without Using Nulls?	1981	SIGMOD
4	8,098	Optimizing the Chase: Scalable Data Integration under Constraints	2014	VLDB
5	8,462	On the Optimality of Strategies for Multiple Joins	1990	PODS
6	10,386	Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries	2026	PODS
7	8,469	The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract)	1986	PODS
8	4,459	Semantic Query Optimization in the Presence of Types	2010	PODS
9	1,455	On Computing Restricted Projections of Representative Instances	1985	PODS
10	3,619	Efficient Query Answering in the Representative Instance Approach	1985	PODS