{"id":"https://openalex.org/W4299686751","doi":"https://doi.org/10.48550/arxiv.1702.04441","title":"A Concurrency-Optimal Binary Search Tree","display_name":"A Concurrency-Optimal Binary Search Tree","publication_year":2017,"publication_date":"2017-02-15","ids":{"openalex":"https://openalex.org/W4299686751","doi":"https://doi.org/10.48550/arxiv.1702.04441"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.1702.04441","doi":"https://doi.org/10.48550/arxiv.1702.04441","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1702.04441","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.1702.04441","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069723237","display_name":"Vitaly Aksenov","orcid":"https://orcid.org/0000-0001-9134-5490","observed_orcids":["https://orcid.org/0000-0001-9134-5490"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aksenov, Vitaly","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036969849","display_name":"Vincent Gramoli","orcid":"https://orcid.org/0000-0001-5632-8572","observed_orcids":["https://orcid.org/0000-0001-5632-8572"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gramoli, Vincent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101714664","display_name":"Petr Kuznetsov","orcid":"https://orcid.org/0000-0003-1148-1228","observed_orcids":["https://orcid.org/0000-0003-1148-1228"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kuznetsov, Petr","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017829426","display_name":"Anna Malova","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Malova, Anna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5090605375","display_name":"Srivatsan Ravi","orcid":"https://orcid.org/0000-0002-2965-3940","observed_orcids":["https://orcid.org/0000-0002-2965-3940"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ravi, Srivatsan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9682999849319458,"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.9682999849319458,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.008999999612569809,"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.006899999920278788,"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/binary-search-trees","display_name":"binary search trees","score":0.8960000276565552},{"id":"https://openalex.org/keywords/concurrent-data-structures","display_name":"concurrent data structures","score":0.8500000238418579},{"id":"https://openalex.org/keywords/linearizability","display_name":"linearizability","score":0.875}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7832878232002258},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6843562722206116},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.571467936038971},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.491915225982666},{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.48137596249580383},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48108288645744324},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47524261474609375},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4497350752353668},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4331642985343933},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4318195581436157},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.4204957187175751},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3996352255344391},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3365989327430725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3360726833343506},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3286603093147278},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.28365522623062134},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.21580246090888977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18139106035232544},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.16009065508842468},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13659602403640747},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09820085763931274},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.1702.04441","doi":"https://doi.org/10.48550/arxiv.1702.04441","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1702.04441","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.1702.04441","doi":"https://doi.org/10.48550/arxiv.1702.04441","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1702.04441","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2093708041","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W2371680642","https://openalex.org/W1837592468","https://openalex.org/W2022598760","https://openalex.org/W2955615582","https://openalex.org/W2181425632","https://openalex.org/W2005570743","https://openalex.org/W2931844481"],"abstract_inverted_index":{"The":[0,13],"paper":[1],"presents":[2],"the":[3,36,65,77,83],"first":[4],"\\emph{concurrency-optimal}":[5],"implementation":[6,20,63],"of":[7,21,33,35,79,82],"a":[8,17,49],"binary":[9],"search":[10],"tree":[11,56],"(BST).":[12],"implementation,":[14],"based":[15],"on":[16,69],"standard":[18],"sequential":[19,37,84],"an":[22,88],"internal":[23],"tree,":[24],"ensures":[25],"that":[26,54,75],"every":[27],"\\emph{schedule}":[28],"is":[29,41],"accepted,":[30],"i.e.,":[31],"interleaving":[32],"steps":[34],"code,":[38],"unless":[39],"linearizability":[40],"violated.":[42],"To":[43],"ensure":[44],"this":[45],"property,":[46],"we":[47],"use":[48],"novel":[50],"read-write":[51],"locking":[52],"scheme":[53],"protects":[55],"\\emph{edges}":[57],"in":[58],"addition":[59],"to":[60],"nodes.":[61],"Our":[62],"outperforms":[64],"state-of-the":[66],"art":[67],"BSTs":[68],"most":[70],"basic":[71],"workloads,":[72],"which":[73],"suggests":[74],"optimizing":[76],"set":[78],"accepted":[80],"schedules":[81],"code":[85],"can":[86],"be":[87],"adequate":[89],"design":[90],"principle":[91],"for":[92],"efficient":[93],"concurrent":[94],"data":[95],"structures.":[96]},"counts_by_year":[],"updated_date":"2026-09-25T08:18:29.962427","created_date":"2025-10-10T00:00:00"}