Database Paper Browser

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
8570
Venue
VLDB
Year
1999
Pagerank
8.6089125e-05
Overall Rank
2,518 | 82.49%
DOI
-

Incoming Non-self Citations Over Time

Authors

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.0040449103
9 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.0014279444
1,710 Microsoft Index Tuning Wizard for SQL Server 7.0 1998 SIGMOD 0.00010807871
1,900 Hash joins and hash teams in Microsoft SQL Server 1998 VLDB 0.000101645
Previous Page 1 / 1 Next

Semantically Similar Papers