{"id":"https://openalex.org/W2122397730","doi":"https://doi.org/10.1109/icde.2004.1319981","title":"Simple, robust and highly concurrent b-trees with node deletion","display_name":"Simple, robust and highly concurrent b-trees with node deletion","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W2122397730","doi":"https://doi.org/10.1109/icde.2004.1319981","mag":"2122397730"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2004.1319981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2004.1319981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 20th International Conference on Data Engineering","raw_type":"proceedings-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/A5009686443","display_name":"David Lomet","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Lomet","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","[Microsoft Research,Redmond,WA,USA]"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"[Microsoft Research,Redmond,WA,USA]","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009686443"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.6953,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.7698859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"27"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"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.9984999895095825,"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.7939908504486084},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7474879622459412},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6603319644927979},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.6396127343177795},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.5777099132537842},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5758556723594666},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5566568374633789},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.507548451423645},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.49395328760147095},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48105835914611816},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4728061258792877},{"id":"https://openalex.org/keywords/multiversion-concurrency-control","display_name":"Multiversion concurrency control","score":0.41048741340637207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3170740604400635},{"id":"https://openalex.org/keywords/distributed-concurrency-control","display_name":"Distributed concurrency control","score":0.26301389932632446},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.18687185645103455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1592419147491455},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09925395250320435},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08076730370521545},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.07615703344345093}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7939908504486084},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7474879622459412},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6603319644927979},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.6396127343177795},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.5777099132537842},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5758556723594666},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5566568374633789},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.507548451423645},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.49395328760147095},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48105835914611816},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4728061258792877},{"id":"https://openalex.org/C108744092","wikidata":"https://www.wikidata.org/wiki/Q93695","display_name":"Multiversion concurrency control","level":5,"score":0.41048741340637207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3170740604400635},{"id":"https://openalex.org/C208087996","wikidata":"https://www.wikidata.org/wiki/Q5283142","display_name":"Distributed concurrency control","level":4,"score":0.26301389932632446},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.18687185645103455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1592419147491455},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09925395250320435},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08076730370521545},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.07615703344345093},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"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},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2004.1319981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2004.1319981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 20th International Conference on Data Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1515932031","https://openalex.org/W1971289999","https://openalex.org/W1974021718","https://openalex.org/W1980806195","https://openalex.org/W2018464987","https://openalex.org/W2026942343","https://openalex.org/W2030279442","https://openalex.org/W2036122593","https://openalex.org/W2039071499","https://openalex.org/W2042579382","https://openalex.org/W2047908203","https://openalex.org/W2077401654","https://openalex.org/W2081912596","https://openalex.org/W2104954161","https://openalex.org/W2108179552","https://openalex.org/W2118269922","https://openalex.org/W2118314386","https://openalex.org/W2157876236","https://openalex.org/W2168262126","https://openalex.org/W4231495260","https://openalex.org/W4237310759"],"related_works":["https://openalex.org/W2907808821","https://openalex.org/W2065469956","https://openalex.org/W2083731697","https://openalex.org/W2088566435","https://openalex.org/W4242696047","https://openalex.org/W2124917555","https://openalex.org/W2378990526","https://openalex.org/W2101982608","https://openalex.org/W34968323","https://openalex.org/W2009349853"],"abstract_inverted_index":{"Why":[0],"might":[1],"B-tree":[2,68,75],"concurrency":[3,76],"control":[4,77],"still":[5],"be":[6],"interesting?":[7],"For":[8],"two":[9],"reasons:":[10],"(i)":[11],"currently":[12,51],"exploited":[13,52],"\"real":[14,33],"world\"":[15],"approaches":[16],"are":[17,22,27,54],"complicated;":[18],"(ii)":[19],"simpler":[20],"proposals":[21],"not":[23,28,110],"used":[24],"because":[25],"they":[26],"sufficiently":[29],"robust.":[30],"In":[31,56],"the":[32,50,61,92],"world\",":[34],"systems":[35],"need":[36],"to":[37,59,113,121],"deal":[38],"robustly":[39],"with":[40],"node":[41,81,107],"deletion,":[42],"and":[43,65,83],"this":[44],"is":[45,120],"an":[46],"important":[47],"reason":[48],"why":[49],"techniques":[53],"complicated.":[55],"our":[57,116],"effort":[58],"simplify":[60,115],"world":[62],"of":[63,97],"robust":[64,128],"highly":[66],"concurrent":[67],"methods,":[69],"we":[70],"focus":[71],"on":[72],"exactly":[73],"where":[74],"needs":[78],"information":[79],"about":[80],"deletes,":[82],"describe":[84,122],"mechanisms":[85],"that":[86,88],"provide":[87],"information.":[89],"We":[90],"exploit":[91],"B/sup":[93],"link/":[94],"-tree":[95],"property":[96],"being":[98],"\"well-formed\"":[99],"even":[100],"when":[101],"index":[102],"term":[103],"posting":[104],"for":[105],"a":[106,123],"split":[108],"has":[109],"been":[111],"completed":[112],"greatly":[114],"algorithms.":[117],"Our":[118],"goal":[119],"very":[124],"simple":[125],"but":[126],"nonetheless":[127],"method.":[129]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}