An Algorithm For Servicing Multi-Relational Queries

Summary: Algorithm determines a sequence of joins to generate Rn+1 from R1..Rn (if such a sequence exists) using D, K, and Dn+1. Theoretical and empirical computing times are discussed, and a new relational DBMS employing the algorithm is outlined. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2106
Venue: SIGMOD
Year: 1977
Pagerank: 5.6970022e-05
Overall Rank: 7,120 | 51.16%
DOI: 10.1145/509404.509408

Incoming Non-self Citations Over Time

Authors

1. Kathryn L. Schenk (University of Tennessee)
2. James R. Pinkert (University of Tennessee)

BibTeX Citation

@inproceedings{schenk_sigmod77,
        title = {{AN ALGORITHM FOR SERVICING MULTI-RELATIONAL QUERIES}},
        author = {Schenk, Kathryn L. and Pinkert, James R.},
        series = {{SIGMOD} '77},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/509404.509408},
        url = {https://dl.acm.org/doi/10.1145/509404.509408},
        year = {1977}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,289	Windows On The World	1983	SIGMOD	8.7994393e-05
7,132	Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions	1984	SIGMOD	5.694968e-05

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
1,479	Computing Joins Of Relations	1975	SIGMOD	0.00010649695
1,929	A Generalized Access Path Model And Its Application To A Relational Data Base System	1976	SIGMOD	9.4676007e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,313	Reverse Engineering Complex Join Queries	2013	SIGMOD
2	14,482	EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract)	1984	SIGMOD
3	3,617	Scalable Computation of Acyclic Joins (Extended Abstract)	2006	PODS
4	143	Optimization of Nonrecursive Queries	1986	VLDB
5	3,615	Relational Queries in a Domain Based DBMS	1983	SIGMOD
6	2,104	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB
7	8,235	Computing Complex Temporal Join Queries Efficiently	2022	SIGMOD
8	1,467	The Complexity of Evaluating Relational Queries	1983	PODS
9	7,858	Optimization of Multiple-Relation Multiple-Disjunct Queries	1988	PODS
10	1,479	Computing Joins Of Relations	1975	SIGMOD