Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems
Summary: Introduces NUMA-affine massively parallel sort-merge joins using partial partition-based sorting, avoiding the traditionally serial final merge. On 1-TB/32-core hardware, MPSM scales nearly linearly and beats state-of-the-art parallel hash joins by up to 4×. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Martina-Cezara Albutiu (Technical University of Munich)
- 2. Alfons Kemper (Technical University of Munich)
- 3. Thomas Neumann (Technical University of Munich)
BibTeX Citation
@article{albutiu_vldb12,
title = {{Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems}},
author = {Albutiu, Martina-Cezara and Kemper, Alfons and Neumann, Thomas},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {10},
pages = {1064--1075},
doi = {10.14778/2336664.2336675},
url = {https://doi.org/10.14778/2336664.2336675},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 53 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,348 | Cache-Efficient Top-k Aggregation over High Cardinality Large Datasets | 2024 | VLDB | 5.093636e-05 |
| 11,421 | Lightweight Materialization for Fast Dashboards Over Joins | 2023 | SIGMOD | 5.093636e-05 |
| 11,556 | Scaling Equi-Joins | 2022 | SIGMOD | 5.093636e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 23 | Efficiently Compiling Efficient Query Plans for Modern Hardware | 2011 | VLDB | 0.00054886415 |
| 29 | Database Architecture Optimized for the New Bottleneck: Memory Access | 1999 | VLDB | 0.00052093615 |
| 209 | Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs | 2009 | VLDB | 0.00024932174 |
| 360 | Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs | 2011 | SIGMOD | 0.00020182846 |
| 481 | Practical Skew Handling in Parallel Joins | 1992 | VLDB | 0.00017780716 |
| 631 | Relational Joins on Graphics Processors | 2008 | SIGMOD | 0.00015591241 |
| 712 | Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture | 2008 | VLDB | 0.0001468812 |
| 721 | Database Architecture Evolution: Mammals Flourished long before Dinosaurs became Extinct | 2009 | VLDB | 0.00014631814 |
| 1,369 | How Soccer Players Would do Stream Joins | 2011 | SIGMOD | 0.0001099892 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,668 | Performance Analysis of a Load Balancing Hash-Join Algorithm for a Shared Memory Multiprocessor | 1991 | VLDB |
| 2 | 3,134 | Efficient Join Algorithms For Large Database Tables in a Multi-GPU Environment | 2021 | VLDB |
| 3 | 4,639 | MQJoin: Efficient Shared Execution of Main-Memory Joins | 2016 | VLDB |
| 4 | 9,333 | Efficiently Joining Large Relations on Multi-GPU Systems | 2025 | VLDB |
| 5 | 1,177 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD |
| 6 | 2,926 | Distributed Join Algorithms on Thousands of Cores | 2017 | VLDB |
| 7 | 3,011 | Design and Evaluation of Parallel Pipelined Join Algorithms | 1987 | SIGMOD |
| 8 | 209 | Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs | 2009 | VLDB |
| 9 | 360 | Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs | 2011 | SIGMOD |
| 10 | 252 | Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited | 2014 | VLDB |