{"id":"https://openalex.org/W7103883720","doi":"https://doi.org/10.1109/lca.2025.3628805","title":"Rethinking In-Memory Hash Table Design for CXL-Based Main Memory Compression","display_name":"Rethinking In-Memory Hash Table Design for CXL-Based Main Memory Compression","publication_year":2025,"publication_date":"2025-07-01","ids":{"openalex":"https://openalex.org/W7103883720","doi":"https://doi.org/10.1109/lca.2025.3628805"},"language":null,"primary_location":{"id":"doi:10.1109/lca.2025.3628805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lca.2025.3628805","pdf_url":null,"source":{"id":"https://openalex.org/S17643076","display_name":"IEEE Computer Architecture Letters","issn_l":"1556-6056","issn":["1556-6056","1556-6064","2473-2575"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Computer Architecture Letters","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":null,"display_name":"Teresa Zhang","orcid":"https://orcid.org/0009-0002-2863-8690"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Teresa Zhang","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.58668892,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"2","first_page":"357","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.30489999055862427,"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"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.30489999055862427,"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/T11269","display_name":"Algorithms and Data Compression","score":0.24480000138282776,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.1347000002861023,"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","display_name":"Hash function","score":0.6395000219345093},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5060999989509583},{"id":"https://openalex.org/keywords/physical-address","display_name":"Physical address","score":0.4823000133037567},{"id":"https://openalex.org/keywords/dram","display_name":"Dram","score":0.4738999903202057},{"id":"https://openalex.org/keywords/flat-memory-model","display_name":"Flat memory model","score":0.4708000123500824},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.4629000127315521},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.4577000141143799},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.43549999594688416},{"id":"https://openalex.org/keywords/interleaved-memory","display_name":"Interleaved memory","score":0.426800012588501},{"id":"https://openalex.org/keywords/logical-address","display_name":"Logical address","score":0.42660000920295715}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.847000002861023},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6395000219345093},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5060999989509583},{"id":"https://openalex.org/C41036726","wikidata":"https://www.wikidata.org/wiki/Q844824","display_name":"Physical address","level":3,"score":0.4823000133037567},{"id":"https://openalex.org/C7366592","wikidata":"https://www.wikidata.org/wiki/Q1255620","display_name":"Dram","level":2,"score":0.4738999903202057},{"id":"https://openalex.org/C57863822","wikidata":"https://www.wikidata.org/wiki/Q905488","display_name":"Flat memory model","level":4,"score":0.4708000123500824},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.4577000141143799},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.4424999952316284},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4359999895095825},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.43549999594688416},{"id":"https://openalex.org/C63511323","wikidata":"https://www.wikidata.org/wiki/Q908936","display_name":"Interleaved memory","level":4,"score":0.426800012588501},{"id":"https://openalex.org/C186799414","wikidata":"https://www.wikidata.org/wiki/Q3494571","display_name":"Logical address","level":4,"score":0.42660000920295715},{"id":"https://openalex.org/C74426580","wikidata":"https://www.wikidata.org/wiki/Q719484","display_name":"Memory map","level":3,"score":0.423799991607666},{"id":"https://openalex.org/C189930140","wikidata":"https://www.wikidata.org/wiki/Q1112878","display_name":"CAS latency","level":4,"score":0.4065999984741211},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.3977000117301941},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C171675096","wikidata":"https://www.wikidata.org/wiki/Q1143380","display_name":"Extended memory","level":4,"score":0.3849000036716461},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3831000030040741},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.3774000108242035},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.376800000667572},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3736000061035156},{"id":"https://openalex.org/C153247305","wikidata":"https://www.wikidata.org/wiki/Q835713","display_name":"Memory address","level":3,"score":0.32739999890327454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3190999925136566},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.31119999289512634},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3084999918937683},{"id":"https://openalex.org/C93446704","wikidata":"https://www.wikidata.org/wiki/Q449328","display_name":"Registered memory","level":3,"score":0.30169999599456787},{"id":"https://openalex.org/C2781357197","wikidata":"https://www.wikidata.org/wiki/Q5757597","display_name":"High memory","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C33762810","wikidata":"https://www.wikidata.org/wiki/Q461671","display_name":"Data integrity","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C76399640","wikidata":"https://www.wikidata.org/wiki/Q189401","display_name":"Virtual memory","level":4,"score":0.2888000011444092},{"id":"https://openalex.org/C21847791","wikidata":"https://www.wikidata.org/wiki/Q191081","display_name":"Logical conjunction","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.27619999647140503},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26969999074935913},{"id":"https://openalex.org/C177950962","wikidata":"https://www.wikidata.org/wiki/Q10997658","display_name":"Non-volatile memory","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C51290061","wikidata":"https://www.wikidata.org/wiki/Q1936765","display_name":"Uniform memory access","level":4,"score":0.2542000114917755},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lca.2025.3628805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lca.2025.3628805","pdf_url":null,"source":{"id":"https://openalex.org/S17643076","display_name":"IEEE Computer Architecture Letters","issn_l":"1556-6056","issn":["1556-6056","1556-6064","2473-2575"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Computer Architecture Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2054711061","https://openalex.org/W2516109628","https://openalex.org/W4214753036","https://openalex.org/W4308083736"],"related_works":[],"abstract_inverted_index":{"Main":[0],"memory":[1,16,27,66,89,103,122],"compression":[2,67,85],"has":[3],"re-emerged":[4],"as":[5],"a":[6],"viable":[7],"solution":[8],"to":[9,36,86,95,118],"DRAM":[10],"cost":[11],"challenges,":[12],"enabled":[13],"by":[14],"CXL":[15],"devices":[17],"that":[18,61],"support":[19],"hardware-managed,":[20],"coarse-grained":[21],"compression.":[22],"This":[23,46],"shift":[24],"decouples":[25],"logical":[26,78],"space":[28],"usage":[29,104],"from":[30],"physical":[31,88],"consumption,":[32],"opening":[33],"new":[34],"opportunities":[35],"re-think":[37],"the":[38,65,112],"design":[39,132],"and":[40,58,106,124],"implementation":[41,81],"of":[42,56,99,114],"in-memory":[43,71],"data":[44,72,116],"structures.":[45],"letter":[47],"presents":[48],"case":[49],"studies":[50],"on":[51],"<italic":[52],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[53],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">blocked</i>":[54],"variants":[55],"chained":[57],"Cuckoo":[59],"hashing":[60],"align":[62],"naturally":[63],"with":[64],"granularity.":[68],"Targeting":[69],"large-scale":[70],"stores,":[73],"blocked":[74],"hash":[75],"tables":[76],"trade":[77],"sparsity":[79],"for":[80],"efficiency":[82],"while":[83],"leveraging":[84],"avoid":[87],"waste.":[90],"We":[91],"develop":[92],"mathematical":[93],"formulations":[94],"enable":[96],"theoretical":[97],"analysis":[98],"key":[100],"metrics,":[101],"including":[102],"saving":[105],"operational":[107],"throughput.":[108],"Our":[109],"results":[110],"highlight":[111],"potential":[113],"compression-aware":[115],"structures":[117],"better":[119],"leverage":[120],"modern":[121],"hierarchies":[123],"motivate":[125],"further":[126],"exploration":[127],"in":[128],"this":[129],"largely":[130],"untapped":[131],"space.":[133]},"counts_by_year":[],"updated_date":"2025-11-23T23:15:26.331081","created_date":"2025-11-05T00:00:00"}