{"id":"https://openalex.org/W2149396319","doi":"https://doi.org/10.1145/1064546.1180622","title":"Using random sampling to build approximate tries for efficient string sorting","display_name":"Using random sampling to build approximate tries for efficient string sorting","publication_year":2005,"publication_date":"2005-12-31","ids":{"openalex":"https://openalex.org/W2149396319","doi":"https://doi.org/10.1145/1064546.1180622","mag":"2149396319"},"language":"en","primary_location":{"id":"doi:10.1145/1064546.1180622","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064546.1180622","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5101502254","display_name":"Ranjan Sinha","orcid":"https://orcid.org/0000-0003-2485-8549"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ranjan Sinha","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041495909","display_name":"Justin Zobel","orcid":"https://orcid.org/0000-0001-6622-032X"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Justin Zobel","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82951845"],"apc_list":null,"apc_paid":null,"fwci":5.4651,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.95675778,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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.9959999918937683,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9887999892234802,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7484711408615112},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.7205244302749634},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.716632604598999},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6448152661323547},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6399551630020142},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5137437582015991},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46742647886276245},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45649755001068115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45135602355003357},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4475831389427185},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.28860825300216675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22615033388137817}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7484711408615112},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.7205244302749634},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.716632604598999},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6448152661323547},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6399551630020142},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5137437582015991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46742647886276245},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45649755001068115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45135602355003357},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4475831389427185},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28860825300216675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22615033388137817},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1064546.1180622","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064546.1180622","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W758438229","https://openalex.org/W1555915743","https://openalex.org/W1655990431","https://openalex.org/W1979154698","https://openalex.org/W1997688397","https://openalex.org/W1999447420","https://openalex.org/W2000484009","https://openalex.org/W2032459394","https://openalex.org/W2035721896","https://openalex.org/W2042558865","https://openalex.org/W2056014488","https://openalex.org/W2060233189","https://openalex.org/W2076747312","https://openalex.org/W2080092059","https://openalex.org/W2151005602","https://openalex.org/W2157718155","https://openalex.org/W2293095839","https://openalex.org/W2295428206","https://openalex.org/W2725179571","https://openalex.org/W2776089907","https://openalex.org/W4231916799","https://openalex.org/W4285719527","https://openalex.org/W6661423183","https://openalex.org/W6683282558"],"related_works":["https://openalex.org/W1571368810","https://openalex.org/W2506225776","https://openalex.org/W1784146144","https://openalex.org/W2379400621","https://openalex.org/W1484089092","https://openalex.org/W1558545464","https://openalex.org/W1579918296","https://openalex.org/W2174059700","https://openalex.org/W2149396319","https://openalex.org/W2060233189"],"abstract_inverted_index":{"Algorithms":[0],"for":[1],"sorting":[2],"large":[3,37],"datasets":[4],"can":[5,149],"be":[6,150],"made":[7],"more":[8,53],"efficient":[9],"with":[10,109],"careful":[11],"use":[12,89],"of":[13,21,39,80,93,111],"memory":[14,23],"hierarchies":[15],"and":[16,85],"reduction":[17],"in":[18],"the":[19,94,101,118,131],"number":[20],"costly":[22],"accesses.":[24],"In":[25,73,143],"earlier":[26],"work,":[27],"we":[28,76],"introduced":[29],"burstsort,":[30,133],"a":[31,59,71,90],"new":[32,78,119],"string-sorting":[33],"algorithm":[34],"that":[35,62,117],"on":[36],"sets":[38,110],"strings":[40,95,115],"is":[41,52,63],"almost":[42],"twice":[43],"as":[44,46],"fast":[45],"previous":[47],"algorithms,":[48],"primarily":[49],"because":[50],"it":[51],"cache":[54,126],"efficient.":[55],"Burstsort":[56],"dynamically":[57],"builds":[58],"small":[60],"trie":[61,102],"used":[64],"to":[65,70,96,100,104,124,141],"rapidly":[66],"allocate":[67],"each":[68],"string":[69],"bucket.":[72],"this":[74],"paper,":[75],"introduce":[77],"variants":[79,120],"our":[81],"algorithm:":[82],"SR-burstsort,":[83],"DR-burstsort,":[84],"DRL-burstsort.":[86],"These":[87],"algorithms":[88],"random":[91],"sample":[92],"construct":[97],"an":[98],"approximation":[99],"prior":[103],"sorting.":[105],"Our":[106],"experimental":[107],"results":[108],"over":[112],"30":[113],"million":[114],"show":[116],"reduce,":[121],"by":[122,139],"up":[123,140],"37%,":[125],"misses":[127],"further":[128,147],"than":[129],"did":[130],"original":[132],"while":[134],"simultaneously":[135],"reducing":[136],"instruction":[137],"counts":[138],"24%.":[142],"pathological":[144],"cases,":[145],"even":[146],"savings":[148],"obtained.":[151]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}