Database Paper Browser

Back to papers

Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems

Summary: Massively parallel sort-merge (MPSM) join algorithms for in-memory, multi-core databases. They avoid a final global merge by partial partition-based sorting on local NUMA partitions, achieving near-linear core scaling and outperforming hash-join approaches (e.g., Vectorwise) on large RAM. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10345
Venue
VLDB
Year
2012
Pagerank
0.00019706145
Overall Rank
585 | 95.94%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 53 citing papers.

Rank Citing Paper Year Venue Pagerank
11,142 Cache-Efficient Top-k Aggregation over High Cardinality Large Datasets 2024 VLDB 4.1945683e-05
11,220 Lightweight Materialization for Fast Dashboards Over Joins 2023 SIGMOD 4.1945683e-05
11,358 Scaling Equi-Joins 2022 SIGMOD 4.1945683e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers