{"id":"https://openalex.org/W4409448177","doi":"https://doi.org/10.1145/3712254","title":"A Write-Optimized Distributed B+Tree Index on Disaggregated Memory","display_name":"A Write-Optimized Distributed B+Tree Index on Disaggregated Memory","publication_year":2025,"publication_date":"2025-04-15","ids":{"openalex":"https://openalex.org/W4409448177","doi":"https://doi.org/10.1145/3712254"},"language":"en","primary_location":{"id":"doi:10.1145/3712254","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712254","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3712254","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3712254","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034086130","display_name":"Tim Kraska","orcid":"https://orcid.org/0009-0003-2414-2759"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tim Kraska","raw_affiliation_strings":["Massachussetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory (CSAIL), Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachussetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory (CSAIL), Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034086130"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08473092,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"68","issue":"05","first_page":"91","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"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/T11181","display_name":"Advanced Data Storage Technologies","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9979000091552734,"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/computer-science","display_name":"Computer science","score":0.7537618279457092},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.6659052968025208},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4984169006347656},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44820597767829895},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.4442770183086395},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.1480272114276886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1297166645526886}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7537618279457092},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.6659052968025208},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4984169006347656},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44820597767829895},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.4442770183086395},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.1480272114276886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1297166645526886},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3712254","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712254","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3712254","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3712254","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712254","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3712254","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409448177.pdf","grobid_xml":"https://content.openalex.org/works/W4409448177.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W1497100682","https://openalex.org/W2171707251","https://openalex.org/W2948862017"],"related_works":["https://openalex.org/W2366415612","https://openalex.org/W1910264759","https://openalex.org/W3173774952","https://openalex.org/W2359807192","https://openalex.org/W2012793075","https://openalex.org/W2066343347","https://openalex.org/W2350738653","https://openalex.org/W922801557","https://openalex.org/W94425735","https://openalex.org/W2908418870"],"abstract_inverted_index":{"Separation":[0],"of":[1,40,54,81,89,179,208,227,288,318,336,358,369,399,408,413,424,452,457,463,472],"compute":[2,41,90,117,145,154,359,365,414],"and":[3,38,42,91,146,155,199,224,241,247,253,262,360,402,415,426,460],"storage":[4,43,52,112,132,197],"has":[5,293,433],"become":[6,434],"the":[7,48,78,87,93,116,120,125,158,192,209,221,235,254,316,322,334,356,367,374,390,397,405,409,422,440,450,464,470,473],"de":[8],"facto":[9],"standard":[10],"for":[11,18,47,62,171],"cloud":[12,30,107,131,139],"database":[13,19,102,108,140,172,276,442],"systems.First":[14],"proposed":[15,439],"in":[16,68,204],"2007":[17],"systems,":[20],"2":[21],"it":[22,148,292,300,309,417],"is":[23,127,207,244,251,264,351,380,404,418],"now":[24],"widely":[25],"adopted":[26],"by":[27,383],"all":[28,201,373],"major":[29],"providers,":[31],"such":[32,134,385],"as":[33,135,157,185,188,212,386,444],"Amazon":[34,136],"Redshift,":[35],"Google":[36],"BigQuery,":[37],"Snowflake.Separation":[39],"adds":[44],"enormous":[45],"value":[46],"customer.Users":[49],"can":[50,183,345],"scale":[51,304],"independently":[53,306],"compute,":[55,263,308,400,458],"which":[56,69,83,214,258,344,388,479],"enables":[57],"them":[58],"to":[59,99,152,162,175,190,196,216,266,294,303,313,448],"only":[60,76,346,419,480],"pay":[61],"what":[63],"they":[64,182],"use.Consider":[65],"a":[66,164,245,275,286,330,445,453],"scenario":[67],"data":[70,126,187,350,375],"grows":[71],"linearly":[72],"over":[73,122],"time.Most":[74],"queries":[75,282,337,370],"access":[77,161,195],"last":[79],"month":[80],"data,":[82,163,238],"remains":[84],"relatively":[85,193],"stable.Without":[86],"separation":[88,357,412,456],"storage,":[92,401,459],"user":[94],"would":[95,166,310,324,362],"gradually":[96],"be":[97,311,347],"forced":[98],"significantly":[100],"increase":[101],"cluster":[103,118],"capacity.In":[104],"contrast,":[105],"modern":[106],"systems":[109,141],"allow":[110],"scaling":[111,364],"separately":[113],"from":[114,307],"compute;":[115],"stays":[119],"same":[121,465],"time,":[123],"whereas":[124],"stored":[128],"on":[129,321],"cheap":[130],"services,":[133],"S3.However,":[137],"current":[138],"still":[142],"tightly":[143],"couple":[144],"memory.While":[147],"might":[149,283],"feel":[150],"unnatural":[151],"disaggregate":[153],"memory":[156,261,305,319,361,403],"CPU":[159],"needs":[160],"disaggregation":[165,398],"certainly":[167],"have":[168,176],"advantages.Servers":[169],"used":[170,382],"workloads":[173,270],"tend":[174],"large":[177],"amounts":[178],"memory,":[180,289],"so":[181],"cache":[184],"much":[186],"possible":[189,302],"avoid":[191],"slow":[194],"services":[198,384],"keep":[200],"intermediate":[202,239],"results":[203],"memory.The":[205],"latter":[206],"utmost":[210],"importance":[211],"queries,":[213],"spill":[215],"disk,":[217],"often":[218,248],"fall":[219],"off":[220],"performance":[222],"cliff":[223],"are":[225,271],"orders":[226],"magnitude":[228],"slower":[229],"than":[230],"their":[231],"in-memory":[232,243],"counterparts.Yet,":[233],"keeping":[234,372],"most":[236],"relevant":[237],"results,":[240],"metadata":[242],"non-trivial":[246],"costly":[249],"problem.Memory":[250],"expensive":[252],"right":[255],"machine":[256],"type,":[257],"offers":[259],"enough":[260],"hard":[265],"determine":[267],"up":[268],"front.Moreover,":[269],"rarely":[272],"static.For":[273],"example,":[274],"system":[277,454],"that":[278,430],"mainly":[279],"serves":[280],"dashboarding":[281],"not":[284],"require":[285],"lot":[287],"except":[290],"when":[291],"process":[295],"ad":[296],"hoc":[297],"data-exploration":[298],"queries.If":[299],"were":[301],"feasible":[312],"dynamically":[314],"adjust":[315],"amount":[317],"based":[320],"workload.It":[323],"further":[325],"enable":[326,363],"better":[327],"resource":[328],"utilization.Consider":[329],"dynamic":[331],"workload":[332],"regarding":[333],"number":[335,368],"but":[338],"with":[339,366,421,455],"very":[340],"strict":[341],"response-time":[342],"requirements,":[343],"met":[348],"if":[349],"kept":[352],"in-memory.In":[353,394],"this":[354,431],"case,":[355],"while":[371],"constantly":[376],"in-memory.This":[377],"design":[378,451,471],"principle":[379],"already":[381],"Google,":[387],"keeps":[389],"entire":[391],"Web":[392],"index":[393],"some":[395],"ways,":[396],"natural":[406],"evolution":[407,432],"currently":[410],"prevalent":[411],"storage.However,":[416],"recently,":[420],"advancement":[423],"RDMA":[425],"low-latency":[427],"network":[428],"standards,":[429],"possible.In":[435],"2016,":[436],"1":[437],"we":[438,467],"network-attached-memory":[441],"(NAM-DB)":[443],"first":[446,474],"prototype":[447],"explore":[449],"memory.As":[461],"part":[462],"project,":[466],"also":[468],"explored":[469],"RDMA-based":[475],"B-Tree":[476],"index,":[477],"3":[478],"uses":[481],"one-sided":[482]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}