Database Paper Browser

Back to papers

A New Way to Compute the Product and Join of Relations

Summary: Nested-block method for computing the product or join of n relations in paged memory, exploiting buffer space. Cost model and heuristic for near-optimal memory allocation; enables efficient computation of n-relations products and augments traditional joins. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2133
Venue
SIGMOD
Year
1980
Pagerank
9.6196263e-05
Overall Rank
2,071 | 85.60%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,702 An Architecture For Query Optimization 1982 SIGMOD 0.0001085438
2,705 Query Processing Strategies in the PASCAL/R Relational Database Management System 1982 SIGMOD 8.2681571e-05
3,769 A Data Transformation System for Biological Data Sources 1995 VLDB 6.7782158e-05
4,261 Parallelizing Query Optimization 2008 VLDB 6.31244e-05
6,346 An Observation on Database Buffering Performance Metrics 1986 VLDB 5.1019935e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0040449103
29 Evaluation of Database Access Paths 1978 SIGMOD 0.00080392503
163 Optimizing the Performance of a Relational Algebra Database Interface 1975 SIGMOD 0.00039689347
441 Computing Joins Of Relations 1975 SIGMOD 0.00023058395
Previous Page 1 / 1 Next

Semantically Similar Papers