DBScholar

Back to papers

The Value of Merge-Join and Hash-Join in SQL Server

Summary: Evaluates the incremental value of merge-join and hash-join in SQL Server for OLTP and DSS workloads using an internal build and TPC-D experiments. Shows that OLTP workloads need only nested loops, while delivering optimal decision-support performance requires both merge-join and hash-join. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8761
Venue
VLDB
Year
1999
Pagerank
7.9255489e-05
Overall Rank
2,952 | 79.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{graefe_vldb99,
        title = {{The Value of Merge-Join and Hash-Join in SQL Server}},
        author = {Graefe, Goetz},
        journal = {PVLDB},
        series = {{VLDB} '99},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

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
7 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.00083340894
1,809 Hash joins and hash teams in Microsoft SQL Server 1998 VLDB 9.7034998e-05
1,870 Microsoft Index Tuning Wizard for SQL Server 7.0 1998 SIGMOD 9.579726e-05
Previous Page 1 / 1 Next

Semantically Similar Papers