{"id":"https://openalex.org/W2035580355","doi":"https://doi.org/10.1002/spe.4380231106","title":"ISA [<i>k</i>] trees: A class of binary search trees with minimal or near minimal internal path length","display_name":"ISA [<i>k</i>] trees: A class of binary search trees with minimal or near minimal internal path length","publication_year":1993,"publication_date":"1993-11-01","ids":{"openalex":"https://openalex.org/W2035580355","doi":"https://doi.org/10.1002/spe.4380231106","mag":"2035580355"},"language":"en","primary_location":{"id":"doi:10.1002/spe.4380231106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380231106","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","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/A5067223996","display_name":"Faris N. Abuali","orcid":null},"institutions":[{"id":"https://openalex.org/I87208437","display_name":"University of Tulsa","ror":"https://ror.org/04wn28048","country_code":"US","type":"education","lineage":["https://openalex.org/I87208437"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Faris N. Abuali","raw_affiliation_strings":["Department of Mathematical and Computer Sciences, The University of Tulsa, 600 South College Avenue, Tulsa, Oklahoma 74104\u20133189, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computer Sciences, The University of Tulsa, 600 South College Avenue, Tulsa, Oklahoma 74104\u20133189, U.S.A","institution_ids":["https://openalex.org/I87208437"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110004644","display_name":"Roger L. Wainwright","orcid":null},"institutions":[{"id":"https://openalex.org/I87208437","display_name":"University of Tulsa","ror":"https://ror.org/04wn28048","country_code":"US","type":"education","lineage":["https://openalex.org/I87208437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roger L. Wainwright","raw_affiliation_strings":["Department of Mathematical and Computer Sciences, The University of Tulsa, 600 South College Avenue, Tulsa, Oklahoma 74104\u20133189, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computer Sciences, The University of Tulsa, 600 South College Avenue, Tulsa, Oklahoma 74104\u20133189, U.S.A","institution_ids":["https://openalex.org/I87208437"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067223996"],"corresponding_institution_ids":["https://openalex.org/I87208437"],"apc_list":{"value":4220,"currency":"USD","value_usd":4220},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19198591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"11","first_page":"1267","last_page":"1283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9976000189781189,"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"}},{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/successor-cardinal","display_name":"Successor cardinal","score":0.8154780268669128},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.7703019976615906},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.766810417175293},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.6734715104103088},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6046485900878906},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.586534857749939},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5821934342384338},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5692014694213867},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5423586368560791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.506070077419281},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.5030373930931091},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4662220776081085},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.43703263998031616},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4146444499492645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34644046425819397},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1685413122177124},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.10366412997245789},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.09410962462425232},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09404784440994263},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0911211371421814},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06504219770431519}],"concepts":[{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.8154780268669128},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.7703019976615906},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.766810417175293},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.6734715104103088},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6046485900878906},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.586534857749939},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5821934342384338},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5692014694213867},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5423586368560791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.506070077419281},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.5030373930931091},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4662220776081085},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.43703263998031616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4146444499492645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34644046425819397},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1685413122177124},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.10366412997245789},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.09410962462425232},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09404784440994263},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0911211371421814},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06504219770431519},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/spe.4380231106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380231106","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1965939309","https://openalex.org/W1974784305","https://openalex.org/W1997323498","https://openalex.org/W2026166434","https://openalex.org/W2041928377","https://openalex.org/W2064739871","https://openalex.org/W2082089278","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W270522628","https://openalex.org/W1973074590","https://openalex.org/W2077383771","https://openalex.org/W2149064492","https://openalex.org/W2091985989","https://openalex.org/W4367055576","https://openalex.org/W4376140277","https://openalex.org/W2038309235","https://openalex.org/W2160178218","https://openalex.org/W2157858201"],"abstract_inverted_index":{"Abstract":[0],"In":[1,16],"recent":[2],"years":[3],"several":[4],"authors":[5],"have":[6],"investigated":[7,54],"binary":[8,44,98],"search":[9,45,72,99],"trees":[10,46,100,113],"with":[11,85],"minimal":[12],"internal":[13],"path":[14],"length.":[15],"this":[17],"paper":[18],"we":[19],"propose":[20],"relaxing":[21],"the":[22,34,55,107],"requirement":[23],"of":[24,43,109],"inserting":[25],"all":[26],"nodes":[27],"on":[28],"one":[29],"level":[30],"before":[31],"going":[32],"to":[33,39],"next":[35],"level.":[36],"This":[37],"leads":[38],"a":[40],"new":[41],"class":[42],"called":[47],"ISA":[48],"[":[49],"k":[50,76,93],"]":[51,77,94],"trees.":[52,78,95],"We":[53,79],"average":[56,61,70],"locate":[57],"cost":[58,63,73],"per":[59,64],"node,":[60,65],"shift":[62],"total":[66],"insertion":[67,83],"cost,":[68],"and":[69,88],"successful":[71],"for":[74,91,114],"ISA[":[75,92],"also":[80],"present":[81],"an":[82],"algorithm":[84],"associated":[86],"predecessor":[87],"successor":[89],"functions":[90],"For":[96],"large":[97],"(over":[101],"160":[102],"nodes)":[103],"our":[104],"results":[105],"suggest":[106],"use":[108],"ISA[2]":[110],"or":[111],"ISA[3]":[112],"best":[115],"performance.":[116]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}