{"id":"https://openalex.org/W2000568570","doi":"https://doi.org/10.1145/2656332","title":"Fast Compressed Tries through Path Decompositions","display_name":"Fast Compressed Tries through Path Decompositions","publication_year":2014,"publication_date":"2014-10-21","ids":{"openalex":"https://openalex.org/W2000568570","doi":"https://doi.org/10.1145/2656332","mag":"2000568570"},"language":"en","primary_location":{"id":"doi:10.1145/2656332","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2656332","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/A5006984021","display_name":"Roberto Grossi","orcid":"https://orcid.org/0000-0002-7985-4222"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto Grossi","raw_affiliation_strings":["Universit\u00e0 di Pisa, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003288532","display_name":"Giuseppe Ottaviano","orcid":"https://orcid.org/0000-0003-1191-8258"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe Ottaviano","raw_affiliation_strings":["Universit\u00e0 di Pisa, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":4.1418,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.94138389,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","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.9998000264167786,"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.9998000264167786,"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/T12326","display_name":"Network Packet Processing and Optimization","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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9900000095367432,"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.8065190315246582},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7417823076248169},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6541062593460083},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.6472446918487549},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5972851514816284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5920892953872681},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5618372559547424},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5615752339363098},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48876023292541504},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45714902877807617},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38215339183807373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3796941637992859},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35263490676879883},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33501890301704407}],"concepts":[{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.8065190315246582},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7417823076248169},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6541062593460083},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.6472446918487549},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5972851514816284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5920892953872681},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5618372559547424},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5615752339363098},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48876023292541504},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45714902877807617},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38215339183807373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3796941637992859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35263490676879883},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33501890301704407},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2656332","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2656332","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"},{"id":"pmh:oai:arpi.unipi.it:11568/766399","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/766399","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dnet:people______::b0913d75b7c0f47188e6c46f5220c691","is_oa":false,"landing_page_url":"https://openportal.isti.cnr.it/doc?id=people______::b0913d75b7c0f47188e6c46f5220c691","pdf_url":null,"source":{"id":"https://openalex.org/S7407055261","display_name":"ISTI Open Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM journal of experimental algorithmics 19 (2014). doi:10.1145/2656332","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.7099999785423279,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W17958277","https://openalex.org/W87354433","https://openalex.org/W100509257","https://openalex.org/W1507759507","https://openalex.org/W1509727978","https://openalex.org/W1705602972","https://openalex.org/W1820209741","https://openalex.org/W1938991448","https://openalex.org/W1949346071","https://openalex.org/W1969884330","https://openalex.org/W1973883768","https://openalex.org/W1976149088","https://openalex.org/W1978270311","https://openalex.org/W1989622633","https://openalex.org/W2000273502","https://openalex.org/W2001450952","https://openalex.org/W2013291893","https://openalex.org/W2018866650","https://openalex.org/W2057223122","https://openalex.org/W2057529271","https://openalex.org/W2087361130","https://openalex.org/W2087721273","https://openalex.org/W2091307407","https://openalex.org/W2093788424","https://openalex.org/W2099649694","https://openalex.org/W2105557171","https://openalex.org/W2116365500","https://openalex.org/W2128777897","https://openalex.org/W2147344024","https://openalex.org/W2148113067","https://openalex.org/W2149243190","https://openalex.org/W2170899819","https://openalex.org/W2174889101","https://openalex.org/W2241988237","https://openalex.org/W2561675875","https://openalex.org/W3198160809","https://openalex.org/W4240241513"],"related_works":["https://openalex.org/W1539167344","https://openalex.org/W59193048","https://openalex.org/W2046569047","https://openalex.org/W2136399778","https://openalex.org/W2186419898","https://openalex.org/W2254826453","https://openalex.org/W2344633058","https://openalex.org/W2000568570","https://openalex.org/W2021988580","https://openalex.org/W4387083909"],"abstract_inverted_index":{"Tries":[0],"are":[1,14,103,135,175],"popular":[2],"data":[3,86,106],"structures":[4,87,107],"for":[5,78,123,148],"storing":[6],"a":[7,186],"set":[8],"of":[9,24,35,43,62],"strings,":[10,149],"where":[11],"common":[12,17],"prefixes":[13],"represented":[15],"by":[16,109],"root-to-node":[18],"paths.":[19],"More":[20],"than":[21,139,157,182,190],"50":[22],"years":[23],"usage":[25,54],"have":[26,127],"produced":[27],"many":[28],"variants":[29],"and":[30,46,55,73,126],"implementations":[31],"to":[32,178],"overcome":[33],"some":[34],"their":[36],"limitations.":[37],"We":[38,65],"explore":[39],"new":[40],"succinct":[41],"representations":[42],"path-decomposed":[44],"tries":[45,117,152,174],"experimentally":[47],"evaluate":[48],"the":[49,60,63,67,110,119,128,140,167],"corresponding":[50],"reduction":[51],"in":[52,94],"space":[53,95,121,187],"memory":[56],"latency,":[57],"comparing":[58],"with":[59,105,185],"state":[61],"art.":[64],"study":[66],"following":[68],"applications:":[69],"compressed":[70,81,92,116,151],"string":[71,82],"dictionary":[72],"monotone":[74,144,160],"minimal":[75,145],"perfect":[76,146,161],"hash":[77,147,162],"strings.":[79],"In":[80,143],"dictionary,":[83],"we":[84],"obtain":[85,118],"that":[88,102],"outperform":[89],"other":[90,158],"state-of-the-art":[91],"dictionaries":[93],"efficiency":[96],"while":[97,164],"obtaining":[98],"predictable":[99],"query":[100],"times":[101,134,155,180],"competitive":[104],"preferred":[108],"practitioners.":[111],"On":[112,170],"real-world":[113,171],"datasets,":[114,172],"our":[115,150,173],"smallest":[120],"(except":[122],"one":[124],"case)":[125],"fastest":[129],"lookup":[130],"times,":[131],"whereas":[132],"access":[133],"within":[136],"20%":[137],"slower":[138],"best-known":[141],"solutions.":[142],"perform":[153],"several":[154],"faster":[156,181],"trie-based":[159],"functions":[163],"occupying":[165],"nearly":[166],"same":[168],"space.":[169],"approximately":[176],"2":[177],"5":[179],"previous":[183],"solutions,":[184],"occupancy":[188],"less":[189],"10%":[191],"larger.":[192]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}