DBScholar

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
h21facfa974a7858a
Venue
SIGMOD
Year
1975
Pagerank
0.00010425848
Overall Rank
1,514 | 89.83%
DOI
10.1145/500080.500089

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gotlieb_sigmod75,
        title = {{COMPUTING JOINS OF RELATIONS}},
        author = {Gotlieb, Leo R.},
        series = {{SIGMOD} '75},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/500080.500089},
        url = {https://dl.acm.org/doi/10.1145/500080.500089},
        year = {1975}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
324 Evaluation of Database Access Paths 1978 SIGMOD 0.0002098669
2,900 A New Way to Compute the Product and Join of Relations 1980 SIGMOD 7.883773e-05
3,012 Query Processing Strategies in the PASCAL/R Relational Database Management System 1982 SIGMOD 7.7547306e-05
3,945 A System for Semantic Query Optimization 1987 SIGMOD 6.9084876e-05
7,272 An Algorithm For Servicing Multi-Relational Queries 1977 SIGMOD 5.5691782e-05
13,573 Database Cost Analysis: a Top-Down Approach 1977 SIGMOD 4.9793485e-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