Patience is a virtue: Revisiting merge and sort on modern processors

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2014, Pages 731-742

  Chandramouli, Badrish ^a   Goldstein, Jonathan ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Merging; Patience; Performance; Replacement selection; Sorting

Indexed keywords

SORTING;

ARCHITECTURAL INNOVATION; DATA CENTERS; KEY MODIFICATIONS; MODERN PROCESSORS; PATIENCE; PERFORMANCE; REPLACEMENT SELECTIONS; SORTING TECHNIQUES;

MERGING;

EID: 84904341179     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2588555.2593662     Document Type: Conference Paper

References (24)

1. David Aldous and Persi Diaconis. Longest increasing subsequences: from Patience sorting to the Baik-Deift-Johansson theorem. Bull. of the Amer. Math. Society, Vol. 36, No. 4, pages 413-432.
2. Sergei Bespamyatnikh and Michael Segal. Enumerating Longest Increasing Subsequences and Patience Sorting. Pacific Inst. for the Math. Sci. Preprints, PIMS-99-3., pp.7-8.
3. C. L. Mallows. "Problem 62-2, Patience Sorting". SIAM Review 4 (1962), 148-149.
4. Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter: Efficient Sorting Using Registers and Caches. ACM Journal of Experimental Algorithmics 7: 9 (2002).
5. P. Gopalan et al. Estimating the Sortedness of a Data Stream. In SODA 2007.
6. A. LaMarca and R.E. Ladner. The influence of caches on the performance of sorting. Volume 7 (1997), pp. 370-379.
7. B. Chandramouli, J. Goldstein, and S. Duan. Temporal Analytics on Big Data for Web Advertising. In ICDE 2012.
8. TimSort. http://en.wikipedia.org/wiki/Timsort.
9. Sorting Algorithms. http://en.wikipedia.org/wiki/ Sort-algorithms
10. R. Sedgewick. Implementing Quicksort programs. Comm. ACM 21 (10): 847-857.
11. GNU Quicksort Implementation. http://aka.ms/X5ho47.
12. Patience Sorting. http://en.wikipedia.org/wiki/ Patience-sorting.
13. Donald Knuth. The Art of Computer Programming, Sorting and Searching, Volume 3, 1998.
14. C.A.R. Hoare. Quicksort. Computer J. 5, 4, April 1962.
15. C.L. Mallows. Patience sorting. Bull. Inst. Math. Appl., 9:216-224, 1973.
16. J.M. Hammersley. A few seedlings of research. In Proc. Sixth Berkeley Symp. Math. Statist. and Probability, Volume 1, pages 345-394. University of California Press, 1972.
17. M. Kaufmann et al. Timeline Index: A Unified Data Structure for Processing Queries on Temporal Data in SAP HANA. In SIGMOD, 2013.
18. Splunk. http://www.splunk.com/.
19. K. E. Batcher. Sorting networks and their applications. In Spring Joint Computer Conference, pages 307-314, 1968.
20. J. Chhugani et al. Efficient Implementation of Sorting on MultiCore SIMD CPU Architecture. In VLDB, 2008.
21. P. Larson. External Sorting: Run Formation Revisited. IEEE Trans. Knowl. Data Eng. 15(4): 961-972 (2003).
22. C. Balkesen et al. Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited. In VLDB, 2014.
23. M.-C. Albutiu et al. Massively parallel sort-merge joins in main memory multi-core database systems. In VLDB, 2012.
24. C. Kim et al. Sort vs. hash revisited: Fast join implementation on modern multi-core CPUs. In VLDB, 2009.