{"id":"https://openalex.org/W2046686992","doi":"https://doi.org/10.1109/tse.1984.5010306","title":"Concurrent Maintenance of Binary Search Trees","display_name":"Concurrent Maintenance of Binary Search Trees","publication_year":1984,"publication_date":"1984-11-01","ids":{"openalex":"https://openalex.org/W2046686992","doi":"https://doi.org/10.1109/tse.1984.5010306","mag":"2046686992"},"language":"en","primary_location":{"id":"doi:10.1109/tse.1984.5010306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tse.1984.5010306","pdf_url":null,"source":{"id":"https://openalex.org/S8351582","display_name":"IEEE Transactions on Software Engineering","issn_l":"0098-5589","issn":["0098-5589","1939-3520","2326-3881"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Transactions on Software Engineering","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/A5074720054","display_name":"Udi Manber","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Udi Manber","raw_affiliation_strings":["Department of Computer Science, University of Wisconsin, Madison, WI, USA","Department of Computer Science, University of Wisconsin, Madison, WI 53706"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin, Madison, WI 53706","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074720054"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":2.5135,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.89035167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"SE-10","issue":"6","first_page":"777","last_page":"784"},"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.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9894000291824341,"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.9854000210762024,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8749098777770996},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7688379287719727},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.7685900330543518},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5154982209205627},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5145556330680847},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.4757016599178314},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.46352797746658325},{"id":"https://openalex.org/keywords/linked-list","display_name":"Linked list","score":0.44648104906082153},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4390186369419098},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.4388582408428192},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4377235174179077},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4314590394496918},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.414041131734848},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3756791949272156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34482255578041077},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32876384258270264},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1799602508544922},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.10670730471611023}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8749098777770996},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7688379287719727},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.7685900330543518},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5154982209205627},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5145556330680847},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.4757016599178314},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.46352797746658325},{"id":"https://openalex.org/C146101286","wikidata":"https://www.wikidata.org/wiki/Q7003418","display_name":"Linked list","level":2,"score":0.44648104906082153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4390186369419098},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.4388582408428192},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4377235174179077},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4314590394496918},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.414041131734848},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3756791949272156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34482255578041077},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32876384258270264},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1799602508544922},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.10670730471611023},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tse.1984.5010306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tse.1984.5010306","pdf_url":null,"source":{"id":"https://openalex.org/S8351582","display_name":"IEEE Transactions on Software Engineering","issn_l":"0098-5589","issn":["0098-5589","1939-3520","2326-3881"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Transactions on Software Engineering","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":16,"referenced_works":["https://openalex.org/W75461696","https://openalex.org/W1972585359","https://openalex.org/W1980806195","https://openalex.org/W1986878949","https://openalex.org/W1991199257","https://openalex.org/W1993505169","https://openalex.org/W2003511772","https://openalex.org/W2033584818","https://openalex.org/W2049049080","https://openalex.org/W2057391254","https://openalex.org/W2077687996","https://openalex.org/W2106887953","https://openalex.org/W2108179552","https://openalex.org/W2176413683","https://openalex.org/W2431458507","https://openalex.org/W6648738081"],"related_works":["https://openalex.org/W1837592468","https://openalex.org/W4205700501","https://openalex.org/W2065505971","https://openalex.org/W1968687912","https://openalex.org/W1490902304","https://openalex.org/W1979539738","https://openalex.org/W2030110905","https://openalex.org/W2294466966","https://openalex.org/W2504292983","https://openalex.org/W2487079816"],"abstract_inverted_index":{"The":[0,42,60],"problem":[1],"of":[2,18,35,62,89,108,126,133,142],"providing":[3],"efficient":[4],"concurrent":[5,23,92],"access":[6],"for":[7,25,44],"independent":[8],"processes":[9,114,125],"to":[10,104],"a":[11,32,84,96,136],"dynamic":[12,97,137],"search":[13,37,98],"structure":[14,65,99,120],"is":[15,47,53,100],"the":[16,49,63,67,87,106,109,118,123,143],"topic":[17],"this":[19,57],"paper.":[20],"We":[21,129],"develop":[22],"algorithms":[24,68,93,110],"search,":[26],"update,":[27],"insert,":[28],"and":[29,66,75,121,139],"delete":[30],"in":[31,56,86,135],"simple":[33],"variation":[34],"binary":[36],"trees,":[38],"called":[39],"external":[40],"trees.":[41],"algorithm":[43],"deletion,":[45],"which":[46],"usually":[48],"most":[50],"difficult":[51],"operation,":[52],"relatively":[54],"easy":[55],"data":[58,64,119,144],"structure.":[59,145],"advantages":[61],"are":[69,72],"that":[70,78,115],"they":[71,79],"simple,":[73],"flexible,":[74],"efficient,":[76],"so":[77],"can":[80],"be":[81],"used":[82],"as":[83],"part":[85],"design":[88],"more":[90],"complicated":[91],"where":[94],"maintaining":[95],"necessary.":[101],"In":[102],"order":[103],"increase":[105],"efficiency":[107],"we":[111],"introduce":[112],"maintenance":[113],"independently":[116],"reorganize":[117],"relieve":[122],"user":[124],"nonurgent":[127],"operations.":[128],"also":[130],"discuss":[131],"questions":[132],"transactions":[134],"environment":[138],"replicated":[140],"copies":[141]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}