{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:56:29Z","timestamp":1759683389654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_16","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"203-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Engineering a\u00a0Textbook Approach to\u00a0Index Massive String Dictionaries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1353-360X","authenticated-orcid":false,"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1671-7407","authenticated-orcid":false,"given":"Mariagiovanna","family":"Rotundo","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":[[2023,9,20]]},"reference":[{"issue":"10","key":"16_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/3183558","volume":"61","author":"J Abramatic","year":"2018","unstructured":"Abramatic, J., Di Cosmo, R., Zacchiroli, S.: Building the universal archive of source code. Commun. ACM 61(10), 29\u201331 (2018). https:\/\/doi.org\/10.1145\/3183558","journal-title":"Commun. ACM"},{"key":"16_CR2","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"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Arz, J., Fischer, J.: LZ-compressed string dictionaries. In: Proceedings of the 24th Data Compression Conference (DCC), pp. 322\u2013331 (2014). https:\/\/doi.org\/10.1109\/DCC.2014.36","DOI":"10.1109\/DCC.2014.36"},{"key":"16_CR4","unstructured":"Baskins, D.: A 10-minute description of how Judy arrays work and why they are so fast (2002). http:\/\/judy.sourceforge.net\/doc\/10minutes.htm"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275\u2013292 (2005). https:\/\/doi.org\/10.1007\/s00453-004-1146-6","journal-title":"Algorithmica"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Boffa, A., Ferragina, P., Tosoni, F., Vinciguerra, G.: Compressed string dictionaries via data-aware subtrie compaction. In: Arroyuelo, D., Poblete, B. (eds.) SPIRE 2022. LNCS, vol. 13617, pp. 233\u2013249. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20643-6_17. Implementation available at https:\/\/github.com\/aboffa\/CoCo-trie","DOI":"10.1007\/978-3-031-20643-6_17"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Boffa, A., Ferragina, P., Vinciguerra, G.: A learned approach to design compressed rank\/select data structures. ACM Trans. Algorithms 18(3) (2022). https:\/\/doi.org\/10.1145\/3524060","DOI":"10.1145\/3524060"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Boldi, P., Marino, A., Santini, M., Vigna, S.: BUbiNG: massive crawling for the masses. ACM Trans. Web 12(2), 12:1\u201312:26 (2018). https:\/\/doi.org\/10.1145\/3160017. Datasets of URLs available at https:\/\/law.di.unimi.it\/datasets.php","DOI":"10.1145\/3160017"},{"issue":"12","key":"16_CR9","doi-asserted-by":"publisher","first-page":"2649","DOI":"10.14778\/3407790.3407851","volume":"13","author":"P Boncz","year":"2020","unstructured":"Boncz, P., Neumann, T., Leis, V.: FSST: fast random access string compression. PVLDB 13(12), 2649\u20132661 (2020). https:\/\/doi.org\/10.14778\/3407790.3407851","journal-title":"PVLDB"},{"key":"16_CR10","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"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Chikhi, R., Holub, J., Medvedev, P.: Data structures to represent a set of $$k$$-long DNA sequences. ACM Comput. Surv. 54(1) (2021). https:\/\/doi.org\/10.1145\/3445967","DOI":"10.1145\/3445967"},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF00985662","volume":"2","author":"JL Clark","year":"1973","unstructured":"Clark, J.L.: PATRICIA-II. Two-level overlaid indexes for large libraries. Int. J. Parallel Program. 2(4), 269\u2013292 (1973). https:\/\/doi.org\/10.1007\/BF00985662","journal-title":"Int. J. Parallel Program."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-16802-4_1","volume-title":"Linking Theory and Practice of Digital Libraries","author":"R Di Cosmo","year":"2022","unstructured":"Di Cosmo, R.: Should we preserve the world\u2019s software history, and can we? In: Silvello, G., et al. (eds.) TPDL 2022. LNCS, vol. 13541, pp. 3\u20137. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16802-4_1"},{"key":"16_CR14","unstructured":"Di Cosmo, R., Zacchiroli, S.: Software Heritage: why and how to preserve software source code. In: Proceedings of the 14th International Conference on Digital Preservation (iPRES) (2017). https:\/\/hdl.handle.net\/11353\/10.931064"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Ferragina, P.: Pearls of Algorithm Engineering. Cambridge University Press (2023). https:\/\/doi.org\/10.1017\/9781009128933","DOI":"10.1017\/9781009128933"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"74021","DOI":"10.1109\/ACCESS.2023.3295434","volume":"11","author":"P Ferragina","year":"2023","unstructured":"Ferragina, P., Frasca, M., Marin\u00f2, G.C., Vinciguerra, G.: On nonlinear learned string indexing. IEEE Access 11, 74021\u201374034 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3295434","journal-title":"IEEE Access"},{"issue":"2","key":"16_CR17","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":"16_CR18","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":"3\u20134","key":"16_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/PL00008259","volume":"24","author":"P Ferragina","year":"1999","unstructured":"Ferragina, P., Luccio, F.: String search in coarse-grained parallel computers. Algorithmica 24(3\u20134), 177\u2013194 (1999). https:\/\/doi.org\/10.1007\/PL00008259","journal-title":"Algorithmica"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"118831","DOI":"10.1109\/ACCESS.2022.3221520","volume":"10","author":"P Ferragina","year":"2022","unstructured":"Ferragina, P., Manzini, G., Vinciguerra, G.: Compressing and querying integer dictionaries under linearities and repetitions. IEEE Access 10, 118831\u2013118848 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3221520","journal-title":"IEEE Access"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Venturini, R.: Compressed cache-oblivious string B-tree. ACM Trans. Algorithms 12(4), 52:1\u201352:17 (2016). https:\/\/doi.org\/10.1145\/2903141","DOI":"10.1145\/2903141"},{"issue":"9","key":"16_CR22","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Commun. ACM 3(9), 490\u2013499 (1960). https:\/\/doi.org\/10.1145\/367390.367400","journal-title":"Commun. ACM"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07959-2_28"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Grossi, R., Ottaviano, G.: Fast compressed tries through path decompositions. ACM J. Exp. Algorithmics 19 (2015). https:\/\/doi.org\/10.1145\/2656332. Implementation available at https:\/\/github.com\/ot\/path_decomposed_tries","DOI":"10.1145\/2656332"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 549\u2013554 (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63533","DOI":"10.1109\/SFCS.1989.63533"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-30850-5_20","volume-title":"Experimental Algorithms","author":"S Joannou","year":"2012","unstructured":"Joannou, S., Raman, R.: Dynamizing succinct tree representations. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 224\u2013235. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30850-5_20"},{"key":"16_CR27","unstructured":"Joulin, A., Grave, E., Bojanowski, P., Douze, M., J\u00e9gou, H., Mikolov, T.: Fasttext.zip: compressing text classification models. CoRR abs\/1612.03651 (2016). http:\/\/arxiv.org\/abs\/1612.03651"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Krishnan, U., Moffat, A., Zobel, J.: A taxonomy of query auto completion modes. In: Proceedings of the 22nd Australasian Document Computing Symposium (ADCS) (2017). https:\/\/doi.org\/10.1145\/3166072.3166081","DOI":"10.1145\/3166072.3166081"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-031-20643-6_19","volume-title":"String Processing and Information Retrieval","author":"F Kurpicz","year":"2022","unstructured":"Kurpicz, F.: Engineering compact data structures for rank and select queries on bit vectors. In: Arroyuelo, D., Poblete, B. (eds.) SPIRE 2022. LNCS, vol. 13617, pp. 257\u2013272. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20643-6_19"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Lasch, R., Oukid, I., Dementiev, R., May, N., Demirsoy, S.S., Sattler, K.: Fast & strong: the case of compressed string dictionaries on modern CPUs. In: Proceedings of the 15th International Workshop on Data Management on New Hardware (DaMoN), pp. 4:1\u20134:10 (2019). https:\/\/doi.org\/10.1145\/3329785.3329924","DOI":"10.1145\/3329785.3329924"},{"key":"16_CR31","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":"16_CR32","unstructured":"Lorentz, V., Di Cosmo, R., Zacchiroli, S.: The popular content filenames dataset: deriving most likely filenames from the Software Heritage archive. Technical report (2023). https:\/\/inria.hal.science\/hal-04171177, preprint"},{"issue":"1","key":"16_CR33","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","volume":"29","author":"C Luo","year":"2019","unstructured":"Luo, C., Carey, M.J.: LSM-based storage techniques: a survey. VLDB J. 29(1), 393\u2013418 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00555-y","journal-title":"VLDB J."},{"key":"16_CR34","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":"16_CR35","unstructured":"Meta Platforms Inc.: RocksDB. https:\/\/rocksdb.org\/"},{"issue":"4","key":"16_CR36","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"DR Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA\u2014practical 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":"16_CR37","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Compact Data Structures: A Practical Approach. Cambridge University Press (2016). https:\/\/doi.org\/10.1017\/CBO9781316588284","DOI":"10.1017\/CBO9781316588284"},{"issue":"4","key":"16_CR38","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"PE O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P.E., Cheng, E., Gawlick, D., O\u2019Neil, E.J.: The log-structured merge-tree (LSM-tree). Acta Informatica 33(4), 351\u2013385 (1996). https:\/\/doi.org\/10.1007\/s002360050048","journal-title":"Acta Informatica"},{"key":"16_CR39","volume-title":"Operating System Concepts","author":"A Silberschatz","year":"2018","unstructured":"Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts, 10th edn. Wiley, Hoboken (2018)","edition":"10"},{"key":"16_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104794","volume":"285","author":"K Tsuruta","year":"2022","unstructured":"Tsuruta, K., et al.: C-trie++: a dynamic trie tailored for fast prefix searches. Inf. Comput. 285, 104794 (2022). https:\/\/doi.org\/10.1016\/j.ic.2021.104794","journal-title":"Inf. Comput."},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-68552-4_12","volume-title":"Experimental Algorithms","author":"S Vigna","year":"2008","unstructured":"Vigna, S.: Broadword implementation of rank\/select queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 154\u2013168. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_12"},{"key":"16_CR42","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":"16_CR43","doi-asserted-by":"publisher","unstructured":"Zhang, H., et al.: Succinct range filters. ACM Trans. Database Syst. 45(2) (2020). https:\/\/doi.org\/10.1145\/3375660. Fork of the implementation available at https:\/\/github.com\/kampersanda\/fast_succinct_trie","DOI":"10.1145\/3375660"},{"key":"16_CR44","doi-asserted-by":"publisher","unstructured":"Zhang, W., et al.: TernaryBERT: distillation-aware ultra-low bit BERT. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 509\u2013521 (2020). https:\/\/doi.org\/10.18653\/v1\/2020.emnlp-main.37","DOI":"10.18653\/v1\/2020.emnlp-main.37"}],"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-43980-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:03:42Z","timestamp":1695125022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","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":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","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":"47","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":"31","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":"66% - 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","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)"}}]}}