{"id":"https://openalex.org/W2153082529","doi":"https://doi.org/10.1145/2484239.2484270","title":"The SkipTrie","display_name":"The SkipTrie","publication_year":2013,"publication_date":"2013-07-16","ids":{"openalex":"https://openalex.org/W2153082529","doi":"https://doi.org/10.1145/2484239.2484270","mag":"2153082529"},"language":"en","primary_location":{"id":"doi:10.1145/2484239.2484270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2484239.2484270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/90889","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083335403","display_name":"Rotem Oshman","orcid":"https://orcid.org/0009-0007-5065-5557"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Rotem Oshman","raw_affiliation_strings":["University of Toronto, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037659256","display_name":"Nir Shavit","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nir Shavit","raw_affiliation_strings":["Massachusettes Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusettes Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083335403"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":4.1798,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.94727053,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"32"},"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.9997000098228455,"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.9997000098228455,"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.9965000152587891,"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.9819999933242798,"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.818776547908783},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.7747753262519836},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6380163431167603},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6355211734771729},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6091979146003723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6084268093109131},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5956004858016968},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.50510174036026},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.45745033025741577},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4571613371372223},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.45031100511550903},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44325515627861023},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4305275082588196},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.4209159314632416},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40877658128738403},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3473663032054901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34705376625061035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3362661302089691},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.20223063230514526},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07397228479385376}],"concepts":[{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.818776547908783},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7747753262519836},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6380163431167603},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6355211734771729},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6091979146003723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6084268093109131},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5956004858016968},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.50510174036026},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.45745033025741577},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4571613371372223},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.45031100511550903},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44325515627861023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4305275082588196},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4209159314632416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40877658128738403},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3473663032054901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34705376625061035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3362661302089691},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.20223063230514526},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07397228479385376},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2484239.2484270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2484239.2484270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/90889","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/90889","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/90889","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/90889","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4252671323","display_name":"SHF: Small: Multicore Data-Structures: Relaxed, Flat, and Randomized","funder_award_id":"1217921","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5657873558","display_name":null,"funder_award_id":"ER26116/DE-SC0008923","funder_id":"https://openalex.org/F4320337506","funder_display_name":"Advanced Scientific Computing Research"},{"id":"https://openalex.org/G8073515163","display_name":null,"funder_award_id":"DE-SC0008923","funder_id":"https://openalex.org/F4320337506","funder_display_name":"Advanced Scientific Computing Research"},{"id":"https://openalex.org/G8693430560","display_name":null,"funder_award_id":"CCF-1217921","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"},{"id":"https://openalex.org/F4320337506","display_name":"Advanced Scientific Computing Research","ror":"https://ror.org/0012c7r22"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W146693149","https://openalex.org/W1520380662","https://openalex.org/W1606621385","https://openalex.org/W1970345854","https://openalex.org/W1975301927","https://openalex.org/W1983056589","https://openalex.org/W1983572666","https://openalex.org/W2029881550","https://openalex.org/W2060771324","https://openalex.org/W2062678317","https://openalex.org/W2070991879","https://openalex.org/W2090021115","https://openalex.org/W2114270824","https://openalex.org/W2115264714","https://openalex.org/W2119251905","https://openalex.org/W2125712182","https://openalex.org/W2132734890","https://openalex.org/W2136651966","https://openalex.org/W2170146741","https://openalex.org/W2172192453","https://openalex.org/W2913334236","https://openalex.org/W4236393595","https://openalex.org/W6646522387"],"related_works":["https://openalex.org/W1539167344","https://openalex.org/W2130055503","https://openalex.org/W2344633058","https://openalex.org/W2487079816","https://openalex.org/W2428232282","https://openalex.org/W2565735338","https://openalex.org/W1988981363","https://openalex.org/W4233481513","https://openalex.org/W2139715833","https://openalex.org/W2362352966"],"abstract_inverted_index":{"To":[0,122],"date,":[1],"all":[2],"concurrent":[3,28],"search":[4,29],"structures":[5],"that":[6],"can":[7,116],"support":[8],"predecessor":[9,32],"queries":[10,33],"have":[11],"had":[12],"depth":[13],"logarithmic":[14],"in":[15,34,46],"m,":[16],"the":[17,24,58,61,67,70,106,111,123,131,136,139],"number":[18],"of":[19,60,79,84,125,130,135],"elements.":[20],"This":[21],"paper":[22],"introduces":[23],"SkipTrie,":[25],"a":[26,76,80,85,97,118,144],"new":[27],"structure":[30],"supporting":[31],"amortized":[35,132],"expected":[36,133],"O(log":[37],"log":[38,48,49],"u":[39,56],"+":[40],"c)":[41],"steps,":[42],"insertions":[43],"and":[44,51,64,115],"deletions":[45],"O(c":[47],"u),":[50],"using":[52],"O(m)":[53],"space,":[54],"where":[55],"is":[57,66,75,138],"size":[59],"key":[62],"space":[63],"c":[65],"contention":[68],"during":[69],"recent":[71],"past.":[72],"The":[73],"SkipTrie":[74,137],"probabilistically-balanced":[77],"version":[78],"y-fast":[81],"trie":[82],"consisting":[83],"very":[86],"shallow":[87],"skiplist":[88],"from":[89],"which":[90],"randomly":[91],"chosen":[92],"elements":[93],"are":[94],"inserted":[95],"into":[96,105],"hash-table":[98],"based":[99],"x-fast":[100],"trie.":[101],"By":[102],"inserting":[103],"keys":[104],"x-fast-trie":[107],"probabilistically,":[108],"we":[109],"eliminate":[110],"need":[112],"for":[113,143],"rebalancing,":[114],"provide":[117],"lock-free":[119],"linearizable":[120],"implementation.":[121],"best":[124],"our":[126,128],"knowledge,":[127],"proof":[129,142],"performance":[134],"first":[140],"such":[141],"tree-based":[145],"data":[146],"structure.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}