{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:29:30Z","timestamp":1725514170496},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540685487"},{"type":"electronic","value":"9783540685524"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68552-4_3","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T09:06:43Z","timestamp":1211965603000},"page":"28-42","source":"Crossref","is-referenced-by-count":1,"title":["Comparing Integer Data Structures for 32 and 64 Bit Keys"],"prefix":"10.1007","author":[{"given":"Nicholas","family":"Nash","sequence":"first","affiliation":[]},{"given":"David","family":"Gregg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-48518-X_18","volume-title":"Algorithm Engineering and Experimentation","author":"A. Acharya","year":"1999","unstructured":"Acharya, A., Zhu, H., Shen, K.: Adaptive algorithms for cache-efficient trie search. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619, pp. 296\u2013311. Springer, Heidelberg (1999)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indices. Acta Inf.\u00a01, 173\u2013189 (1972)","journal-title":"Acta Inf."},{"issue":"5","key":"3_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v011.i05","volume":"11","author":"R.P. Brent","year":"2004","unstructured":"Brent, R.P.: Note on marsaglia\u2019s xorshift random number generators. Journal of Statistical Software\u00a011(5), 1\u20134 (2004)","journal-title":"Journal of Statistical Software"},{"key":"3_CR4","first-page":"273","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 273\u2013301. MIT Press, Cambridge, MA, USA (2001)","edition":"2"},{"key":"3_CR5","unstructured":"Dementiev, R., Kettner, L., Mehnert, J., Sanders, P.: Engineering a sorted list data structure for 32 bit keys. In: Proc. of the Sixth SIAM Workshop on Algorithm Engineering and Experiments, New Orleans, LA, USA, pp. 142\u2013151 (2004)"},{"key":"3_CR6","first-page":"289","volume-title":"IPDPS 2003: Proc. of the 17th International Symposium on Parallel and Distributed Processing","author":"J. Dongarra","year":"2003","unstructured":"Dongarra, J., London, K., Moore, S., Mucci, P., Terpstra, D., You, H., Zhou, M.: Experiences and lessons learned with a portable interface to hardware performance counters. In: IPDPS 2003: Proc. of the 17th International Symposium on Parallel and Distributed Processing, Washington, DC, USA, p. 289.2. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"2","key":"3_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 Trans. Inf. Syst.\u00a020(2), 192\u2013223 (2002)","journal-title":"ACM Trans. Inf. Syst."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/10719839_31","volume-title":"LATIN 2000: Theoretical Informatics","author":"C. Knessl","year":"2000","unstructured":"Knessl, C., Szpankowski, W.: Heights in generalized tries and patricia tries. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 298\u2013307. Springer, Heidelberg (2000)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Knessl, C., Szpankowski, W.: A note on the asymptotic behavior of the heights in b-tries for b large. Electr. J. Comb.\u00a07 (2000)","DOI":"10.37236\/1517"},{"key":"3_CR10","unstructured":"Knuth, D.E.: The Art Of Computer Programming. Sorting And Searching, 2nd edn., vol.\u00a03, pp. 458\u2013478, 482\u2013491, 506. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA (1998)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Korda, M., Raman, R.: An experimental evaluation of hybrid data structures for searching. In: Proc. of the 3rd International Workshop on Algorithm Engineering (WAE), London, UK, pp. 213\u2013227 (1999)","DOI":"10.1007\/3-540-48318-7_18"},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1273442.1250746","volume":"42","author":"N. Nethercote","year":"2007","unstructured":"Nethercote, N., Seward, J.: Valgrind: A framework for heavyweight dynamic binary instrumentation. SIGPLAN Not.\u00a042(6), 89\u2013100 (2007)","journal-title":"SIGPLAN Not."},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-001-0102-y","volume":"33","author":"S. Nilsson","year":"2002","unstructured":"Nilsson, S., Tikkanen, M.: An experimental study of compression methods for dynamic tries. Algorithmica\u00a033(1), 19\u201333 (2002)","journal-title":"Algorithmica"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/978-3-540-24838-5_38","volume-title":"Experimental and Efficient Algorithms","author":"R. Sinha","year":"2004","unstructured":"Sinha, R.: Using compact tries for cache-efficient sorting of integers. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 513\u2013528. Springer, Heidelberg (2004)"},{"key":"3_CR15","first-page":"1","volume":"11","author":"R. Sinha","year":"2006","unstructured":"Sinha, R., Ring, D., Zobel, J.: Cache-efficient string sorting using copying. J. Exp. Algorithmics\u00a011, 1.2 (2006)","journal-title":"J. Exp. Algorithmics"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1005813.1041517","volume":"9","author":"R. Sinha","year":"2004","unstructured":"Sinha, R., Zobel, J.: Cache-conscious sorting of large sets of strings with dynamic tries. J. Exp. Algorithmics\u00a09, 1.5 (2004)","journal-title":"J. Exp. Algorithmics"},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1064546.1180622","volume":"10","author":"R. Sinha","year":"2005","unstructured":"Sinha, R., Zobel, J.: Using random sampling to build approximate tries for efficient string sorting. J. Exp. Algorithmics\u00a010, 2.10 (2005)","journal-title":"J. Exp. Algorithmics"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"key":"3_CR19","volume-title":"The C++ Programming Language","author":"B. Stroustrup","year":"1997","unstructured":"Stroustrup, B.: The C++ Programming Language, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1997)","edition":"3"},{"issue":"5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/366552.366600","volume":"6","author":"E.H. Sussenguth","year":"1963","unstructured":"Sussenguth, E.H.: Use of tree structures for processing files. Commun. ACM\u00a06(5), 272\u2013279 (1963)","journal-title":"Commun. ACM"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett.\u00a06(3), 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0022-0000(84)90020-5","volume":"28","author":"D.E. Willard","year":"1984","unstructured":"Willard, D.E.: New trie data structures which support very fast search operations. J. Comput. Syst. Sci.\u00a028(3), 379\u2013394 (1984)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68552-4_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T06:15:03Z","timestamp":1631340903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68552-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540685487","9783540685524"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68552-4_3","relation":{},"subject":[]}}