{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T14:17:40Z","timestamp":1765808260779,"version":"build-2065373602"},"reference-count":82,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.is.2023.102316","type":"journal-article","created":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T16:00:39Z","timestamp":1700236839000},"page":"102316","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["CoCo-trie: Data-aware compression and indexing of strings"],"prefix":"10.1016","volume":"120","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8178-135X","authenticated-orcid":false,"given":"Antonio","family":"Boffa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1353-360X","authenticated-orcid":false,"given":"Paolo","family":"Ferragina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8457-3866","authenticated-orcid":false,"given":"Francesco","family":"Tosoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0328-7791","authenticated-orcid":false,"given":"Giorgio","family":"Vinciguerra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.is.2023.102316_b1","series-title":"Proc. 22nd International Conference on World Wide Web","first-page":"583","article-title":"Space-efficient data structures for top-k completion","author":"Hsu","year":"2013"},{"key":"10.1016\/j.is.2023.102316_b2","series-title":"Proc. 43rd ACM International Conference on Research and Development in Information Retrieval","first-page":"2271","article-title":"Efficient and effective query auto-completion","author":"Gog","year":"2020"},{"key":"10.1016\/j.is.2023.102316_b3","series-title":"Proc. 14th International Conference on Web Search and Data Mining","first-page":"1020","article-title":"QueryBlazer: Efficient query autocompletion framework","author":"Kang","year":"2021"},{"key":"10.1016\/j.is.2023.102316_b4","series-title":"Proc. 12th European Semantic Web Conference","first-page":"137","article-title":"A comparison of data structures to manage URIs on the web of data","author":"Mavlyutov","year":"2015"},{"key":"10.1016\/j.is.2023.102316_b5","series-title":"Proc. ACM International Conference on Management of Data","first-page":"323","article-title":"SuRF: practical range query filtering with fast succinct tries","author":"Zhang","year":"2018"},{"key":"10.1016\/j.is.2023.102316_b6","series-title":"Proc. ACM International Conference on Management of Data","first-page":"2071","article-title":"Rosetta: a robust space-time optimized range filter for key-value stores","author":"Luo","year":"2020"},{"issue":"2","key":"10.1016\/j.is.2023.102316_b7","doi-asserted-by":"crossref","DOI":"10.1145\/1365815.1365816","article-title":"Bigtable: a distributed storage system for structured data","volume":"26","author":"Chang","year":"2008","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"10.1016\/j.is.2023.102316_b8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/2810036","article-title":"40 Years of suffix trees","volume":"59","author":"Apostolico","year":"2016","journal-title":"Commun. ACM"},{"year":"2015","series-title":"Genome-Scale Algorithm Design","author":"M\u00e4kinen","key":"10.1016\/j.is.2023.102316_b9"},{"key":"10.1016\/j.is.2023.102316_b10","series-title":"Proc. 4th International Conference on Web Search and Web Data Mining","first-page":"127","article-title":"Efficient indexing of repeated n-grams","author":"Huston","year":"2011"},{"key":"10.1016\/j.is.2023.102316_b11","series-title":"Proc. 40th ACM International Conference on Research and Development in Information Retrieval","first-page":"615","article-title":"Efficient data structures for massive N-gram datasets","author":"Pibiri","year":"2017"},{"key":"10.1016\/j.is.2023.102316_b12","series-title":"Proc. 27th ACM Symposium on Principles of Database Systems","first-page":"181","article-title":"On searching compressed string collections cache-obliviously","author":"Ferragina","year":"2008"},{"issue":"1","key":"10.1016\/j.is.2023.102316_b13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","article-title":"LSM-based storage techniques: a survey","volume":"29","author":"Luo","year":"2020","journal-title":"VLDB J."},{"year":"1998","series-title":"The Art of Computer Programming, Vol. 3","author":"Knuth","key":"10.1016\/j.is.2023.102316_b14"},{"issue":"4","key":"10.1016\/j.is.2023.102316_b15","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"PATRICIA\u2014Practical algorithm to retrieve information coded in alphanumeric","volume":"15","author":"Morrison","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/j.is.2023.102316_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3418033","article-title":"Dynamic path-decomposed tries","volume":"25","author":"Kanda","year":"2020","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"1","key":"10.1016\/j.is.2023.102316_b17","article-title":"Fast compressed tries through path decompositions","volume":"19","author":"Grossi","year":"2014","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10.1016\/j.is.2023.102316_b18","unstructured":"S. Nilsson, M. Tikkanen, Implementing a dynamic compressed trie, in: Proc. 2nd International Workshop on Algorithm Engineering, WAE, 1998, pp. 25\u201336."},{"key":"10.1016\/j.is.2023.102316_b19","series-title":"Proc. International Workshop on Algorithm Engineering and Experimentation","first-page":"300","article-title":"Adaptive algorithms for cache-efficient trie search","author":"Acharya","year":"1999"},{"issue":"5","key":"10.1016\/j.is.2023.102316_b20","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/s00778-010-0183-9","article-title":"Engineering scalable, cache and space efficient tries for strings","volume":"19","author":"Askitis","year":"2010","journal-title":"VLDB J."},{"issue":"2","key":"10.1016\/j.is.2023.102316_b21","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/506309.506312","article-title":"Burst tries: a fast, efficient data structure for string keys","volume":"20","author":"Heinz","year":"2002","journal-title":"ACM Trans. Inf. Syst."},{"issue":"9","key":"10.1016\/j.is.2023.102316_b22","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1587\/transfun.E100.A.1785","article-title":"Packed compact tries: a fast and efficient data structure for online string processing","volume":"100-A","author":"Takagi","year":"2017","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"10.1016\/j.is.2023.102316_b23","series-title":"Proc. 28th Annual Symposium on Combinatorial Pattern Matching","first-page":"6:1","article-title":"Deterministic indexing for packed strings","volume":"78","author":"Bille","year":"2017"},{"key":"10.1016\/j.is.2023.102316_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2021.104794","article-title":"c-trie++: a dynamic trie tailored for fast prefix searches","volume":"285","author":"Tsuruta","year":"2022","journal-title":"Inform. and Comput."},{"issue":"3","key":"10.1016\/j.is.2023.102316_b25","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/spe.4380230305","article-title":"Bonsai: a compact representation of trees","volume":"23","author":"Darragh","year":"1993","journal-title":"Softw. - Pract. Exp."},{"key":"10.1016\/j.is.2023.102316_b26","series-title":"Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"360","article-title":"Fast algorithms for sorting and searching strings","author":"Bentley","year":"1997"},{"key":"10.1016\/j.is.2023.102316_b27","series-title":"Proc. 7th European Conference on Computer Systems","first-page":"183","article-title":"Cache craftiness for fast multicore key-value storage","author":"Mao","year":"2012"},{"key":"10.1016\/j.is.2023.102316_b28","unstructured":"S. Yata, Dictionary compression by nesting prefix\/patricia tries, in: Proc. 17th Meeting of the Association for Natural Language, 2011."},{"key":"10.1016\/j.is.2023.102316_b29","series-title":"Proc. 29th IEEE International Conference on Data Engineering","first-page":"38","article-title":"The adaptive radix tree: ARTful indexing for main-memory databases","author":"Leis","year":"2013"},{"issue":"8","key":"10.1016\/j.is.2023.102316_b30","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1142\/S0129054118430025","article-title":"m-Bonsai: a practical compact dynamic trie","volume":"29","author":"Poyias","year":"2018","journal-title":"Internat. J. Found Comput. Sci."},{"issue":"1","key":"10.1016\/j.is.2023.102316_b31","doi-asserted-by":"crossref","first-page":"4:1","DOI":"10.1145\/1613676.1613680","article-title":"Compressing and indexing labeled trees, with applications","volume":"57","author":"Ferragina","year":"2009","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.is.2023.102316_b32","doi-asserted-by":"crossref","first-page":"10:1","DOI":"10.1145\/1868237.1868248","article-title":"The compressed permuterm index","volume":"7","author":"Ferragina","year":"2010","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"10.1016\/j.is.2023.102316_b33","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/301970.301973","article-title":"The string B-tree: a new data structure for string search in external memory and its applications","volume":"46","author":"Ferragina","year":"1999","journal-title":"J. ACM"},{"key":"10.1016\/j.is.2023.102316_b34","series-title":"Proc. 25th ACM Symposium on Principles of Database Systems","first-page":"233","article-title":"Cache-oblivious string B-trees","author":"Bender","year":"2006"},{"issue":"4","key":"10.1016\/j.is.2023.102316_b35","doi-asserted-by":"crossref","first-page":"52:1","DOI":"10.1145\/2903141","article-title":"Compressed cache-oblivious string B-tree","volume":"12","author":"Ferragina","year":"2016","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.is.2023.102316_b36","doi-asserted-by":"crossref","first-page":"74021","DOI":"10.1109\/ACCESS.2023.3295434","article-title":"On nonlinear learned string indexing","volume":"11","author":"Ferragina","year":"2023","journal-title":"IEEE Access"},{"key":"10.1016\/j.is.2023.102316_b37","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.is.2015.08.008","article-title":"Practical compressed string dictionaries","volume":"56","author":"Mart\u00ednez-Prieto","year":"2016","journal-title":"Inf. Syst."},{"issue":"7","key":"10.1016\/j.is.2023.102316_b38","doi-asserted-by":"crossref","first-page":"2012","DOI":"10.1007\/s00453-017-0348-7","article-title":"Lempel-Ziv-78 compressed string dictionaries","volume":"80","author":"Arz","year":"2018","journal-title":"Algorithmica"},{"key":"10.1016\/j.is.2023.102316_b39","series-title":"Proc. ACM International Conference on Management of Data","first-page":"521","article-title":"HOT: a height optimized trie index for main-memory database systems","author":"Binna","year":"2018"},{"key":"10.1016\/j.is.2023.102316_b40","series-title":"Proc. 28th ACM International Conference on Information and Knowledge Management","first-page":"29","article-title":"Improved compressed string dictionaries","author":"Brisaboa","year":"2019"},{"key":"10.1016\/j.is.2023.102316_b41","series-title":"Proc. ACM International Conference on Management of Data","first-page":"1567","article-title":"Reducing the storage overhead of main-memory OLTP databases with hybrid indexes","author":"Zhang","year":"2016"},{"key":"10.1016\/j.is.2023.102316_b42","series-title":"Proc. 29th International Symposium on String Processing and Information Retrieval","first-page":"233","article-title":"Compressed string dictionaries via data-aware subtrie compaction","author":"Boffa","year":"2022"},{"key":"10.1016\/j.is.2023.102316_b43","series-title":"Proc. Western Joint Computer Conference","first-page":"295","article-title":"File searching using variable length keys","author":"De La Briandais","year":"1959"},{"key":"10.1016\/j.is.2023.102316_b44","series-title":"Handbook of Data Structures and Applications","article-title":"Tries","author":"Sahni","year":"2004"},{"issue":"2","key":"10.1016\/j.is.2023.102316_b45","doi-asserted-by":"crossref","DOI":"10.1145\/3160017","article-title":"BUbiNG: massive crawling for the masses","volume":"12","author":"Boldi","year":"2018","journal-title":"ACM Trans. Web"},{"year":"2023","series-title":"Pizza&Chili corpus","key":"10.1016\/j.is.2023.102316_b46"},{"key":"10.1016\/j.is.2023.102316_b47","series-title":"Proc. 32nd International Conference on Very Large Data Bases","first-page":"1049","article-title":"The making of TPC-DS","author":"Nambiar","year":"2006"},{"key":"10.1016\/j.is.2023.102316_b48","article-title":"Theory and practice of monotone minimal perfect hashing","volume":"16","author":"Belazzougui","year":"2008","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10.1016\/j.is.2023.102316_b49","doi-asserted-by":"crossref","unstructured":"P. Ferragina, M. Rotundo, G. Vinciguerra, Engineering a Textbook Approach to Index Massive String Dictionaries, in: Proc. 30th International Symposium on String Processing and Information Retrieval, SPIRE, 2023, pp. 203\u2013217, http:\/\/dx.doi.org\/10.1007\/978-3-031-43980-3_16.","DOI":"10.1007\/978-3-031-43980-3_16"},{"year":"2002","series-title":"A 10-minute description of how Judy arrays work and why they are so fast","author":"Baskins","key":"10.1016\/j.is.2023.102316_b50"},{"issue":"9","key":"10.1016\/j.is.2023.102316_b51","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1002\/spe.4380220902","article-title":"An efficient implementation of trie structures","volume":"22","author":"Aoe","year":"1992","journal-title":"Softw. - Pract. Exp."},{"issue":"3","key":"10.1016\/j.is.2023.102316_b52","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1007\/s10115-016-0999-8","article-title":"Compressed double-array tries for string dictionaries supporting fast lookup","volume":"51","author":"Kanda","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.is.2023.102316_b53","doi-asserted-by":"crossref","unstructured":"N. Askitis, J. Zobel, Cache-Conscious Collision Resolution in String Hash Tables, in: Proc. 12th International Conference on String Processing and Information Retrieval, SPIRE, 2005, pp. 91\u2013102, http:\/\/dx.doi.org\/10.1007\/11575832_11.","DOI":"10.1007\/11575832_11"},{"key":"10.1016\/j.is.2023.102316_b54","doi-asserted-by":"crossref","unstructured":"D. Belazzougui, P. Boldi, S. Vigna, Dynamic Z-Fast Tries, in: Proc. 17th International Symposium on String Processing and Information Retrieval, SPIRE, 2010, pp. 159\u2013172, http:\/\/dx.doi.org\/10.1007\/978-3-642-16321-0_15.","DOI":"10.1007\/978-3-642-16321-0_15"},{"issue":"3","key":"10.1016\/j.is.2023.102316_b55","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"26","author":"Sleator","year":"1983","journal-title":"J. Comput. System Sci."},{"year":"2016","series-title":"Compact Data Structures: A Practical Approach","author":"Navarro","key":"10.1016\/j.is.2023.102316_b56"},{"key":"10.1016\/j.is.2023.102316_b57","series-title":"Proc. 30th IEEE Symposium on Foundations of Computer Science","first-page":"549","article-title":"Space-efficient static trees and graphs","author":"Jacobson","year":"1989"},{"year":"1994","series-title":"A Block-Sorting Lossless Data Compression Algorithm","author":"Burrows","key":"10.1016\/j.is.2023.102316_b58"},{"year":"2008","series-title":"Introduction to Information Retrieval","author":"Manning","key":"10.1016\/j.is.2023.102316_b59"},{"issue":"2","key":"10.1016\/j.is.2023.102316_b60","article-title":"Indexing highly repetitive string collections, part II: compressed indexes","volume":"54","author":"Navarro","year":"2020","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.is.2023.102316_b61","doi-asserted-by":"crossref","DOI":"10.1145\/1216370.1216372","article-title":"Compressed full-text indexes","volume":"39","author":"Navarro","year":"2007","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.is.2023.102316_b62","series-title":"Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"785","article-title":"Monotone minimal perfect hashing: searching a sorted table with O(1) accesses","author":"Belazzougui","year":"2009"},{"issue":"2","key":"10.1016\/j.is.2023.102316_b63","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/321812.321820","article-title":"Efficient storage and retrieval by content and address of static files","volume":"21","author":"Elias","year":"1974","journal-title":"J. ACM"},{"year":"1971","series-title":"On the Number of Bits Required To Implement an Associative Memory. Memo 61","author":"Fano","key":"10.1016\/j.is.2023.102316_b64"},{"key":"10.1016\/j.is.2023.102316_b65","series-title":"Proc. 19th ACM International Conference on Information and Knowledge Management","first-page":"1219","article-title":"VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming","author":"Silvestri","year":"2010"},{"key":"10.1016\/j.is.2023.102316_b66","series-title":"Proc. 37th ACM International Conference on Research and Development in Information Retrieval","first-page":"273","article-title":"Partitioned Elias-Fano indexes","author":"Ottaviano","year":"2014"},{"key":"10.1016\/j.is.2023.102316_b67","series-title":"Proc. 24th Data Compression Conference","first-page":"302","article-title":"Hybrid compression of bitvectors for the FM-index","author":"K\u00e4rkk\u00e4inen","year":"2014"},{"key":"10.1016\/j.is.2023.102316_b68","doi-asserted-by":"crossref","DOI":"10.1145\/3524060","article-title":"A learned approach to design compressed rank\/select data structures","author":"Boffa","year":"2022","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.is.2023.102316_b69","doi-asserted-by":"crossref","first-page":"118831","DOI":"10.1109\/ACCESS.2022.3221520","article-title":"Compressing and querying integer dictionaries under linearities and repetitions","volume":"10","author":"Ferragina","year":"2022","journal-title":"IEEE Access"},{"key":"10.1016\/j.is.2023.102316_b70","series-title":"Proc. 15th International Symposium on String Processing and Information Retrieval","first-page":"176","article-title":"Practical rank\/select queries over arbitrary sequences","author":"Claude","year":"2008"},{"key":"10.1016\/j.is.2023.102316_b71","series-title":"Proc. ACM International Conference on Management of Data","first-page":"775","article-title":"A general-purpose counting filter: making every bit count","author":"Pandey","year":"2017"},{"key":"10.1016\/j.is.2023.102316_b72","series-title":"Proc. 13th International Symposium on Experimental Algorithms","first-page":"326","article-title":"From theory to practice: plug and play with succinct data structures","author":"Gog","year":"2014"},{"key":"10.1016\/j.is.2023.102316_b73","series-title":"Proc. 8th ACM International Conference on Web Search and Data Mining","first-page":"47","article-title":"Optimal space-time tradeoffs for inverted indexes","author":"Ottaviano","year":"2015"},{"key":"10.1016\/j.is.2023.102316_b74","series-title":"Proc. 7th International Workshop on Experimental Algorithms","first-page":"154","article-title":"Broadword implementation of rank\/select queries","author":"Vigna","year":"2008"},{"key":"10.1016\/j.is.2023.102316_b75","doi-asserted-by":"crossref","unstructured":"F. Kurpicz, Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors, in: Proc. 29th International Symposium on String Processing and Information Retrieval, SPIRE, 2022, pp. 257\u2013272, http:\/\/dx.doi.org\/10.1007\/978-3-031-20643-6_19.","DOI":"10.1007\/978-3-031-20643-6_19"},{"key":"10.1016\/j.is.2023.102316_b76","unstructured":"M. P\u00f6ss, R.O. Nambiar, D. Walrath, Why You Should Run TPC-DS: A Workload Analysis, in: Proc. 33rd International Conference on Very Large Data Bases, VLDB, 2007, pp. 1138\u20131149."},{"issue":"4","key":"10.1016\/j.is.2023.102316_b77","first-page":"780","article-title":"Robust and budget-constrained encoding configurations for in-memory database systems","volume":"15","author":"Boissier","year":"2022","journal-title":"PVLDB"},{"issue":"5","key":"10.1016\/j.is.2023.102316_b78","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s00778-017-0480-7","article-title":"Query optimization through the looking glass, and what we found running the join order benchmark","volume":"27","author":"Leis","year":"2018","journal-title":"VLDB J."},{"year":"2008","series-title":"Database Systems: The Complete Book","author":"Garcia-Molina","key":"10.1016\/j.is.2023.102316_b79"},{"year":"2023","series-title":"ART and CART implementations","key":"10.1016\/j.is.2023.102316_b80"},{"issue":"3","key":"10.1016\/j.is.2023.102316_b81","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/comjnl\/42.3.193","article-title":"Compressing integers for fast file access","volume":"42","author":"Williams","year":"1999","journal-title":"Comput. J."},{"year":"2023","series-title":"FST implementation","key":"10.1016\/j.is.2023.102316_b82"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437923001527?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437923001527?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T15:14:00Z","timestamp":1759677240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437923001527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":82,"alternative-id":["S0306437923001527"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2023.102316","relation":{},"ISSN":["0306-4379"],"issn-type":[{"type":"print","value":"0306-4379"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"CoCo-trie: Data-aware compression and indexing of strings","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2023.102316","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102316"}}