{"id":"https://openalex.org/W2105130984","doi":"https://doi.org/10.1137/s0097539793255722","title":"The Tree Model for Hashing: Lower and Upper Bounds","display_name":"The Tree Model for Hashing: Lower and Upper Bounds","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2105130984","doi":"https://doi.org/10.1137/s0097539793255722","mag":"2105130984"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793255722","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793255722","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Journal on Computing","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/A5110126527","display_name":"Joseph Gil","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joseph Gil","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109961260","display_name":"Friedhelm Meyer auf der Heide","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Friedhelm Meyer Auf Der Heide","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039043184","display_name":"Avi Wigderson","orcid":"https://orcid.org/0000-0002-1539-1417"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avi Wigderson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110126527"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5522,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76767463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"5","first_page":"936","last_page":"955"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"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.9991000294685364,"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.996999979019165,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.8908268213272095},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7673349976539612},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.7445330023765564},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.710529625415802},{"id":"https://openalex.org/keywords/consistent-hashing","display_name":"Consistent hashing","score":0.6916688084602356},{"id":"https://openalex.org/keywords/linear-hashing","display_name":"Linear hashing","score":0.6861304044723511},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.6457292437553406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6157311201095581},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.4946398437023163},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4656928777694702},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44150063395500183},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43827471137046814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43295615911483765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.296924352645874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19869950413703918}],"concepts":[{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.8908268213272095},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7673349976539612},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.7445330023765564},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.710529625415802},{"id":"https://openalex.org/C56856351","wikidata":"https://www.wikidata.org/wiki/Q1757218","display_name":"Consistent hashing","level":5,"score":0.6916688084602356},{"id":"https://openalex.org/C36375716","wikidata":"https://www.wikidata.org/wiki/Q6553456","display_name":"Linear hashing","level":5,"score":0.6861304044723511},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.6457292437553406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6157311201095581},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.4946398437023163},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4656928777694702},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44150063395500183},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43827471137046814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43295615911483765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.296924352645874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19869950413703918},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793255722","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793255722","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W17078302","https://openalex.org/W1781587470","https://openalex.org/W1993022201","https://openalex.org/W2015895093","https://openalex.org/W2017955951","https://openalex.org/W2025196296","https://openalex.org/W2028395046","https://openalex.org/W2042587503","https://openalex.org/W2051049045","https://openalex.org/W2057399436","https://openalex.org/W2057911579","https://openalex.org/W2061496873","https://openalex.org/W2070755358","https://openalex.org/W2077229436","https://openalex.org/W2082162447","https://openalex.org/W2119158116","https://openalex.org/W2119722054","https://openalex.org/W2165621523","https://openalex.org/W2475478067","https://openalex.org/W4249991923"],"related_works":["https://openalex.org/W4385382899","https://openalex.org/W2076162755","https://openalex.org/W2084899141","https://openalex.org/W2334522381","https://openalex.org/W4386271002","https://openalex.org/W1486630602","https://openalex.org/W2811247857","https://openalex.org/W2585520041","https://openalex.org/W2094127768","https://openalex.org/W2044784665"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,45,49],"new":[3],"simple":[4],"and":[5,21,25,39],"general":[6],"model":[7,12],"for":[8],"hashing.":[9],"The":[10],"basic":[11],"together":[13],"with":[14],"several":[15],"variants":[16],"capture":[17],"many":[18],"natural":[19],"(sequential":[20],"parallel)":[22],"hashing":[23,28],"algorithms":[24],"represent":[26],"common":[27],"practice.":[29],"Our":[30],"main":[31],"results":[32],"exhibit":[33],"tight":[34],"tradeoffs":[35],"between":[36],"hash-table":[37],"size":[38],"the":[40],"number":[41],"of":[42,44],"applications":[43],"hash":[46],"function":[47],"on":[48],"single":[50],"key.":[51]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}