DBScholar

Back to papers

Hyper Dimension Shuffle: Efficient Data Repartition at Petabyte Scale in SCOPE

Summary: Hyper Dimension Shuffle introduces a recursive, divide-and-conquer shuffle for petabyte-scale data in SCOPE. Recursive partitioning with intermediate aggregations yields quasilinear shuffling complexity and tight fan-out/fan-in guarantees, avoiding prior quadratic blowups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11998
Venue
VLDB
Year
2019
Pagerank
6.9855158e-05
Overall Rank
3,964 | 72.81%
DOI
10.14778/3339490.3339495

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{qiao_vldb19,
        title = {{Hyper Dimension Shuffle: Efficient Data Repartition at Petabyte Scale in SCOPE}},
        author = {Qiao, Shi and Nicoara, Adrian and Sun, Jin and Friedman, Marc and Patel, Hiren and Ekanayake, Jaliya},
        journal = {PVLDB},
        series = {{VLDB} '19},
        volume = {12},
        number = {10},
        pages = {1113--1125},
        doi = {10.14778/3339490.3339495},
        url = {https://doi.org/10.14778/3339490.3339495},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 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