{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:41Z","timestamp":1725562601130},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220671"},{"type":"electronic","value":"9783540248385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24838-5_39","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T21:34:14Z","timestamp":1281303254000},"page":"529-544","source":"Crossref","is-referenced-by-count":2,"title":["Using Random Sampling to Build Approximate Tries for Efficient String Sorting"],"prefix":"10.1007","author":[{"given":"Ranjan","family":"Sinha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Zobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, A., Nilsson, S.: Implementing radixsort. ACM Jour. of Experimental Algorithmics 3(7) (1998)","DOI":"10.1145\/297096.297136"},{"key":"39_CR2","first-page":"540","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing","author":"L. Arge","year":"1997","unstructured":"Arge, L., Ferragina, P., Grossi, R., Vitter, J.S.: On sorting strings in external memory. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, pp. 540\u2013548. ACM Press, New York (1997)"},{"key":"39_CR3","unstructured":"Bentley, J., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, New Orleans, Louisiana, pp. 360\u2013369. ACM\/SIAM (1997)"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/174666.174667","volume":"26","author":"R. Gupta","year":"1994","unstructured":"Gupta, R., Smolka, S.A., Bhaskar, S.: On randomization in sequential and distributed algorithms. ACM Computing Surveys\u00a026(1), 7\u201386 (1994)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"39_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0306-4573(94)00047-7","volume":"31","author":"D. Harman","year":"1995","unstructured":"Harman, D.: Overview of the second text retrieval conference (TREC-2). Information Processing & Management\u00a031(3), 271\u2013289 (1995)","journal-title":"Information Processing & Management"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Hawking, D., Craswell, N., Thistlewaite, P., Harman, D.: Results and challenges in web search evaluation. In: Proc. World-Wide Web Conference (1999)","DOI":"10.1016\/S1389-1286(99)00024-9"},{"issue":"2","key":"39_CR7","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/506309.506312","volume":"20","author":"S. Heinz","year":"2002","unstructured":"Heinz, S., Zobel, J., Williams, H.E.: Burst tries: A fast, efficient data structure for string keys. ACM Transactions on Information Systems\u00a020(2), 192\u2013223 (2002)","journal-title":"ACM Transactions on Information Systems"},{"key":"39_CR8","first-page":"370","volume-title":"Proc. Annual ACM-SIAM Symp. on Discrete Algorithms","author":"A. LaMarca","year":"1997","unstructured":"LaMarca, A., Ladner, R.E.: The influence of caches on the performance of sorting. In: Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 370\u2013379. ACM Press, New York (1997)"},{"issue":"1","key":"39_CR9","first-page":"5","volume":"6","author":"P.M. McIlroy","year":"1993","unstructured":"McIlroy, P.M., Bostic, K., McIlroy, M.D.: Engineering radix sort. Computing Systems\u00a06(1), 5\u201327 (1993)","journal-title":"Computing Systems"},{"key":"39_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"39_CR11","unstructured":"Nilsson, S.: Radix Sorting & Searching. PhD thesis, Department of Computer Science, Lund, Sweden (1996)"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF00140664","volume":"5","author":"F. Olken","year":"1995","unstructured":"Olken, F., Rotem, D.: Random sampling from databases - a survey. Statistics and Computing\u00a05(1), 25\u201342 (1995)","journal-title":"Statistics and Computing"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Rahman, N., Raman, R.: Adapting radix sort to the memory hierarchy. ACM Jour. of Experimental Algorithmics 6(7) (2001)","DOI":"10.1145\/945394.945401"},{"key":"39_CR14","unstructured":"Seward, J.: Valgrind\u2014memory and cache profiler (2001), http:\/\/developer.kde.org\/~sewardj\/docs-1.9.5\/cg_techdocs.html"},{"key":"39_CR15","unstructured":"Sinha, R., Zobel, J.: Cache-conscious sorting of large sets of strings with dynamic tries. In: Ladner, R. (ed.) 5th ALENEX Workshop on Algorithm Engineering and Experiments, Baltimore, Maryland, January 2003, pp. 93\u2013105 (2003)"},{"key":"39_CR16","unstructured":"Sinha, R., Zobel, J.: Efficient trie-based sorting of large sets of strings. In: Oudshoorn, M. (ed.) Proceedings of the Australasian Computer Science Conference, Adelaide, Australia, February 2003, pp. 11\u201318 (2003)"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/351827.384245","volume":"5","author":"L. Xiao","year":"2000","unstructured":"Xiao, L., Zhang, X., Kubricht, S.A.: Improving memory performance of sorting algorithms. ACM Jour. of Experimental Algorithmics\u00a05, 3 (2000)","journal-title":"ACM Jour. of Experimental Algorithmics"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24838-5_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:55Z","timestamp":1605761815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24838-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220671","9783540248385"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24838-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}