{"id":"https://openalex.org/W2255215184","doi":"https://doi.org/10.1145/2851141.2851173","title":"Improving efficacy of internal binary search trees using local recovery","display_name":"Improving efficacy of internal binary search trees using local recovery","publication_year":2016,"publication_date":"2016-02-22","ids":{"openalex":"https://openalex.org/W2255215184","doi":"https://doi.org/10.1145/2851141.2851173","mag":"2255215184"},"language":"en","primary_location":{"id":"doi:10.1145/2851141.2851173","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2851141.2851173","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2851141.2851173?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2851141.2851173?download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051628289","display_name":"Arunmoezhi Ramachandran","orcid":"https://orcid.org/0000-0001-7532-8383"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arunmoezhi Ramachandran","raw_affiliation_strings":["The University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"The University of Texas at Dallas","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103161933","display_name":"Neeraj Mittal","orcid":"https://orcid.org/0000-0002-8734-1400"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neeraj Mittal","raw_affiliation_strings":["The University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"The University of Texas at Dallas","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051628289"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":0.9109,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76854432,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"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.9998000264167786,"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.9998000264167786,"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.9944999814033508,"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/T12029","display_name":"DNA and Biological Computing","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7366909384727478},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.6768397688865662},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6520203351974487},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6507698893547058},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.6368684768676758},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6090367436408997},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5781490802764893},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5745411515235901},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5434818267822266},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46349310874938965},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.45695212483406067},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.4520998001098633},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.41655534505844116},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4065000116825104},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4015044569969177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3780975341796875},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.35579895973205566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26372623443603516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1548307240009308},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06798478960990906},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.059374988079071045}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7366909384727478},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6768397688865662},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6520203351974487},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6507698893547058},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.6368684768676758},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6090367436408997},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5781490802764893},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5745411515235901},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5434818267822266},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46349310874938965},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.45695212483406067},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.4520998001098633},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.41655534505844116},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4065000116825104},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4015044569969177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3780975341796875},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.35579895973205566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26372623443603516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1548307240009308},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06798478960990906},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.059374988079071045},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2851141.2851173","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2851141.2851173","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2851141.2851173?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2851141.2851173","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2851141.2851173","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2851141.2851173?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5312014006","display_name":null,"funder_award_id":"CNS-1115733","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7236704352","display_name":"CSR: Small: Collaborative Research: Improving Dependability of Multithreaded Distributed Programs","funder_award_id":"1115733","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2255215184.pdf","grobid_xml":"https://content.openalex.org/works/W2255215184.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W2018031750","https://openalex.org/W2096181137","https://openalex.org/W2115873870","https://openalex.org/W2128896110"],"related_works":["https://openalex.org/W2361906991","https://openalex.org/W2026697457","https://openalex.org/W2072157347","https://openalex.org/W3109340025","https://openalex.org/W1490902304","https://openalex.org/W2350421562","https://openalex.org/W1837592468","https://openalex.org/W2910653847","https://openalex.org/W2280371997","https://openalex.org/W2065505971"],"abstract_inverted_index":{"Binary":[0],"Search":[1],"Tree":[2],"(BST)":[3],"is":[4],"an":[5,30],"important":[6],"data":[7],"structure":[8],"for":[9,21],"managing":[10],"ordered":[11],"data.":[12],"Many":[13],"algorithms---blocking":[14],"as":[15,17],"well":[16],"non-blocking---have":[18],"been":[19],"proposed":[20],"concurrent":[22],"manipulation":[23],"of":[24,49],"a":[25,50],"binary":[26],"search":[27,51],"tree":[28],"in":[29],"asynchronous":[31],"shared":[32],"memory":[33],"system":[34],"that":[35],"supports":[36],"search,":[37],"insert":[38],"and":[39,46],"delete":[40],"operations":[41],"based":[42],"on":[43],"both":[44],"external":[45],"internal":[47],"representations":[48],"tree.":[52]},"counts_by_year":[{"year":2017,"cited_by_count":3}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}