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
2045
Venue
SIGMOD
Year
1977
Pagerank
4.9383908e-05
Overall Rank
6,743 | 53.14%
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,965 Windows On The World 1983 SIGMOD 9.9176387e-05
7,070 Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions 1984 SIGMOD 4.8380576e-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
445 Computing Joins Of Relations 1975 SIGMOD 0.00023029279
1,227 A Generalized Access Path Model And Its Application To A Relational Data Base System 1976 SIGMOD 0.00013159117
Previous Page 1 / 1 Next

Semantically Similar Papers