Origami: A High-Performance Mergesort Framework
Summary: Origami is a SIMD-aware in-memory mergesort with fast in-register sorters, branchless streaming merges, cache-resident quad-merge trees, and parallel partitioning. It delivers up to 2× faster single-threaded sorting and near-linear multicore scaling. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Arif Arman (Texas A&M University)
- 2. Dmitri Loguinov (Texas A&M University)
BibTeX Citation
@article{arman_vldb22,
title = {{Origami: A High-Performance Mergesort Framework}},
author = {Arman, Arif and Loguinov, Dmitri},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {2},
pages = {259--271},
doi = {10.14778/3489496.3489507},
url = {https://doi.org/10.14778/3489496.3489507},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 209 | Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs | 2009 | VLDB | 0.00024932174 |
| 678 | Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort | 2010 | SIGMOD | 0.00015061068 |
| 712 | Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture | 2008 | VLDB | 0.0001468812 |
| 1,177 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD | 0.00011808761 |
| 3,212 | Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions | 2015 | VLDB | 7.6328776e-05 |
| 4,177 | SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures | 2015 | VLDB | 6.8499317e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,113 | Patience is a Virtue: Revisiting Merge and Sort on Modern Processors | 2014 | SIGMOD |
| 2 | 6,699 | Percentile Finding Algorithm for Multiple Sorted Runs | 1989 | VLDB |
| 3 | 1,177 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD |
| 4 | 423 | Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems | 2012 | VLDB |
| 5 | 2,667 | A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs | 2017 | SIGMOD |
| 6 | 2,139 | CellSort: High Performance Sorting on the Cell Processor | 2007 | VLDB |
| 7 | 4,955 | Dynamic Memory Adjustment for External Mergesort | 1997 | VLDB |
| 8 | 678 | Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort | 2010 | SIGMOD |
| 9 | 712 | Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture | 2008 | VLDB |
| 10 | 4,177 | SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures | 2015 | VLDB |