{"id":"https://openalex.org/W76038825","doi":null,"title":"How Caching Affects Hashing.","display_name":"How Caching Affects Hashing.","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W76038825","mag":"76038825"},"language":"en","primary_location":{"id":"mag:76038825","doi":null,"is_oa":false,"landing_page_url":"http://www.siam.org/meetings/alenex05/papers/13gheileman.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W76038825"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5046941342","display_name":"Gregory L. Heileman","orcid":"https://orcid.org/0000-0002-5221-5682","observed_orcids":["https://orcid.org/0000-0002-5221-5682"]},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Gregory L. Heileman","raw_affiliation_strings":["University of New Mexico;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico;","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012285074","display_name":"Wenbin Luo","orcid":"https://orcid.org/0000-0001-8488-5077","observed_orcids":["https://orcid.org/0000-0001-8488-5077"]},"institutions":[{"id":"https://openalex.org/I189060766","display_name":"St. Mary's University, Texas","ror":"https://ror.org/03fvnza37","country_code":"US","type":"education","lineage":["https://openalex.org/I189060766"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Wenbin Luo","raw_affiliation_strings":["St. Mary\u2019s University, Texas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"St. Mary\u2019s University, Texas","institution_ids":["https://openalex.org/I189060766"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8807,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.71744186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"154"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.006200000178068876,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.0024999999441206455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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-design","display_name":"hash function design","score":0.4410000145435333},{"id":"https://openalex.org/keywords/cache-misses","display_name":"cache misses","score":0.6899999976158142},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"memory hierarchy","score":0.6600000262260437},{"id":"https://openalex.org/keywords/linear-probing","display_name":"linear probing","score":0.7739999890327454},{"id":"https://openalex.org/keywords/double-hashing","display_name":"double hashing","score":0.996999979019165},{"id":"https://openalex.org/keywords/collision-reduction","display_name":"collision reduction","score":0.5860000252723694},{"id":"https://openalex.org/keywords/spatial-locality","display_name":"spatial locality","score":0.9589999914169312}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7881628274917603},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6956131458282471},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6841941475868225},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.6065995097160339},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.5890020132064819},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5667855739593506},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.5368578433990479},{"id":"https://openalex.org/C36375716","wikidata":"https://www.wikidata.org/wiki/Q6553456","display_name":"Linear hashing","level":5,"score":0.4290482997894287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39073053002357483},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34867027401924133},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.1442047357559204}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:76038825","doi":null,"is_oa":false,"landing_page_url":"http://www.siam.org/meetings/alenex05/papers/13gheileman.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1555915743","https://openalex.org/W1814599000","https://openalex.org/W1967898291","https://openalex.org/W1992748711","https://openalex.org/W2002560134","https://openalex.org/W2023065712","https://openalex.org/W2030616523","https://openalex.org/W2052207834","https://openalex.org/W2055754268","https://openalex.org/W2058884257","https://openalex.org/W2082162447","https://openalex.org/W2099111195","https://openalex.org/W2114471387","https://openalex.org/W2776089907"],"related_works":["https://openalex.org/W7100725565","https://openalex.org/W7099194268","https://openalex.org/W7100697879","https://openalex.org/W1978397141","https://openalex.org/W104500322","https://openalex.org/W2024078544","https://openalex.org/W7163918634","https://openalex.org/W7169803604","https://openalex.org/W87649853","https://openalex.org/W1814599000"],"abstract_inverted_index":{"A":[0],"number":[1,69,244],"of":[2,9,17,42,47,67,70,94,99,105,155,167,177,210,213,225,245],"recent":[3,30],"papers":[4,26],"have":[5,34,109,123],"considered":[6],"the":[7,15,40,45,68,97,106,117,136,140,152,157,161,175,189,251,296],"influence":[8],"modern":[10],"computer":[11,171],"memory":[12],"hierarchies":[13],"on":[14,200],"performance":[16,80,190],"hashing":[18,115,322],"algorithms":[19],"[1,":[20],"2,":[21],"3].":[22],"Motivation":[23],"for":[24,112,264,305,312],"these":[25,82,332],"is":[27,54,96,144,274,317],"drawn":[28],"from":[29,218,335],"technology":[31],"trends":[32],"that":[33,61,100,108,192,207,231,250,290],"produced":[35],"an":[36,55],"ever-widening":[37],"gap":[38],"between":[39],"speed":[41],"CPUs":[43],"and":[44,279],"latency":[46],"dynamic":[48],"random":[49],"access":[50],"memories.":[51],"The":[52],"result":[53],"emerging":[56],"computing":[57],"folklore":[58],"which":[59],"contends":[60],"inferior":[62],"hash":[63,137,198,215,288],"functions,":[64,216],"in":[65,75,86,170,242,267,280],"terms":[66],"collisions":[71,83,128,256],"they":[72],"produce,":[73],"may":[74],"fact":[76],"lead":[77],"to":[78,102,126,146,221,240,300,302,309,319,330],"superior":[79],"because":[81],"mainly":[84],"occur":[85],"cache":[87,178,268],"rather":[88],"than":[89,286],"main":[90],"memory.":[91],"This":[92],"line":[93],"reasoning":[95],"antithesis":[98],"used":[101],"justify":[103],"most":[104],"improvements":[107,122],"been":[110],"proposed":[111],"open":[113,196],"address":[114,197],"over":[116,323],"past":[118],"forty":[119],"years.":[120],"Such":[121],"generally":[124],"sought":[125],"minimize":[127],"by":[129,254],"spreading":[130,156],"data":[131,158,229,292],"elements":[132,159],"more":[133,293],"randomly":[134,294],"through":[135,234,295],"table.":[138,297],"Indeed":[139],"name":[141],"\u201chashing":[142],"itself":[143],"meant":[145],"convey":[147],"this":[148,185,307],"notion":[149],"[12].":[150],"However,":[151],"very":[153],"act":[154],"throughout":[160],"table":[162],"negatively":[163],"impacts":[164],"their":[165],"degree":[166],"spatial":[168],"locality":[169],"memory,":[172],"thereby":[173],"increasing":[174],"likelihood":[176],"misses":[179],"during":[180],"long":[181],"probe":[182,259],"sequences.":[183],"In":[184],"paper":[186],"we":[187],"study":[188],"tradeoffs":[191],"exist":[193],"when":[194],"implementing":[195],"functions":[199,289],"contemporary":[201],"computers.":[202],"Experimental":[203],"analyses":[204],"are":[205,232,327],"reported":[206],"make":[208],"use":[209],"a":[211,243,315],"variety":[212],"different":[214],"ranging":[217],"linear":[219,272,324],"probing":[220,273],"highly":[222],"\u201cchaotic":[223],"forms":[224],"double":[226,287,321],"hashing,":[227],"using":[228],"sets":[230],"justified":[233],"information-theoretic":[235],"analyses.":[236],"Our":[237],"results,":[238],"contrary":[239],"those":[241,336],"recently":[246],"published":[247],"papers,":[248],"show":[249],"savings":[252],"gained":[253],"reducing":[255],"(and":[257],"therefore":[258],"sequence":[260],"lengths)":[261],"usually":[262,275],"compensate":[263],"any":[265],"increase":[266],"misses.":[269],"That":[270],"is,":[271],"no":[276],"better":[277],"than,":[278],"some":[281],"cases":[282],"performs":[283],"far":[284],"worse":[285],"spread":[291],"\u2217We":[298],"wish":[299],"thank":[301],"Bernard":[303],"Moret":[304],"suggesting":[306],"topic":[308],"us.":[310],"Thus,":[311],"general-purpose":[313],"use,":[314],"practitioner":[316],"well-advised":[318],"choose":[320],"probing.":[325],"Explanations":[326],"provided":[328],"as":[329],"why":[331],"results":[333],"differ":[334],"previ-":[337]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W76038825","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
