{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:26:10Z","timestamp":1742919970108,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206429"},{"type":"electronic","value":"9783031206436"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20643-6_17","type":"book-chapter","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:18:09Z","timestamp":1667222289000},"page":"233-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Compressed String Dictionaries via Data-Aware Subtrie Compaction"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2022,11,1]]},"reference":[{"key":"17_CR1","unstructured":"ART and CART implementations. https:\/\/github.com\/efficient\/fast-succinct-trie\/tree\/master\/third-party\/art. Accessed June 2022"},{"key":"17_CR2","unstructured":"FST implementation. https:\/\/github.com\/kampersanda\/fast_succinct_trie. Accessed June 2022"},{"key":"17_CR3","unstructured":"Pizza &Chili corpus. http:\/\/pizzachili.dcc.uchile.cl\/texts.html. Accessed June 2022"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-48518-X_18","volume-title":"Algorithm Engineering and Experimentation","author":"A Acharya","year":"1999","unstructured":"Acharya, A., Zhu, H., Shen, K.: Adaptive algorithms for cache-efficient trie search. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol. 1619, pp. 300\u2013315. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48518-X_18"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/2810036","volume":"59","author":"A Apostolico","year":"2016","unstructured":"Apostolico, A., Crochemore, M., Farach-Colton, M., Galil, Z., Muthukrishnan, S.: 40 years of suffix trees. Commun. ACM 59(4), 66\u201373 (2016). https:\/\/doi.org\/10.1145\/2810036","journal-title":"Commun. ACM"},{"issue":"7","key":"17_CR6","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1007\/s00453-017-0348-7","volume":"80","author":"J Arz","year":"2017","unstructured":"Arz, J., Fischer, J.: Lempel\u2013Ziv-78 compressed string dictionaries. Algorithmica 80(7), 2012\u20132047 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0348-7","journal-title":"Algorithmica"},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00778-010-0183-9","volume":"19","author":"N Askitis","year":"2010","unstructured":"Askitis, N., Sinha, R.: Engineering scalable, cache and space efficient tries for strings. VLDB J. 19(5), 633\u2013660 (2010). https:\/\/doi.org\/10.1007\/s00778-010-0183-9","journal-title":"VLDB J."},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M., Kuszmaul, B.C.: Cache-oblivious String B-trees. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), pp. 233\u2013242 (2006). https:\/\/doi.org\/10.1145\/1142351.1142385","DOI":"10.1145\/1142351.1142385"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 360\u2013369 (1997). https:\/\/doi.org\/10.5555\/314161.314321","DOI":"10.5555\/314161.314321"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Bille, P., G\u00f8rtz, I.L., Skjoldjensen, F.R.: Deterministic indexing for packed strings. In: Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM), vol. 78, pp. 6:1\u20136:11 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.6","DOI":"10.4230\/LIPIcs.CPM.2017.6"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Binna, R., Zangerle, E., Pichl, M., Specht, G., Leis, V.: HOT: a height optimized trie index for main-memory database systems. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 521\u2013534 (2018). https:\/\/doi.org\/10.1145\/3183713.3196896","DOI":"10.1145\/3183713.3196896"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Boffa, A., Ferragina, P., Vinciguerra, G.: A learned approach to design compressed rank\/select data structures. ACM Trans. Algorithms (2022). https:\/\/doi.org\/10.1145\/3524060","DOI":"10.1145\/3524060"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: Proceedings of the 13th International World Wide Web Conference (WWW), pp. 595\u2013601 (2004). https:\/\/law.di.unimi.it\/webdata\/it-2004\/","DOI":"10.1145\/988672.988752"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Brisaboa, N.R., Cerdeira-Pena, A., de Bernardo, G., Navarro, G.: Improved compressed string dictionaries. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM), pp. 29\u201338 (2019). https:\/\/doi.org\/10.1145\/3357384.3357972","DOI":"10.1145\/3357384.3357972"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/spe.4380230305","volume":"23","author":"JJ Darragh","year":"1993","unstructured":"Darragh, J.J., Cleary, J.G., Witten, I.H.: Bonsai: a compact representation of trees. Softw. Pract. Exp. 23(3), 277\u2013291 (1993). https:\/\/doi.org\/10.1002\/spe.4380230305","journal-title":"Softw. Pract. Exp."},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246\u2013260 (1974). https:\/\/doi.org\/10.1145\/321812.321820","journal-title":"J. ACM"},{"key":"17_CR17","unstructured":"Fano, R.M.: On the number of bits required to implement an associative memory. Memo 61. Massachusetts Institute of Technology, Project MAC (1971)"},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The String B-tree: a new data structure for string search in external memory and its applications. J. ACM 46(2), 236\u2013280 (1999). https:\/\/doi.org\/10.1145\/301970.301973","journal-title":"J. ACM"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Grossi, R., Gupta, A., Shah, R., Vitter, J.S.: On searching compressed string collections cache-obliviously. In: Proceedings of the 27th ACM Symposium on Principles of Database Systems (PODS), pp. 181\u2013190 (2008). https:\/\/doi.org\/10.1145\/1376916.1376943","DOI":"10.1145\/1376916.1376943"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1613676.1613680","volume":"57","author":"P Ferragina","year":"2009","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57(1), 1\u201333 (2009). https:\/\/doi.org\/10.1145\/1613676.1613680","journal-title":"J. ACM"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1868237.1868248","volume":"7","author":"P Ferragina","year":"2010","unstructured":"Ferragina, P., Venturini, R.: The compressed Permuterm index. ACM Trans. Algorithms 7(1), 1\u201321 (2010). https:\/\/doi.org\/10.1145\/1868237.1868248","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2903141","volume":"12","author":"P Ferragina","year":"2016","unstructured":"Ferragina, P., Venturini, R.: Compressed cache-oblivious String B-tree. ACM Trans. Algorithms 12(4), 1\u201317 (2016). https:\/\/doi.org\/10.1145\/2903141","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Gog, S., Pibiri, G.E., Venturini, R.: Efficient and effective query auto-completion. In: Proceedings of the 43rd ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp. 2271\u20132280 (2020). https:\/\/doi.org\/10.1145\/3397271.3401432","DOI":"10.1145\/3397271.3401432"},{"issue":"1","key":"17_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2656332","volume":"19","author":"R Grossi","year":"2014","unstructured":"Grossi, R., Ottaviano, G.: Fast compressed tries through path decompositions. ACM J. Exp. Algorithmics 19(1), 1 (2014). https:\/\/doi.org\/10.1145\/2656332","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/506309.506312","volume":"20","author":"S Heinz","year":"2002","unstructured":"Heinz, S., Zobel, J., Williams, H.E.: Burst tries: a fast, efficient data structure for string keys. ACM Trans. Inf. Syst. 20(2), 192\u2013223 (2002). https:\/\/doi.org\/10.1145\/506309.506312","journal-title":"ACM Trans. Inf. Syst."},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Hsu, B.J.P., Ottaviano, G.: Space-efficient data structures for Top-$$k$$ completion. In: Proceedings of the 22nd International Conference on World Wide Web (WWW), pp. 583\u2013594 (2013). https:\/\/doi.org\/10.1145\/2488388.2488440","DOI":"10.1145\/2488388.2488440"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Huston, S.J., Moffat, A., Croft, W.B.: Efficient indexing of repeated n-grams. In: Proceedings of the 4th International Conference on Web Search and Web Data Mining (WSDM), pp. 127\u2013136 (2011). https:\/\/doi.org\/10.1145\/1935826.1935857","DOI":"10.1145\/1935826.1935857"},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3418033","volume":"25","author":"S Kanda","year":"2020","unstructured":"Kanda, S., K\u00f6ppl, D., Tabei, Y., Morita, K., Fuketa, M.: Dynamic path-decomposed tries. ACM J. Exp. Algorithmics 25, 1\u201328 (2020). https:\/\/doi.org\/10.1145\/3418033","journal-title":"ACM J. Exp. Algorithmics"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Kang, Y.M., Liu, W., Zhou, Y.: QueryBlazer: efficient query autocompletion framework. In: Proceedings of the 14th International Conference on Web Search and Data Mining (WSDM), pp. 1020\u20131028 (2021). https:\/\/doi.org\/10.1145\/3437963.3441725","DOI":"10.1145\/3437963.3441725"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Hybrid compression of bitvectors for the FM-index. In: Proceedings of the 24th Data Compression Conference (DCC), pp. 302\u2013311 (2014). https:\/\/doi.org\/10.1109\/DCC.2014.87","DOI":"10.1109\/DCC.2014.87"},{"key":"17_CR31","unstructured":"Knuth, D.E.: The art of computer programming, vol. 3. 2 edn. Addison-Wesley (1998)"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE), pp. 38\u201349 (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544812","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"17_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139940023","volume-title":"Genome-Scale Algorithm Design","author":"V M\u00e4kinen","year":"2015","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design. Cambridge University Press, Cambridge (2015)"},{"key":"17_CR34","doi-asserted-by":"publisher","unstructured":"Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: Proceedings of the 7th European Conference on Computer Systems (EuroSys), pp. 183\u2013196 (2012). https:\/\/doi.org\/10.1145\/2168836.2168855","DOI":"10.1145\/2168836.2168855"},{"key":"17_CR35","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.is.2015.08.008","volume":"56","author":"MA Mart\u00ednez-Prieto","year":"2016","unstructured":"Mart\u00ednez-Prieto, M.A., Brisaboa, N.R., C\u00e1novas, R., Claude, F., Navarro, G.: Practical compressed string dictionaries. Inf. Syst. 56, 73\u2013108 (2016). https:\/\/doi.org\/10.1016\/j.is.2015.08.008","journal-title":"Inf. Syst."},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Mavlyutov, R., Wylot, M., Cudr\u00e9-Mauroux, P.: A comparison of data structures to manage URIs on the web of data. In: Proceedings of the 12th European Semantic Web Conference (ESWC), pp. 137\u2013151 (2015). https:\/\/doi.org\/10.1007\/978-3-319-18818-8_9","DOI":"10.1007\/978-3-319-18818-8_9"},{"issue":"4","key":"17_CR37","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"DR Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA-practical algorithm to retrieve information coded in alphanumeric. J. ACM 15(4), 514\u2013534 (1968). https:\/\/doi.org\/10.1145\/321479.321481","journal-title":"J. ACM"},{"key":"17_CR38","unstructured":"Nambiar, R.O., Poess, M.: The making of TPC-DS. In: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), pp. 1049\u20131058 (2006). http:\/\/www.tpc.org\/tpcds\/"},{"key":"17_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284","volume-title":"Compact Data Structures: A Practical Approach","author":"G Navarro","year":"2016","unstructured":"Navarro, G.: Compact Data Structures: A Practical Approach. Cambridge University Press, NY (2016)"},{"key":"17_CR40","unstructured":"Nilsson, S., Tikkanen, M.: Implementing a dynamic compressed trie. In: Proceedings of the 2nd International Workshop on Algorithm Engineering (WAE), pp. 25\u201336 (1998)"},{"key":"17_CR41","doi-asserted-by":"publisher","unstructured":"Ottaviano, G., Venturini, R.: Partitioned Elias-Fano indexes. In: Proceedings of the 37th ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp. 273\u2013282 (2014). https:\/\/doi.org\/10.1145\/2600428.2609615","DOI":"10.1145\/2600428.2609615"},{"key":"17_CR42","doi-asserted-by":"publisher","unstructured":"Pibiri, G.E., Venturini, R.: Efficient data structures for massive n-gram datasets. In: Proceedings of the 40th ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp. 615\u2013624 (2017). https:\/\/doi.org\/10.1145\/3077136.3080798","DOI":"10.1145\/3077136.3080798"},{"issue":"8","key":"17_CR43","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1142\/S0129054118430025","volume":"29","author":"A Poyias","year":"2018","unstructured":"Poyias, A., Puglisi, S.J., Raman, R.: m-Bonsai: a practical compact dynamic trie. Int. J. Found. Comput. Sci. 29(8), 1257\u20131278 (2018). https:\/\/doi.org\/10.1142\/S0129054118430025","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR44","doi-asserted-by":"publisher","unstructured":"Silvestri, F., Venturini, R.: VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM), pp. 1219\u20131228 (2010). https:\/\/doi.org\/10.1145\/1871437.1871592","DOI":"10.1145\/1871437.1871592"},{"issue":"9","key":"17_CR45","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1587\/transfun.E100.A.1785","volume":"100","author":"T Takagi","year":"2017","unstructured":"Takagi, T., Inenaga, S., Sadakane, K., Arimura, H.: Packed compact tries: a fast and efficient data structure for online string processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100(9), 1785\u20131793 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.1785","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"17_CR46","doi-asserted-by":"publisher","unstructured":"Tsuruta, K., et al.: c-Trie++: a dynamic trie tailored for fast prefix searches. In: Proceedings of the 30th Data Compression Conference (DCC), pp. 243\u2013252 (2020). https:\/\/doi.org\/10.1109\/DCC47342.2020.00032","DOI":"10.1109\/DCC47342.2020.00032"},{"issue":"3","key":"17_CR47","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/42.3.193","volume":"42","author":"HE Williams","year":"1999","unstructured":"Williams, H.E., Zobel, J.: Compressing integers for fast file access. Comput. J. 42(3), 193\u2013201 (1999). https:\/\/doi.org\/10.1093\/comjnl\/42.3.193","journal-title":"Comput. J."},{"key":"17_CR48","unstructured":"Yata, S.: Dictionary compression by nesting prefix\/patricia tries. In: Proceedings of the 17th Meeting of the Association for Natural Language (2011)"},{"key":"17_CR49","doi-asserted-by":"publisher","unstructured":"Zhang, H., Andersen, D.G., Pavlo, A., Kaminsky, M., Ma, L., Shen, R.: Reducing the storage overhead of main-memory OLTP databases with hybrid indexes. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 1567\u20131581 (2016). https:\/\/doi.org\/10.1145\/2882903.2915222","DOI":"10.1145\/2882903.2915222"},{"key":"17_CR50","doi-asserted-by":"publisher","unstructured":"Zhang, H., et al.: SuRF: practical range query filtering with fast succinct tries. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 323\u2013336 (2018). https:\/\/doi.org\/10.1145\/3183713.3196931","DOI":"10.1145\/3183713.3196931"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20643-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:20:08Z","timestamp":1667222408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20643-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206429","9783031206436"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20643-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2022.inf.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.62","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}