Database Paper Browser

Back to papers

Computing Joins Of Relations

Summary: Examines efficient storage, access, and manipulation of relations, with emphasis on practical join computation. Introduces join algorithms and evaluates them by storage use and computing time, establishing a storage-time tradeoff framework for relational joins. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2007
Venue
SIGMOD
Year
1975
Pagerank
0.00023029279
Overall Rank
445 | 96.91%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
29 Evaluation of Database Access Paths 1978 SIGMOD 0.00080288088
2,074 A New Way to Compute the Product and Join of Relations 1980 SIGMOD 9.612333e-05
2,709 Query Processing Strategies in the PASCAL/R Relational Database Management System 1982 SIGMOD 8.2607995e-05
4,118 A System for Semantic Query Optimization 1987 SIGMOD 6.4313372e-05
6,743 An Algorithm For Servicing Multi-Relational Queries 1977 SIGMOD 4.9383908e-05
13,095 Database Cost Analysis: a Top-Down Approach 1977 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers