Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 379-388

  Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

data oblivious algorithms; external memory; sorting

Indexed keywords

DATA ACCESS PATTERNS; DATA STORAGE; DATA-OBLIVIOUS ALGORITHMS; EXTERNAL MEMORY; EXTERNAL MEMORY ALGORITHMS; HIGH PROBABILITY;

ALGORITHMS; COMPACTION; MEMORY ARCHITECTURE;

SORTING;

EID: 79959681766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989555     Document Type: Conference Paper

References (28)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31:1116-1127, 1988. (Pubitemid 18662481) (Pubitemid 18662481)
2. M. Ajtai, J. Komlós, and E. Szemerédi. An O(n log n) sorting network. In Proc. 15th Annu. ACM Sympos. Theory Comput., pages 1-9, 1983.
3. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In 1st ACM Conf. on Computer and Communications Security (CCS), pages 62-73, 1993.
4. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. SIAM J. Comput., 35(2):341-358, 2005.
5. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
6. G. S. Brodal. Cache-oblivious algorithms and data structures. In T. Hagerup and J. Katajainen, editors, SWAT, volume 3111 of LNCS, pages 3-13. Springer, 2004.
7. G. Chaudhry and T. H. Cormen. Oblivious vs. distribution-based sorting: An experimental evaluation. In G. S. Brodal and S. Leonardi, editors, ESA, volume 3669 of LNCS, pages 317-328. Springer, 2005.
8. G. Chaudhry and T. H. Cormen. Slabpose columnsort: A new oblivious algorithm for out-of-core sorting on distributed-memory clusters. Algorithmica, 45(3):483-508, 2006. (Pubitemid 43876800) (Pubitemid 43876800)
9. S. Chen, R. Wang, X. Wang, and K. Zhang. Side-channel leaks in web applications: a reality today, a challenge tomorrow. In Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010.
10. D. Eppstein and M. T. Goodrich. Straggler identification in round-trip data streams via Newton's identities and invertible Bloom filters. IEEE Transactions on Knowledge and Data Engineering, 23:297-306, 2011.
11. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th IEEE Symp. on Foundations of Computer Science (FOCS), page 285, 1999.
12. M. Ghouse and M. T. Goodrich. Fast randomized parallel methods for planar convex hull construction. Comput. Geom. Theory Appl., 7:219-236, 1997.
13. O. Goldreich, S. Micali, and A. Wigderson. How to play ANY mental game. In STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 218-229, New York, NY, USA, 1987. ACM.
14. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. J. ACM, 43(3):431-473, 1996.
15. M. T. Goodrich. Randomized Shellsort: A simple oblivious sorting algorithm. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-16. SIAM, 2010.
16. M. T. Goodrich and M. Mitzenmacher. MapReduce parallel cuckoo hashing and oblivious RAM simulations. CoRR, abs/1007.1259, 2010.
17. M. T. Goodrich and M. Mitzenmacher. Invertible Bloom lookup tables. ArXiv e-prints, January 2011. 1101.2245.
18. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, Mar. 1963.
19. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.
20. D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 3rd edition, 1998.
21. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan-Kaufmann, San Mateo, CA, 1992.
22. F. T. Leighton, Y. Ma, and T. Suel. On probabilistic networks for selection, merging, and sorting. Theory Comput. Syst., 30(6):559-582, 1997.
23. T. Leighton and C. G. Plaxton. Hypercubic sorting networks. SIAM J. Comput., 27(1):1-47, 1998.
24. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In 10th European Symposium on Algorithms (ESA), pages 723-735, 2002.
25. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York, NY, USA, 2005.
26. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.
27. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In 13th ACM Symposium on Theory of Computing (STOC), pages 263-277, 1981.
28. G. Wang, T. Luo, M. T. Goodrich, W. Du, and Z. Zhu. Bureaucratic protocols for secure two-party sorting, selection, and permuting. In 5th ACM Symp. on Information, Computer and Comm. Security (ASIACCS), pages 226-237, 2010.