{"id":"https://openalex.org/W2119251905","doi":"https://doi.org/10.1145/1693453.1693488","title":"A practical concurrent binary search tree","display_name":"A practical concurrent binary search tree","publication_year":2010,"publication_date":"2010-01-09","ids":{"openalex":"https://openalex.org/W2119251905","doi":"https://doi.org/10.1145/1693453.1693488","mag":"2119251905"},"language":"en","primary_location":{"id":"doi:10.1145/1693453.1693488","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1693453.1693488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"conference-paper","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/A5012608164","display_name":"Nathan Bronson","orcid":null},"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":false,"raw_author_name":"Nathan G. Bronson","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010396318","display_name":"Jared Casper","orcid":null},"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":false,"raw_author_name":"Jared Casper","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047912647","display_name":"Hassan Chafi","orcid":"https://orcid.org/0009-0003-1172-0409"},"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":false,"raw_author_name":"Hassan Chafi","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023857198","display_name":"Kunle Olukotun","orcid":"https://orcid.org/0000-0002-8779-0636"},"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":false,"raw_author_name":"Kunle Olukotun","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"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":null,"has_fulltext":false,"cited_by_count":201,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"268"},"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.9998999834060669,"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.9998999834060669,"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/T13471","display_name":"Cognitive Functions and Memory","score":0.9632999897003174,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9557999968528748,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8498517274856567},{"id":"https://openalex.org/keywords/software-transactional-memory","display_name":"Software transactional memory","score":0.7113968133926392},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6729528307914734},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5726158618927002},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5667104125022888},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5545793175697327},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5132777690887451},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4889353811740875},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.44475480914115906},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44126784801483154},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3919110596179962},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3877105116844177},{"id":"https://openalex.org/keywords/transactional-memory","display_name":"Transactional memory","score":0.35127323865890503},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1882840394973755},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1105160117149353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09880772233009338},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.07813239097595215}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8498517274856567},{"id":"https://openalex.org/C167149655","wikidata":"https://www.wikidata.org/wiki/Q1189004","display_name":"Software transactional memory","level":4,"score":0.7113968133926392},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6729528307914734},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5726158618927002},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5667104125022888},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5545793175697327},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5132777690887451},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4889353811740875},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.44475480914115906},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44126784801483154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3919110596179962},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3877105116844177},{"id":"https://openalex.org/C134277064","wikidata":"https://www.wikidata.org/wiki/Q878206","display_name":"Transactional memory","level":3,"score":0.35127323865890503},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1882840394973755},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1105160117149353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09880772233009338},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.07813239097595215},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1693453.1693488","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1693453.1693488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.1823","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.1823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ppl.stanford.edu/papers/ppopp207-bronson.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W172574161","https://openalex.org/W1483819513","https://openalex.org/W1552340129","https://openalex.org/W1972027649","https://openalex.org/W1980806195","https://openalex.org/W2021615496","https://openalex.org/W2028764399","https://openalex.org/W2056472034","https://openalex.org/W2070991879","https://openalex.org/W2079090355","https://openalex.org/W2094222793","https://openalex.org/W2101939036","https://openalex.org/W2105055683","https://openalex.org/W2129017891","https://openalex.org/W2145052180","https://openalex.org/W2160567205","https://openalex.org/W2172192453","https://openalex.org/W2187800381","https://openalex.org/W2914061328","https://openalex.org/W3006898331","https://openalex.org/W6645327464"],"related_works":["https://openalex.org/W2088444093","https://openalex.org/W133473147","https://openalex.org/W2152491655","https://openalex.org/W2076409732","https://openalex.org/W924353067","https://openalex.org/W4252722439","https://openalex.org/W2992926879","https://openalex.org/W1144911151","https://openalex.org/W120707803","https://openalex.org/W2130223300"],"abstract_inverted_index":{"We":[0,45],"propose":[1],"a":[2,50,72,96],"concurrent":[3,75],"relaxed":[4],"balance":[5],"AVL":[6],"tree":[7],"algorithm":[8,37,48,70],"that":[9,68],"is":[10,18],"fast,":[11],"scales":[12],"well,":[13],"and":[14,41,90,101],"tolerates":[15],"contention.":[16],"It":[17],"based":[19],"on":[20],"optimistic":[21],"techniques":[22],"adapted":[23],"from":[24],"software":[25],"transactional":[26],"memory,":[27],"but":[28],"takes":[29],"advantage":[30],"of":[31,34,62,85,98],"specific":[32],"knowledge":[33],"the":[35,36,63],"to":[38],"reduce":[39],"overheads":[40],"avoid":[42],"unnecessary":[43],"retries.":[44],"extend":[46],"our":[47,69],"with":[49,82],"fast":[51],"linearizable":[52],"clone":[53],"operation,":[54],"which":[55],"can":[56],"be":[57],"used":[58],"for":[59,78],"consistent":[60],"iteration":[61],"tree.":[64],"Experimental":[65],"evidence":[66],"shows":[67],"outperforms":[71],"highly":[73],"tuned":[74],"skip":[76],"list":[77],"many":[79],"access":[80],"patterns,":[81],"an":[83],"average":[84],"39%":[86],"higher":[87,92],"single-threaded":[88],"throughput":[89,94],"32%":[91],"multi-threaded":[93],"over":[95],"range":[97],"contention":[99],"levels":[100],"operation":[102],"mixes.":[103]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":24},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}