{"id":"https://openalex.org/W1968161494","doi":"https://doi.org/10.1137/110827831","title":"Linear Probing with 5-wise Independence","display_name":"Linear Probing with 5-wise Independence","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1968161494","doi":"https://doi.org/10.1137/110827831","mag":"1968161494"},"language":"en","primary_location":{"id":"doi:10.1137/110827831","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110827831","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085243083","display_name":"Anna Pagh","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anna Pagh","raw_affiliation_strings":["annao@itu.dk and pagh@itu.dk and milan@itu.dk#TAB#"],"affiliations":[{"raw_affiliation_string":"annao@itu.dk and pagh@itu.dk and milan@itu.dk#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014293815","display_name":"Rasmus Pagh","orcid":"https://orcid.org/0000-0002-1516-9306"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rasmus Pagh","raw_affiliation_strings":["IT-UNIVERSITY OF COPENHAGEN"],"affiliations":[{"raw_affiliation_string":"IT-UNIVERSITY OF COPENHAGEN","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064421371","display_name":"Milan Ru\u017ei\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Milan Ru\u017ei\u0107","raw_affiliation_strings":["IT-UNIVERSITY OF COPENHAGEN"],"affiliations":[{"raw_affiliation_string":"IT-UNIVERSITY OF COPENHAGEN","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085243083"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.761,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.86353272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"53","issue":"3","first_page":"547","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.8470268249511719},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.8050061464309692},{"id":"https://openalex.org/keywords/linear-hashing","display_name":"Linear hashing","score":0.7511783838272095},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.6171555519104004},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.6153240203857422},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6057771444320679},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.5691884160041809},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5631827712059021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5567060112953186},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.4979984760284424},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.4724688231945038},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4625188112258911},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45979827642440796},{"id":"https://openalex.org/keywords/rolling-hash","display_name":"Rolling hash","score":0.42994609475135803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35616713762283325},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3402239680290222},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3376828730106354},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1183195412158966}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8470268249511719},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.8050061464309692},{"id":"https://openalex.org/C36375716","wikidata":"https://www.wikidata.org/wiki/Q6553456","display_name":"Linear hashing","level":5,"score":0.7511783838272095},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.6171555519104004},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.6153240203857422},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6057771444320679},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.5691884160041809},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5631827712059021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5567060112953186},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.4979984760284424},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.4724688231945038},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4625188112258911},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45979827642440796},{"id":"https://openalex.org/C108546238","wikidata":"https://www.wikidata.org/wiki/Q4228982","display_name":"Rolling hash","level":5,"score":0.42994609475135803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35616713762283325},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3402239680290222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3376828730106354},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1183195412158966},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110827831","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110827831","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.7583","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itu.dk/people/pagh/papers/linear-sigest.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W21386869","https://openalex.org/W76038825","https://openalex.org/W89335556","https://openalex.org/W1551533237","https://openalex.org/W1600795850","https://openalex.org/W1814599000","https://openalex.org/W1851100088","https://openalex.org/W1977041160","https://openalex.org/W1982689753","https://openalex.org/W1985623009","https://openalex.org/W1993217935","https://openalex.org/W2014586253","https://openalex.org/W2026784425","https://openalex.org/W2052207834","https://openalex.org/W2071179368","https://openalex.org/W2121433887","https://openalex.org/W2166542473","https://openalex.org/W2912601938","https://openalex.org/W4253123289"],"related_works":["https://openalex.org/W2811247857","https://openalex.org/W2084899141","https://openalex.org/W3030563642","https://openalex.org/W2008682098","https://openalex.org/W1551533237","https://openalex.org/W2008159385","https://openalex.org/W2333289748","https://openalex.org/W2054549325","https://openalex.org/W2783286101","https://openalex.org/W4251536634"],"abstract_inverted_index":{"Hashing":[0],"with":[1,69,177],"linear":[2,93,102,178],"probing":[3,103],"dates":[4],"back":[5],"to":[6,65,92,134,150],"the":[7,12,29,38,59,86,140,159],"1950s":[8],"and":[9,52,71,76,119,125,165],"is":[10,148],"among":[11],"most":[13,30],"studied":[14],"algorithms":[15],"for":[16,175],"storing":[17],"(key,":[18],"value)":[19],"pairs.":[20],"In":[21],"recent":[22],"years":[23],"it":[24,36],"has":[25],"become":[26],"one":[27],"of":[28,40,62,88,161],"important":[31],"hash":[32,55,67,108,128,168],"table":[33],"organizations":[34],"since":[35],"uses":[37],"cache":[39],"modern":[41],"computers":[42],"very":[43],"well.":[44],"Unfortunately,":[45],"previous":[46],"analyses":[47],"rely":[48],"either":[49],"on":[50,58,82],"complicated":[51],"space":[53,164],"consuming":[54],"functions,":[56],"or":[57],"unrealistic":[60],"assumption":[61],"free":[63],"access":[64],"a":[66,105,163],"function":[68,73,109,169],"random":[70],"independent":[72,107,127],"values.":[74],"Carter":[75],"Wegman,":[77],"in":[78,98],"their":[79,90],"seminal":[80],"paper":[81,100],"universal":[83],"hashing,":[84],"raised":[85],"question":[87,160],"extending":[89],"analysis":[91],"probing.":[94,179],"However,":[95],"we":[96,143],"show":[97,144],"this":[99],"that":[101,123,145,170],"using":[104],"2-wise":[106],"may":[110,130],"have":[111,121],"expected":[112,136,153],"logarithmic":[113,135],"cost":[114],"per":[115,155],"operation.":[116,156],"Recently,":[117],"Ptra\u015fcu":[118],"Thorup":[120],"shown":[122],"3-":[124],"4-wise":[126],"functions":[129],"also":[131],"give":[132],"rise":[133],"query":[137],"time.":[138],"On":[139],"positive":[141],"side,":[142],"5-wise":[146],"independence":[147],"enough":[149],"ensure":[151],"constant":[152],"time":[154,166],"This":[157],"resolves":[158],"finding":[162],"efficient":[167],"provably":[171],"ensures":[172],"good":[173],"performance":[174],"hashing":[176]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}