Using random sampling to build approximate tries for efficient string sorting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3059, Issue , 2004, Pages 529-544

  Sinha, Ranjan ^a   Zobel, Justin ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

CACHE-EFFICIENT; INSTRUCTION COUNTS; LARGE DATASETS; MEMORY ACCESS; MEMORY HIERARCHY; PATHOLOGICAL CASE; RANDOM SAMPLING; STRING SORTING;

ALGORITHMS;

EID: 35048858381     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_39     Document Type: Article

References (17)

1. A. Andersson and S. Nilsson. Implementing radixsort. ACM Jour, of Experimental Algorithmics, 3(7), 1998.
2. Lars Arge, Paolo Ferragina, Roberto Grossi, and Jeffrey Scott Vitter. On sorting strings in external memory. In Proceedings of the 29th Annual ACM Symposium, on Theory of Computing, pages 540-548, El Paso, 1997. ACM Press.
3. J. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. In Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, pages 360-369, New Orleans, Louisiana, 1997. AGM/SIAM.
4. Rajiv Gupta, Scott A. Smolka, and Shaji Bhaskar. On randomization in sequential and distributed algorithms. ACM Computing Surveys, 26(l):7-86, 1994.
5. D. Harman. Overview of the second text retrieval conference (TREC-2). Information Processing & Management, 31(3):271-289, 1995.
6. D. Hawking, N. Craswell, P. Thistlewaite, and D. Harman. Results and challenges in web search evaluation. In Proc. World- Wide Web Conference, 1999.
7. S. Heinz, J. Zobel, and H. E. Williams. Burst tries: A fast, efficient data structure for string keys. ACM Transactions on Information Systems, 20(2):192-223, 2002.
8. A. LaMarca and R. E. Ladner. The influence of caches on the performance of sorting. In Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, pages 370-379. ACM Press, 1997.
9. P. M. Mcllroy, K. Bostic, and M. D. Mcllroy. Engineering radix sort. Computing Systems, 6(l):5-27, 1993.
10. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
11. S. Nilsson. Radix Sorting & Searching. PhD thesis, Department of Computer Science, Lund, Sweden, 1996.
12. F. Olken and D. Rotem. Random sampling from databases - a survey. Statistics and Computing, 5(l):25-42, March 1995.
13. N. Rahman and R. Raman. Adapting radix sort to the memory hierarchy. ACM Jour, of Experimental Algorithmics, 6(7), 2001.
14. J. Seward. Valgrind-memory and cache profiler, 2001. http://developer. kde.org/~sewardj/docs-1.9.5/cg_techdocs.html.
15. R. Sinha and J. Zobel. Cache-conscious sorting of large sets of strings with dynamic tries. In R. Ladner, editor, 5th ALENEX Workshop on Algorithm Engineering and Experiments, pages 93-105, Baltimore, Maryland, January 2003.
16. R. Sinha and J. Zobel. Efficient trie-based sorting of large sets of strings. In M. Oudshoorn, editor, Proceedings of the Australasian Computer Science Conference, pages 11-18, Adelaide, Australia, February 2003.
17. L. Xiao, X. Zhang, and S. A. Kubricht. Improving memory performance of sorting algorithms. ACM Jour, of Experimental Algorithmics, 5:3, 2000.