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)
Incoming Non-self Citations Over Time
Authors
- 1. Won Kim (University of Illinois Urbana-Champaign)
BibTeX Citation
@inproceedings{kim_sigmod80,
title = {{A New Way to Compute the Product and Join of Relations}},
author = {Kim, Won},
series = {{SIGMOD} '80},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/582250.582278},
url = {https://dl.acm.org/doi/10.1145/582250.582278},
year = {1980}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,512 | An Architecture For Query Optimization | 1982 | SIGMOD | 8.485242e-05 |
| 2,955 | Query Processing Strategies in the PASCAL/R Relational Database Management System | 1982 | SIGMOD | 7.9213835e-05 |
| 3,726 | Parallelizing Query Optimization | 2008 | VLDB | 7.1697834e-05 |
| 3,915 | A Data Transformation System for Biological Data Sources | 1995 | VLDB | 7.0193727e-05 |
| 7,109 | An Observation on Database Buffering Performance Metrics | 1986 | VLDB | 5.7004478e-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.0024089429 |
| 320 | Evaluation of Database Access Paths | 1978 | SIGMOD | 0.00021373172 |
| 519 | Optimizing the Performance of a Relational Algebra Database Interface | 1975 | SIGMOD | 0.00017144967 |
| 1,479 | Computing Joins Of Relations | 1975 | SIGMOD | 0.00010649695 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 2 | 4,401 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS |
| 3 | 12,727 | A Nested Relational Approach to Processing SQL Subqueries | 2005 | SIGMOD |
| 4 | 7,858 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS |
| 5 | 1,917 | Integration of Buffer Management and Query Optimization In Relational Database Environment | 1989 | VLDB |
| 6 | 8,243 | Effective Resource Utilization for Multiprocessor Join Execution | 1989 | VLDB |
| 7 | 6,569 | The Partial Normalized Storage Model of Nested Relations | 1988 | VLDB |
| 8 | 1,355 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD |
| 9 | 3,617 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |
| 10 | 1,479 | Computing Joins Of Relations | 1975 | SIGMOD |