Cache-conscious sorting of large sets of strings with dynamic tries

ACM Journal of Experimental Algorithmics

Volumn 9, Issue , 2004, Pages

  Sinha, Ranjan ^a   Zobel, Justin ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

B.3.2 memory structures : cache memories; D.1.0 programming techniques : general; E.1 data structures : trees; E.5 files : sorting; F.2.2 analysis of algorithms : sorting

Indexed keywords

EID: 34547356049     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1005813.1041517     Document Type: Article

References (21)

1. ANDERSSON, A. AND NILSSON, S. 1994. A new efficient radix sort. In IEEE Symposium on the Foundations of Computer Science. IEEE Computer Society, Santa Fe, NM. 714-721.
2. ANDERSSON, A. AND NILSSON, S. 1998. Implementing radixsort. ACM J. Exp. Algorithmics 3, 7.
3. th Annual ACM Symposium on Theory of Computing. ACM Press, El Paso. 540-548.
4. BENTLEY, J. AND SEDGEWICK, R. 1997. Fast algorithms for sorting and searching strings. In Proceedings of Annual ACM-SIAM Symposium on Discrete Algorithms. ACM/SIAM, New Orleans, LA, 360-369.
5. BENTLEY, J. L. AND MCILROY, M. D. 1993. Engineering a sort function. Software - Practice and Experience 23, 11, 1249-1265.
6. HARMAN, D. 1995. Overview of the second text retrieval conference (TREC-2). Information Processing & Management 31, 3, 271-289.
7. HAWKING, D., CRASWELL, N., THISTLEWAITE, P., AND HARMAN, D. 1999. Results and challenges in web search evaluation. In Proceedings of World-Wide Web Conference. Elsevier North-Holland, Toronto.
8. HEINZ, S. AND ZOBEL, J. 2002. Practical data structures for managing small sets of strings. In Proceedings of Australasian Computer Science Conference, M. Oudshoorn, Ed. Australian Computer Society, Melbourne, 75-84.
9. HEINZ, S., ZOBEL, J., AND WILLIAMS, H. E. 2002. Burst tries: A fast, efficient data structure for string keys. ACM Trans. Inf. Syst. 20, 2, 192-223.
10. HOARE, C. A. R. 1962. Quicksort. Comput. J. 5, 1, 10-15.
11. th DIMACS Implementation Challenges, M. H. Goldwasser, D. S. Johnson, and C. C. McGeoch, Eds. American Mathematical Society, Providence, RI.
12. LAMARCA, A. AND LADNER, R. E. 1997. The influence of caches on the performance of sorting. In Proceedings of Annual ACM-SIAM Symposium on Discrete Algorithms. ACM Press, New Orleans, LA, 370-379.
13. MCILROY, P. M., BOSTIC, K., AND MCILROY, M. D. 1993. Engineering radix sort. Comput. Syst. 6, 1, 5-27.
14. MOFFAT, A., EDDY, G., AND PETERSSON, O. 1996. Splaysort: Fast, versatile, practical. Software - Practice and Experience 26, 7, 781-797.
15. NILSSON, S. 1996. Radix sorting & searching. Ph.D. Thesis, Department of Computer Science, Lund, Sweden.
16. RAHMAN, N. AND RAMAN, R. 2000. Analysing cache effects in distribution sorting. ACM J. Exp. Algorithmics 5, 14.
17. RAHMAN, N. AND RAMAN, R. 2001. Adapting radix sort to the memory hierarchy. ACM J. Exp. Algorithmics 6, 7.
18. rd ed. Addison-Wesley Longman, Reading, MA.
19. SEWARD, J. 2001. Valgrind - memory and cache profiler. http://developer.kde.org/~sewardj/docs-1.9.5/cg-techdocs.html.
20. SINHA, R. 2002. Fast sorting of strings with dynamic tries. Minor Thesis, School of Computer Science and Information Technology, RMIT University.
21. XIAO, L., ZHANG, X., AND KUBRICHT, S. A. 2000. Improving memory performance of sorting algorithms. ACM J. Exp. Algorithmics 5, 3.