{"id":"https://openalex.org/W1507701375","doi":"https://doi.org/10.1109/icde.2015.7113370","title":"A comparison of adaptive radix trees and hash tables","display_name":"A comparison of adaptive radix trees and hash tables","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1507701375","doi":"https://doi.org/10.1109/icde.2015.7113370","mag":"1507701375"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2015.7113370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2015.7113370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 31st International Conference on Data Engineering","raw_type":"proceedings-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/A5058680237","display_name":"V\u00edctor \u00c1lvarez","orcid":"https://orcid.org/0000-0002-3014-9020"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Victor Alvarez","raw_affiliation_strings":["Information Systems Group, Saarland University","Information Systems Group, Saarland University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Group, Saarland University","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Information Systems Group, Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107467925","display_name":"Stefan Richter","orcid":"https://orcid.org/0009-0001-6269-0954"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Richter","raw_affiliation_strings":["Information Systems Group, Saarland University","Information Systems Group, Saarland University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Group, Saarland University","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Information Systems Group, Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100373718","display_name":"Xiao Chen","orcid":"https://orcid.org/0000-0002-3290-507X"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Xiao Chen","raw_affiliation_strings":["Information Systems Group, Saarland University","Information Systems Group, Saarland University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Group, Saarland University","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Information Systems Group, Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091334588","display_name":"Jens Dittrich","orcid":"https://orcid.org/0000-0003-1015-804X"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Dittrich","raw_affiliation_strings":["Information Systems Group, Saarland University","Information Systems Group, Saarland University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Group, Saarland University","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Information Systems Group, Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":2.805,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.91005993,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"1227","last_page":"1238"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7900542616844177},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.606458842754364},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5781555771827698},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5107400417327881},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5024242401123047},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.49313515424728394},{"id":"https://openalex.org/keywords/hash-tree","display_name":"Hash tree","score":0.48948824405670166},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48783615231513977},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.4463660418987274},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.42304807901382446},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4118916988372803},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39979562163352966},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37968045473098755},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.36505740880966187},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3510514199733734},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.21642687916755676},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.21271875500679016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13722258806228638},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.13148677349090576},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1250942349433899},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09385472536087036}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7900542616844177},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.606458842754364},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5781555771827698},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5107400417327881},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5024242401123047},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.49313515424728394},{"id":"https://openalex.org/C27353603","wikidata":"https://www.wikidata.org/wiki/Q16948622","display_name":"Hash tree","level":4,"score":0.48948824405670166},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48783615231513977},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4463660418987274},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.42304807901382446},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4118916988372803},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39979562163352966},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37968045473098755},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.36505740880966187},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3510514199733734},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.21642687916755676},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.21271875500679016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13722258806228638},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.13148677349090576},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1250942349433899},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09385472536087036},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2015.7113370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2015.7113370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 31st International Conference on Data Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.5699999928474426,"display_name":"No poverty"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1513903516","https://openalex.org/W1514336682","https://openalex.org/W2030062409","https://openalex.org/W2136399778","https://openalex.org/W2144399314","https://openalex.org/W2151224499","https://openalex.org/W2160404300","https://openalex.org/W2166542473","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W2752908210","https://openalex.org/W2912601938","https://openalex.org/W4205806386","https://openalex.org/W4237562791","https://openalex.org/W6744529318"],"related_works":["https://openalex.org/W2254826453","https://openalex.org/W3197499346","https://openalex.org/W2549633388","https://openalex.org/W4220937257","https://openalex.org/W1983418337","https://openalex.org/W2805849937","https://openalex.org/W2189561371","https://openalex.org/W2952141272","https://openalex.org/W2794764397","https://openalex.org/W1532196380"],"abstract_inverted_index":{"With":[0],"prices":[1],"of":[2,24,29,34,97,104,118,152,187,213,232,245,253,263,279,287,354,360,367],"main":[3,17,50],"memory":[4,51],"constantly":[5],"decreasing,":[6],"people":[7],"nowadays":[8],"are":[9,74,293,308,345],"more":[10],"interested":[11],"in":[12,16,49,52,81,87,106,234,251,352,357,365],"performing":[13],"their":[14,88,235,259],"computations":[15],"memory,":[18],"and":[19,47,131,173,199,204,255,284,333],"leave":[20],"high":[21,261],"I/O":[22],"costs":[23],"traditional":[25],"disk-based":[26,70],"systems":[27,99,138],"out":[28],"the":[30,41,62,77,93,98,109,128,141,179,185,190,193,210,230,305,348,358],"equation.":[31],"This":[32],"change":[33],"paradigm,":[35],"however,":[36],"represents":[37],"new":[38],"challenges":[39],"to":[40,54,67,79,92,223,258,295,309,347],"way":[42,78],"data":[43,59,122,134,169,306],"should":[44],"be":[45,55,249,296,310],"stored":[46],"indexed":[48],"order":[53],"processed":[56],"efficiently.":[57],"Traditional":[58],"structures,":[60],"like":[61,171],"venerable":[63],"B-tree,":[64],"were":[65],"designed":[66],"work":[68],"on":[69,120,317],"systems,":[71,83],"but":[72,242],"they":[73,100],"no":[75],"longer":[76],"go":[80],"main-memory":[82,125,137],"at":[84],"least":[85],"not":[86,178,207,363],"original":[89],"form,":[90],"due":[91,257],"poor":[94],"cache":[95],"utilization":[96],"run":[101],"on.":[102],"Because":[103],"this,":[105],"particular,":[107],"during":[108],"last":[110],"decade":[111],"there":[112,139],"has":[113],"been":[114],"a":[115,162,200,218,238,270,313,323],"considerable":[116],"amount":[117],"research":[119],"index":[121,315,325],"structures":[123,135,170,307],"for":[124,136,148,197],"systems.":[126],"Among":[127],"most":[129,132],"recent":[130,167],"interesting":[133],"is":[140],"recently-proposed":[142],"adaptive":[143,181],"radix":[144,182],"tree":[145],"ARTful":[146],"(ART":[147],"short).":[149],"The":[150,225],"authors":[151,231],"ART":[153,159,176,203,233,342],"presented":[154],"experiments":[155,214,337],"that":[156,158,216,340],"indicate":[157,339],"was":[160,177,192,206,221,237],"clearly":[161],"better":[163],"choice":[164],"over":[165],"other":[166],"tree-based":[168],"FAST":[172],"B+-trees.":[174],"However,":[175],"first":[180,191],"tree.":[183],"To":[184],"best":[186],"our":[188,300],"knowledge,":[189],"Judy":[194,205,344],"Array":[195],"(Judy":[196],"short),":[198],"comparison":[201,273],"between":[202,274],"shown.":[208],"Moreover,":[209],"same":[211],"set":[212],"indicated":[215],"only":[217],"hash":[219,226,240,246],"table":[220,227],"competitive":[222,346],"ART.":[224],"used":[228,311],"by":[229],"study":[236,301],"chained":[239],"table,":[241],"this":[243,266],"kind":[244],"tables":[247],"can":[248],"suboptimal":[250],"terms":[252,353,366],"space":[254],"performance":[256],"potentially":[260],"use":[262],"pointers.":[264],"In":[265],"paper":[267],"we":[268,302],"present":[269],"thorough":[271],"experimental":[272],"ART,":[275,361],"Judy,":[276],"two":[277],"variants":[278,286],"hashing":[280,291,350],"via":[281],"quadratic":[282],"probing,":[283],"three":[285],"Cuckoo":[288],"hashing.":[289],"These":[290],"schemes":[292,351],"known":[294],"very":[297],"efficient.":[298],"For":[299],"consider":[303,330],"whether":[304],"as":[312,322],"non-covering":[314],"(relying":[316],"an":[318],"additional":[319],"store),":[320],"or":[321],"covering":[324],"(covering":[326],"key-value":[327],"pairs).":[328],"We":[329],"both":[331],"OLAP":[332],"OLTP":[334],"scenarios.":[335],"Our":[336],"strongly":[338],"neither":[341],"nor":[343],"aforementioned":[349],"performance,":[355],"and,":[356],"case":[359],"sometimes":[362],"even":[364],"space.":[368]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}