{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:38Z","timestamp":1760202518399,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_11","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"91-102","source":"Crossref","is-referenced-by-count":18,"title":["Cache-Conscious Collision Resolution in String Hash Tables"],"prefix":"10.1007","author":[{"given":"Nikolas","family":"Askitis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Zobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/12.381947","volume":"44","author":"J. Baer","year":"1995","unstructured":"Baer, J., Chen, T.: Effective hardware-based data prefetching for high-performance processors. IEEE Transactions on Computers\u00a044(5), 609\u2013623 (1995)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/106972.106979","volume-title":"Proc. ASPLOS Int. Conf. on Architectural Support for Programming Languages and Operating Systems","author":"D. Callahan","year":"1991","unstructured":"Callahan, D., Kennedy, K., Porterfield, A.: Software prefetching. In: Proc. ASPLOS Int. Conf. on Architectural Support for Programming Languages and Operating Systems, pp. 40\u201352. ACM Press, New York (1991)"},{"key":"11_CR4","first-page":"1","volume-title":"Proc. ACM SIGPLAN conf. on Programming Language Design and Implementation","author":"T.M. Chilimbi","year":"1999","unstructured":"Chilimbi, T.M., Hill, M.D., Larus, J.R.: Cache-conscious structure layout. In: Proc. ACM SIGPLAN conf. on Programming Language Design and Implementation, pp. 1\u201312. ACM Press, New York (1999)"},{"key":"11_CR5","first-page":"62","volume-title":"Proc. Annual ACM\/IEEE MICRO Int. Symp. on Microarchitecture","author":"J. Collins","year":"2002","unstructured":"Collins, J., Sair, S., Calder, B., Tullsen, D.M.: Pointer cache assisted prefetching. In: Proc. Annual ACM\/IEEE MICRO Int. Symp. on Microarchitecture, pp. 62\u201373. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"1-2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/144965.145006","volume":"23","author":"J.W.C. Fu","year":"1992","unstructured":"Fu, J.W.C., Patel, J.H., Janssens, B.L.: Stride directed prefetching in scalar processors. SIGMICRO Newsletter\u00a023(1-2), 102\u2013110 (1992)","journal-title":"SIGMICRO Newsletter"},{"issue":"7","key":"11_CR7","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1145\/359545.359560","volume":"21","author":"C. Halatsis","year":"1978","unstructured":"Halatsis, C., Philokyprou, G.: Pseudochaining in hash tables. Communications of the ACM\u00a021(7), 554\u2013557 (1978)","journal-title":"Communications of the ACM"},{"key":"11_CR8","first-page":"271","volume-title":"Information Processing & Management","author":"D. Harman","year":"1995","unstructured":"Harman, D.: Overview of the second text retrieval conference (TREC-2). In: Information Processing & Management, pp. 271\u2013289. Pergamon Press, Inc., Oxford (1995)"},{"key":"11_CR9","unstructured":"Heileman, G.L., Luo, W.: How caching affects hashing. In: Proc. ALENEX Workshop on Algorithm Engineering and Experiments (January 2005)"},{"issue":"10","key":"11_CR10","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1002\/spe.394","volume":"31","author":"S. Heinz","year":"2001","unstructured":"Heinz, S., Zobel, J., Williams, H.E.: Self-adjusting trees in practice for large text collections. Software\u2014Practice and Experience\u00a031(10), 925\u2013939 (2001)","journal-title":"Software\u2014Practice and Experience"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Karlsson, M., Dahlgren, F., Stenstrom, P.: A prefetching technique for irregular accesses to linked data structures. In: Proc. Symp. on High-Performance Computer Architecture, January 2000, pp. 206\u2013217 (2000)","DOI":"10.1109\/HPCA.2000.824351"},{"key":"11_CR12","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn., vol.\u00a03. Addison-Wesley Longman, Amsterdam (1998)","edition":"2"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1145\/319758.319763","volume":"7","author":"P. Larson","year":"1982","unstructured":"Larson, P.: Performance analysis of linear hashing with partial expansions. ACM Transactions on Database Systems\u00a07(4), 566\u2013587 (1982)","journal-title":"ACM Transactions on Database Systems"},{"key":"11_CR14","first-page":"247","volume-title":"Proc. SIGCSE Technical Symp. on Computer Science Education","author":"A.R. Lebeck","year":"1999","unstructured":"Lebeck, A.R.: Cache conscious programming in undergraduate computer science. In: Proc. SIGCSE Technical Symp. on Computer Science Education, pp. 247\u2013251. ACM Press, New York (1999)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1287\/opre.13.4.609","volume":"13","author":"J. McCabe","year":"1965","unstructured":"McCabe, J.: On serial files with relocatable records. Operations Research\u00a013, 609\u2013618 (1965)","journal-title":"Operations Research"},{"key":"11_CR16","first-page":"601","volume-title":"Proc. ACM Fall Joint Computer Conf.","author":"J.I. Munro","year":"1986","unstructured":"Munro, J.I., Celis, P.: Techniques for collision resolution in hash tables with open addressing. In: Proc. ACM Fall Joint Computer Conf., pp. 601\u2013610. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1147\/rd.12.0130","volume":"1","author":"W.W. Peterson","year":"1957","unstructured":"Peterson, W.W.: Open addressing. IBM J. Research & Development\u00a01, 130\u2013146 (1957)","journal-title":"IBM J. Research & Development"},{"key":"11_CR18","first-page":"215","volume-title":"Proc. DASFAA Symp. on Databases Systems for Advanced Applications","author":"M.V. Ramakrishna","year":"1997","unstructured":"Ramakrishna, M.V., Zobel, J.: Performance in practice of string hashing functions. In: Proc. DASFAA Symp. on Databases Systems for Advanced Applications, vol.\u00a06, pp. 215\u2013224. World Scientific, Singapore (1997)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/99412.99462","volume-title":"Proc. ACM SIGSMALL\/PC Symp. on Small Systems","author":"A. Rathi","year":"1990","unstructured":"Rathi, A., Lu, H., Hedrick, G.E.: Performance comparison of extendible hashing and linear hashing techniques. In: Proc. ACM SIGSMALL\/PC Symp. on Small Systems, pp. 178\u2013185. ACM Press, New York (1990)"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/322003.322006","volume":"24","author":"A.L. Rosenberg","year":"1977","unstructured":"Rosenberg, A.L., Stockmeyer, L.J.: Hashing schemes for extendible arrays. Jour. of the ACM\u00a024(2), 199\u2013221 (1977)","journal-title":"Jour. of the ACM"},{"key":"11_CR21","first-page":"111","volume-title":"Proc. Int. Symp. on Computer Architecture","author":"A. Roth","year":"1999","unstructured":"Roth, A., Sohi, G.S.: Effective jump-pointer prefetching for linked data structures. In: Proc. Int. Symp. on Computer Architecture, pp. 111\u2013121. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(80)90122-2","volume":"10","author":"D.V. Sarwate","year":"1980","unstructured":"Sarwate, D.V.: A note on universal classes of hash functions. Information Processing Letters\u00a010(1), 41\u201345 (1980)","journal-title":"Information Processing Letters"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Sinha, R., Ring, D., Zobel, J.: Cache-efficient string sorting using copying. In: submission","DOI":"10.1145\/1187436.1187439"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Sinha, R., Zobel, J.: Cache-conscious sorting of large sets of strings with dynamic tries. ACM Jour. of Exp. Algorithmics\u00a09 (2005)","DOI":"10.1145\/1005813.1041517"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/322374.322375","volume":"30","author":"J.S. Vitter","year":"1983","unstructured":"Vitter, J.S.: Analysis of the search performance of coalesced hashing. Jour. of the ACM\u00a030(2), 231\u2013258 (1983)","journal-title":"Jour. of the ACM"},{"issue":"4","key":"11_CR26","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/1044823.1044827","volume":"1","author":"C. Yang","year":"2004","unstructured":"Yang, C., Lebeck, A.R., Tseng, H., Lee, C.: Tolerating memory latency through push prefetching for pointer-intensive applications. ACM Trans. Architecture Code Optimisation\u00a01(4), 445\u2013475 (2004)","journal-title":"ACM Trans. Architecture Code Optimisation"},{"issue":"6","key":"11_CR27","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0020-0190(01)00239-3","volume":"80","author":"J. Zobel","year":"2001","unstructured":"Zobel, J., Williams, H.E., Heinz, S.: In-memory hash tables for accumulating text vocabularies. Information Processing Letters\u00a080(6), 271\u2013277 (2001)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:46:01Z","timestamp":1736030761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11575832_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}