{"id":"https://openalex.org/W2005570743","doi":"https://doi.org/10.1142/s0129054103001844","title":"Supernode Binary Search Trees","display_name":"Supernode Binary Search Trees","publication_year":2003,"publication_date":"2003-06-01","ids":{"openalex":"https://openalex.org/W2005570743","doi":"https://doi.org/10.1142/s0129054103001844","mag":"2005570743"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103001844","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001844","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5014283122","display_name":"Haejae Jung","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haejae Jung","raw_affiliation_strings":["University of Florida, Gainesville, Fl. 32611, USA","University of Florida, Gainesville, FL 32611,#N#USA#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florida, Gainesville, Fl. 32611, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"University of Florida, Gainesville, FL 32611,#N#USA#N#","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj Sahni","orcid":"https://orcid.org/0000-0002-8129-1676"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sartaj Sahni","raw_affiliation_strings":["University of Florida, Gainesville, Fl. 32611, USA","University of Florida, Gainesville, FL 32611,#N#USA#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florida, Gainesville, Fl. 32611, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"University of Florida, Gainesville, FL 32611,#N#USA#N#","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014283122"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":0.9936,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81302108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"14","issue":"03","first_page":"465","last_page":"490"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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.9948999881744385,"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/T11478","display_name":"Caching and Content Delivery","score":0.9936000108718872,"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/binary-search-tree","display_name":"Binary search tree","score":0.7346116304397583},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6996447443962097},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6744997501373291},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.6231249570846558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6186721920967102},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5945935249328613},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5813525319099426},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5381221771240234},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.5024018287658691},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.4990227222442627},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43091076612472534},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.35446667671203613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3525657057762146},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3423902988433838},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3375425338745117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27232474088668823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2554115056991577},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12914690375328064},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.10660943388938904},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06887993216514587}],"concepts":[{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7346116304397583},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6996447443962097},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6744997501373291},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.6231249570846558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6186721920967102},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5945935249328613},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5813525319099426},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5381221771240234},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.5024018287658691},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.4990227222442627},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43091076612472534},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.35446667671203613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3525657057762146},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3423902988433838},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3375425338745117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27232474088668823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2554115056991577},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12914690375328064},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.10660943388938904},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06887993216514587},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054103001844","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001844","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.9004","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.9004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cise.ufl.edu/~sahni/papers/super.pdf","raw_type":"text"}],"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/W1863405838","https://openalex.org/W1996125420","https://openalex.org/W2019235922","https://openalex.org/W2029948740","https://openalex.org/W2130055503","https://openalex.org/W2326587081","https://openalex.org/W2329095262","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W2112680985","https://openalex.org/W270522628","https://openalex.org/W115779656","https://openalex.org/W2130055503","https://openalex.org/W2072924299","https://openalex.org/W2361906991","https://openalex.org/W2082860502","https://openalex.org/W1837592468","https://openalex.org/W118351421","https://openalex.org/W2080437655"],"abstract_inverted_index":{"Balanced":[0],"binary":[1,40],"search":[2,41],"tree":[3,42],"structures":[4,24,43,54],"such":[5],"as":[6],"AVL,":[7],"red-black,":[8],"and":[9,67,79],"splay":[10],"trees":[11],"store":[12],"exactly":[13],"one":[14],"element":[15],"per":[16],"node.":[17],"We":[18],"propose":[19],"supernode":[20,39,53],"versions":[21,66],"of":[22,34,38],"these":[23],"in":[25],"which":[26],"each":[27],"node":[28],"may":[29],"have":[30],"a":[31],"large":[32],"number":[33],"elements.":[35],"Some":[36],"properties":[37],"are":[44],"established.":[45],"Experiments":[46],"oonducted":[47],"by":[48,56],"us":[49,57],"show":[50],"that":[51],"the":[52,63,73],"proposed":[55],"use":[58],"less":[59,70],"space":[60],"than":[61],"do":[62],"corresponding":[64],"one-element-per-node":[65],"also":[68],"take":[69],"time":[71],"for":[72],"standard":[74],"dictionary":[75],"operations:":[76],"search,":[77],"insert":[78],"delete.":[80]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}