{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T19:54:59Z","timestamp":1773258899479,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319079585","type":"print"},{"value":"9783319079592","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_12","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"138-149","source":"Crossref","is-referenced-by-count":12,"title":["Retrieval and Perfect Hashing Using Fingerprinting"],"prefix":"10.1007","author":[{"given":"Ingo","family":"M\u00fcller","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Schulze","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-642-04128-0_61","volume-title":"Algorithms - ESA 2009","author":"D. Belazzougui","year":"2009","unstructured":"Belazzougui, D., Botelho, F.C., Dietzfelbinger, M.: Hash, displace, and compress. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 682\u2013693. Springer, Heidelberg (2009)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-73951-7_13","volume-title":"Algorithms and Data Structures","author":"F.C. Botelho","year":"2007","unstructured":"Botelho, F.C., Pagh, R., Ziviani, N.: Simple and space-efficient minimal perfect hash functions. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 139\u2013150. Springer, Heidelberg (2007)"},{"key":"12_CR3","first-page":"653","volume-title":"16th ACM Conference on Information and Knowledge Management","author":"F.C. Botelho","year":"2007","unstructured":"Botelho, F.C., Ziviani, N.: External perfect hashing for very large key sets. In: 16th ACM Conference on Information and Knowledge Management, pp. 653\u2013662. ACM, New York (2007)"},{"key":"12_CR4","unstructured":"de Castro Reis, D., Belazzougui, D., Botelho, F.C., Ziviani, N.: CMPH \u2013 C Minimal Perfect Hashing Library, http:\/\/cmph.sf.net"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11682462_34","volume-title":"LATIN 2006: Theoretical Informatics","author":"E.D. Demaine","year":"2006","unstructured":"Demaine, E.D., der Heide, F.M.A., Pagh, R., P\u01cetra\u015fcu, M.: De dictionariis dynamicis pauco spatio utentibus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 349\u2013361. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2007.02.054","volume":"380","author":"M. Dietzfelbinger","year":"2007","unstructured":"Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theoret. Comput. Sci.\u00a0380(1-2), 47\u201368 (2007), http:\/\/dx.doi.org\/10.1016\/j.tcs.2007.02.054","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-74871-7_2","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"M. Dietzfelbinger","year":"2007","unstructured":"Dietzfelbinger, M.: Design strategies for minimal perfect hash functions. In: Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol.\u00a04665, pp. 2\u201317. Springer, Heidelberg (2007), http:\/\/dx.doi.org\/10.1007\/978-3-540-74871-7_2"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70575-8_32","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2008","unstructured":"Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership (Extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 385\u2013396. Springer, Heidelberg (2008)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-540-70545-1_50","volume-title":"Computer Aided Verification","author":"S. Edelkamp","year":"2008","unstructured":"Edelkamp, S., Sanders, P., \u0160ime\u010dek, P.: Semi-external LTL model checking. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 530\u2013542. Springer, Heidelberg (2008)"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TKDE.2010.132","volume":"23","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M.: Straggler identification in round-trip data streams via newton\u2019s identities and invertible Bloom filters. IEEE Trans. Knowl. Data Eng.\u00a023(2), 297\u2013306 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M.: Cuckoo filter: Better than bloom. Login\u00a038(4) (2013)","DOI":"10.1145\/2674005.2674994"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2094114.2094126","volume":"40","author":"F. F\u00e4rber","year":"2012","unstructured":"F\u00e4rber, F., et al.: SAP HANA Database: Data management for modern business applications. SIGMOD Rec.\u00a040(4), 45\u201351 (2012), http:\/\/doi.acm.org\/10.1145\/2094114.2094126","journal-title":"SIGMOD Rec."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-72845-0_16","volume-title":"Experimental Algorithms","author":"K. Fredriksson","year":"2007","unstructured":"Fredriksson, K., Nikitin, F.: Simple compression code supporting random access and fast string matching. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 203\u2013216. Springer, Heidelberg (2007)"},{"key":"12_CR14","unstructured":"Google: Google books Ngram Viewer, http:\/\/storage.googleapis.com\/books\/ngrams\/books\/datasetsv2.html"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44693-1_28","volume-title":"STACS 2001","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 317\u2013326. Springer, Heidelberg (2001)"},{"key":"12_CR16","unstructured":"Jenkins, B.: Algorithm alley: Hash functions. Dr. Dobb\u2019s Journal (1997)"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev.\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"12_CR18","first-page":"173","volume-title":"ALENEX","author":"H. Lim","year":"2013","unstructured":"Lim, H., Andersen, D.G., Kaminsky, M.: Practical batch-updatable external hashing with sorting. In: ALENEX, pp. 173\u2013182. SIAM, Philadelphia (2013)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-30850-5_26","volume-title":"Experimental Algorithms","author":"G. Navarro","year":"2012","unstructured":"Navarro, G., Providel, E.: Fast, small, simple rank\/select on bitmaps. In: Klasing, R. (ed.) SEA 2012. LNCS, vol.\u00a07276, pp. 295\u2013306. Springer, Heidelberg (2012)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-23397-5_16","volume-title":"Euro-Par 2011 Parallel Processing","author":"J. Wassenberg","year":"2011","unstructured":"Wassenberg, J., Sanders, P.: Engineering a multi-core radix sort. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part II. LNCS, vol.\u00a06853, pp. 160\u2013169. Springer, Heidelberg (2011)"},{"key":"12_CR21","unstructured":"Zhou, W.: A Compact Cache-Efficient Function Store with Constant Evaluation Time. Bachelor thesis, KIT and SAP (2013)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T12:32:27Z","timestamp":1649334747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}