{"id":"https://openalex.org/W2609833440","doi":"https://doi.org/10.1142/s0129054118430025","title":"m-Bonsai: A Practical Compact Dynamic Trie","display_name":"m-Bonsai: A Practical Compact Dynamic Trie","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2609833440","doi":"https://doi.org/10.1142/s0129054118430025","mag":"2609833440"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118430025","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118430025","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1704.05682","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090344282","display_name":"Andreas Poyias","orcid":null},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Andreas Poyias","raw_affiliation_strings":["Department of Informatics, University of Leicester, University Road, Leicester, LE1 7RH, United Kingdom","*University of Leicester"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Leicester, University Road, Leicester, LE1 7RH, United Kingdom","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"*University of Leicester","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021097696","display_name":"Simon J. Puglisi","orcid":"https://orcid.org/0000-0001-7668-7636"},"institutions":[{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]},{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Simon J. Puglisi","raw_affiliation_strings":["Helsinki Institute of Information Technology, Department of Computer Science, University of Helsinki, P. O. Box 68, FI-00014, Finland","Avdelningen f\u00f6r datavetenskap"],"affiliations":[{"raw_affiliation_string":"Helsinki Institute of Information Technology, Department of Computer Science, University of Helsinki, P. O. Box 68, FI-00014, Finland","institution_ids":["https://openalex.org/I32943570","https://openalex.org/I133731052"]},{"raw_affiliation_string":"Avdelningen f\u00f6r datavetenskap","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001025361","display_name":"Rajeev Raman","orcid":"https://orcid.org/0000-0001-9942-8290"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rajeev Raman","raw_affiliation_strings":["Department of Informatics, University of Leicester, University Road, Leicester, LE1 7RH, United Kingdom","*University of Leicester"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Leicester, University Road, Leicester, LE1 7RH, United Kingdom","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"*University of Leicester","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090344282"],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00437714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"08","first_page":"1257","last_page":"1278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9995999932289124,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9955999851226807,"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/trie","display_name":"Trie","score":0.852606475353241},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7627754211425781},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5133575797080994},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5059003233909607},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5011305809020996},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4863501191139221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47788846492767334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47665148973464966},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.4728189706802368},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44094738364219666},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4251830577850342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4083431363105774},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3850076496601105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35196030139923096},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12851154804229736}],"concepts":[{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.852606475353241},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7627754211425781},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5133575797080994},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5059003233909607},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5011305809020996},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4863501191139221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47788846492767334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47665148973464966},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.4728189706802368},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44094738364219666},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4251830577850342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4083431363105774},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3850076496601105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35196030139923096},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12851154804229736},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1142/s0129054118430025","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118430025","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:arXiv.org:1704.05682","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.05682","pdf_url":"https://arxiv.org/pdf/1704.05682","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2609833440","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1704.05682","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:figshare.com:article/10200821","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/m-Bonsai_a_Practical_Compact_Dynamic_Trie/10200821","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:lra.le.ac.uk:2381/42190","is_oa":true,"landing_page_url":"https://www.worldscientific.com/doi/abs/10.1142/S0129054118430025","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"doi:10.48550/arxiv.1704.05682","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1704.05682","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1704.05682","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.05682","pdf_url":"https://arxiv.org/pdf/1704.05682","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1474827441","https://openalex.org/W1597468572","https://openalex.org/W1663077732","https://openalex.org/W1848935688","https://openalex.org/W1962019683","https://openalex.org/W1986970296","https://openalex.org/W2048294592","https://openalex.org/W2051671786","https://openalex.org/W2052207834","https://openalex.org/W2065457428","https://openalex.org/W2065717636","https://openalex.org/W2088955004","https://openalex.org/W2128777897","https://openalex.org/W2135649699","https://openalex.org/W2148113067","https://openalex.org/W2165621523","https://openalex.org/W2170732565","https://openalex.org/W2279770918","https://openalex.org/W2533781300","https://openalex.org/W2570660584","https://openalex.org/W2949940210","https://openalex.org/W3048872790"],"related_works":["https://openalex.org/W2153082529","https://openalex.org/W1782136421","https://openalex.org/W2797688497","https://openalex.org/W2081155845","https://openalex.org/W3115249950","https://openalex.org/W3093219505","https://openalex.org/W2987737699","https://openalex.org/W2335996541","https://openalex.org/W3208234243","https://openalex.org/W2949162350","https://openalex.org/W2109929425","https://openalex.org/W2804894185","https://openalex.org/W2949083244","https://openalex.org/W2949224720","https://openalex.org/W1978643653","https://openalex.org/W2139639963","https://openalex.org/W2261085303","https://openalex.org/W2754152676","https://openalex.org/W2949541555","https://openalex.org/W2152916002"],"abstract_inverted_index":{"We":[0,149,206],"consider":[1],"the":[2,33,65,77,133,156,201,222],"problem":[3],"of":[4,28,92,113,135,203,210],"implementing":[5],"a":[6,18,48,89,111,160],"space-efficient":[7],"dynamic":[8],"trie,":[9],"with":[10,20,25],"an":[11,26,70,151,208],"emphasis":[12],"on":[13,76,130,198],"good":[14],"practical":[15],"performance.":[16],"For":[17],"trie":[19,50,78,161],"[Formula:":[21,30,39,73,93,102,107,124,139,164,177,183,193],"see":[22,31,40,74,94,103,108,125,140,165,178,184,194],"text]":[23,41,75,95,104,126,141,166,179,185,195],"nodes":[24],"alphabet":[27],"size":[29,79],"text],":[32],"information-theoretic":[34],"space":[35,90],"lower":[36],"bound":[37,72],"is":[38,47,97,218],"bits.":[42],"The":[43],"Bonsai":[44],"data":[45],"structure":[46],"compact":[49],"proposed":[51],"by":[52],"Darragh":[53],"et":[54],"al.":[55],"(Softw.":[56],"Pract.":[57],"Exper.":[58],"23(3)":[59],"(1993)":[60],"277\u2013291).":[61],"Its":[62],"disadvantages":[63],"include":[64],"user":[66],"having":[67],"to":[68],"specify":[69],"upper":[71],"in":[80,123,147,168,176],"advance":[81],"(which":[82,96],"cannot":[83],"be":[84],"changed":[85],"easily":[86],"after":[87],"initalization),":[88],"usage":[91],"asymptotically":[98],"non-optimal":[99],"for":[100,115,189],"smaller":[101],"or":[105],"if":[106],"text])":[109],"and":[110,120,142,170,173,182,217],"lack":[112],"support":[114],"deletions.":[116],"It":[117],"supports":[118,171],"traversal":[119,172],"update":[121,174],"operations":[122,175],"expected":[127,180,187],"time":[128,181],"(based":[129],"assumptions":[131,199],"about":[132,200],"behaviour":[134,202],"hash":[136,204],"functions),":[137],"where":[138],"has":[143],"excellent":[144],"speed":[145],"performance":[146],"practice.":[148],"propose":[150],"alternative,":[152],"m-Bonsai,":[153],"that":[154,162],"addresses":[155],"above":[157],"problems,":[158],"obtaining":[159],"uses":[163,213],"bits":[167],"expectation,":[169],"amortized":[186],"time,":[188],"any":[190],"user-specified":[191],"parameter":[192],"(again":[196],"based":[197],"functions).":[205],"give":[207],"implementation":[209],"m-Bonsai":[211],"which":[212],"considerably":[214],"less":[215],"memory":[216],"slightly":[219],"faster":[220],"than":[221],"original":[223],"Bonsai.":[224]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-02-12T00:53:03.260389","created_date":"2025-10-10T00:00:00"}