Relaxing the problem-size bound for out-of-core columnsort
By G. Chaudhry, E. A. Hamon, T. Cormen. 2003
7 citations recorded by the source corpus.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Badih Ghazi
- Ú. Erlingsson
- Peter Kairouz
- Albert Cheu
- Ilya Mironov
- Borja Balle
- Andrea Bittau
- Ananth Raghunathan
Citations in the corpus
- Prochlo: Strong Privacy for Analytics in the Crowd (2017, background): “[44]. Opaque uses SGX-based ColumnSort for private-data analytics [78]. Unfortunately, any system based on ColumnSort has a maximum problem size that is induced by the permachine private-memory limit [14]. Thus, while ColumnSort’s overhead is only 8 the dataset size, it can at most sort 118 million ”
- PROCHLO: Strong Privacy for Analytics in the Crowd (2017, background): “Unfortunately, any system based on ColumnSort has a maximum problem size that is induced by the permachine private-memory limit [14].”