Permuting Data on Random-Access Block Storage
Summary: New permutation algorithms for enormous data on random-block storage (SSD/KV stores) that exploit fast random I/O. Lower memory and faster than external merge sort, tackling read–write cost asymmetry and arbitrary dimension sizes for a broad class of permutations. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Risi Thonangi (Duke University)
- 2. Jun Yang (Duke University)
BibTeX Citation
@article{thonangi_vldb13,
title = {{Permuting Data on Random-Access Block Storage}},
author = {Thonangi, Risi and Yang, Jun},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {9},
pages = {721--732},
doi = {10.14778/2536360.2536363},
url = {https://doi.org/10.14778/2536360.2536363},
year = {2013}
}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 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 |
|---|---|---|---|---|
| 214 | On the Computation of Multidimensional Aggregates | 1996 | VLDB | 0.00024656893 |
| 323 | An Array-Based Algorithm for Simultaneous Multidimensional Aggregates | 1997 | SIGMOD | 0.0002100085 |
| 661 | Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort | 2010 | SIGMOD | 0.00015003815 |
| 1,068 | Fast Computation of Sparse Datacubes | 1997 | VLDB | 0.00012185465 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,225 | SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures | 2015 | VLDB |
| 2 | 12,328 | A Study of Sorting Algorithms on Approximate Memory | 2016 | SIGMOD |
| 3 | 2,487 | A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs | 2017 | SIGMOD |
| 4 | 1,774 | ArrayStore: A Storage Manager for Complex Parallel Array Processing | 2011 | SIGMOD |
| 5 | 4,065 | PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort | 2015 | VLDB |
| 6 | 3,639 | Efficient Bulk Insertion into a Distributed Ordered Table | 2008 | SIGMOD |
| 7 | 1,471 | Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems | 2004 | VLDB |
| 8 | 2,038 | Write-limited sorts and joins for persistent memory | 2014 | VLDB |
| 9 | 1,116 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD |
| 10 | 4,886 | Permutation Search Methods are Efficient, Yet Faster Search is Possible | 2015 | VLDB |