Database Paper Browser

Back to papers

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
2044
Venue
SIGMOD
Year
1977
Pagerank
4.9624102e-05
Overall Rank
6,686 | 53.49%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,937 Windows On The World 1983 SIGMOD 0.00010029315
6,168 Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions 1984 SIGMOD 5.1716335e-05
Previous Page 1 / 1 Next

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
441 Computing Joins Of Relations 1975 SIGMOD 0.00023058395
1,224 A Generalized Access Path Model And Its Application To A Relational Data Base System 1976 SIGMOD 0.00013194206
Previous Page 1 / 1 Next

Semantically Similar Papers