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
- 2. Jun Yang
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 |
|---|---|---|---|---|
| 247 | On the Computation of Multidimensional Aggregates | 1996 | VLDB | 0.00030923842 |
| 368 | An Array-Based Algorithm for Simultaneous Multidimensional Aggregates | 1997 | SIGMOD | 0.00025508459 |
| 932 | Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort | 2010 | SIGMOD | 0.00015227954 |
| 1,193 | Fast Computation of Sparse Datacubes | 1997 | VLDB | 0.00013412915 |
Previous
Page 1 / 1
Next