{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:59:58Z","timestamp":1769079598650,"version":"3.49.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031167669","type":"print"},{"value":"9783031167676","type":"electronic"}],"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-16767-6_5","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T16:02:40Z","timestamp":1662825760000},"page":"83-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Building a\u00a0Join Optimizer for\u00a0Souffl\u00e9"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7282-1658","authenticated-orcid":false,"given":"Samuel","family":"Arch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4577-3360","authenticated-orcid":false,"given":"Xiaowen","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3857-5016","authenticated-orcid":false,"given":"David","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6536-3932","authenticated-orcid":false,"given":"Pavle","family":"Suboti\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7672-7359","authenticated-orcid":false,"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"5_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases, vol. 8. Addison-Wesley Reading (1995)"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3306346.3322967","volume":"38","author":"A Adams","year":"2019","unstructured":"Adams, A., et al.: Learning to optimize halide with tree search and random programs. ACM Trans. Graph. 38(4), 1\u201312 (2019)","journal-title":"ACM Trans. Graph."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, L., Adams, A., Ma, K., Li, T.M., Jin, T., Ragan-Kelley, J.: Efficient automatic scheduling of imaging and vision pipelines for the GPU. In: Proceedings of the ACM on Programming Languages 5(OOPSLA), pp. 1\u201328 (2021)","DOI":"10.1145\/3485486"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Antoniadis, T., Triantafyllou, K., Smaragdakis, Y.: Porting doop to souffl\u00e9: a tale of inter-engine portability for datalog-based analyses. In: Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis, pp. 25\u201330 (2017)","DOI":"10.1145\/3088515.3088522"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Aref, M., et al.: Design and implementation of the logicblox system. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1371\u20131382 (2015)","DOI":"10.1145\/2723372.2742796"},{"issue":"2","key":"5_CR6","first-page":"97","volume":"1","author":"MM Astrahan","year":"1976","unstructured":"Astrahan, M.M., et al.: System R: relational approach to database management. ACM Trans. Graph. 1(2), 97\u2013137 (1976)","journal-title":"ACM Trans. Graph."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-030-25543-5_14","volume-title":"Computer Aided Verification","author":"J Backes","year":"2019","unstructured":"Backes, J., et al.: Reachability analysis for AWS-based networks. In: Dillig, Isil, Tasiran, Serdar (eds.) CAV 2019. LNCS, vol. 11562, pp. 231\u2013241. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_14"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Bancilhon, F.: Naive evaluation of recursively defined relations. In: Brodie, M.L., Mylopoulos, J. (eds) On Knowledge Base Management Systems. Topics in Information Systems. Springer, NY (1986). https:\/\/doi.org\/10.1007\/978-1-4612-4980-1_17","DOI":"10.1007\/978-1-4612-4980-1_17"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Beeri, C., Ramakrishnan, R.: On the power of magic. In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 269\u2013284 (1987)","DOI":"10.1145\/28659.28689"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., et al.: The DaCapo benchmarks: Java benchmarking development and analysis. In: Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, pp. 169\u2013190 (2006)","DOI":"10.1145\/1167473.1167488"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bravenboer, M., Smaragdakis, Y.: Strictly declarative specification of sophisticated points-to analyses. In: Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications, pp. 243\u2013262 (2009)","DOI":"10.1145\/1639949.1640108"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/b10711","volume-title":"Automated Physical Database Design and Tuning","author":"N Bruno","year":"2011","unstructured":"Bruno, N.: Automated Physical Database Design and Tuning, 1st edn. CRC Press Inc., Boca Raton (2011)","edition":"1"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/69.43410","volume":"1","author":"S Ceri","year":"1989","unstructured":"Ceri, S., Gottlob, G., Tanca, L., et al.: What you always wanted to know about datalog (and never dared to ask). IEEE Trans. Knowl. Data Eng. 1(1), 146\u2013166 (1989)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-59412-0_16","volume-title":"Software Pioneers","author":"E. F. Codd","year":"2002","unstructured":"Codd, E.. F..: A relational model of data for large shared data banks. In: Broy, Manfred, Denert, Ernst (eds.) Software Pioneers, pp. 263\u2013294. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-642-59412-0_16"},{"key":"5_CR15","unstructured":"Developers, S.: Souffl\u00e9 documentation (2016). https:\/\/souffle-lang.github.io\/pdf\/abdulthesis.pdf"},{"key":"5_CR16","unstructured":"Developers, S.: Souffl\u00e9 documentation (2016). https:\/\/souffle-lang.github.io\/handtuning#profiler"},{"key":"5_CR17","unstructured":"Developers, S.: Souffl\u00e9 release 2.3 (2022). https:\/\/github.com\/souffle-lang\/souffle\/releases\/tag\/2.3"},{"key":"5_CR18","unstructured":"Flores-Montoya, A., Schulte, E.: Datalog disassembly. In: 29th USENIX Security Symposium (USENIX Security 2020), pp. 1075\u20131092 (2020)"},{"key":"5_CR19","volume-title":"Database System Implementation","author":"H Garcia-Molina","year":"1999","unstructured":"Garcia-Molina, H., Widom, J., Ullman, J.D.: Database System Implementation. Prentice-Hall Inc., USA (1999)"},{"issue":"3","key":"5_CR20","first-page":"19","volume":"18","author":"G Graefe","year":"1995","unstructured":"Graefe, G.: The cascades framework for query optimization. IEEE Data Eng. Bull. 18(3), 19\u201329 (1995)","journal-title":"IEEE Data Eng. Bull."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Grech, N., Brent, L., Scholz, B., Smaragdakis, Y.: Gigahorse: thorough, declarative decompilation of smart contracts. In: 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE), pp. 1176\u20131186. IEEE (2019)","DOI":"10.1109\/ICSE.2019.00120"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186736.1186737","volume":"34","author":"JL Henning","year":"2006","unstructured":"Henning, J.L.: SPEC CPU2006 benchmark descriptions. ACM SIGARCH Comput. Archit. News 34(4), 1\u201317 (2006)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-22110-1_36","volume-title":"Computer Aided Verification","author":"Kry\u0161tof Hoder","year":"2011","unstructured":"Hoder, Kry\u0161tof, Bj\u00f8rner, Nikolaj, de Moura, Leonardo: $$\\mu $$Z\u2013 an efficient engine for fixed points with constraints. In: Gopalakrishnan, Ganesh, Qadeer, Shaz (eds.) CAV 2011. LNCS, vol. 6806, pp. 457\u2013462. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_36"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/234313.234367","volume":"28","author":"YE Ioannidis","year":"1996","unstructured":"Ioannidis, Y.E.: Query optimization. ACM Comput. Surv. 28(1), 121\u2013123 (1996)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/356924.356928","volume":"16","author":"M Jarke","year":"1984","unstructured":"Jarke, M., Koch, J.: Query optimization in database systems. ACM Comput. Surv. 16(2), 111\u2013152 (1984)","journal-title":"ACM Comput. Surv."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-41540-6_23","volume-title":"Computer Aided Verification","author":"Herbert Jordan","year":"2016","unstructured":"Jordan, Herbert, Scholz, Bernhard, Suboti\u0107, Pavle: Souffl\u00e9: on synthesis of program analyzers. In: Chaudhuri, Swarat, Farzan, Azadeh (eds.) CAV 2016. LNCS, vol. 9780, pp. 422\u2013430. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_23"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Jordan, H., Suboti\u0107, P., Zhao, D., Scholz, B.: A specialized b-tree for concurrent datalog evaluation. In: Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, pp. 327\u2013339 (2019)","DOI":"10.1145\/3293883.3295719"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Kjolstad, F., Kamil, S., Chou, S., Lugato, D., Amarasinghe, S.: The tensor algebra compiler. In: Proceedings of the ACM on Programming Languages 1(OOPSLA), pp. 1\u201329 (2017)","DOI":"10.1145\/3133901"},{"key":"5_CR29","unstructured":"Lagouvardos, S., Dolby, J., Grech, N., Antoniadis, A., Smaragdakis, Y.: Static analysis of shape in TensorFlow programs. In: Hirschfeld, R., Pape, T. (eds.) 34th European Conference on Object-Oriented Programming (ECOOP 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 166, pp. 15:1\u201315:29. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020)"},{"issue":"5","key":"5_CR30","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00778-017-0480-7","volume":"27","author":"V Leis","year":"2017","unstructured":"Leis, V., et al.: Query optimization through the looking glass, and what we found running the Join Order Benchmark. VLDB J. 27(5), 643\u2013668 (2017). https:\/\/doi.org\/10.1007\/s00778-017-0480-7","journal-title":"VLDB J."},{"issue":"6","key":"5_CR31","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1145\/2980983.2908096","volume":"51","author":"M Madsen","year":"2016","unstructured":"Madsen, M., Yee, M.H., Lhot\u00e1k, O.: From datalog to flix: a declarative language for fixed points on lattices. SIGPLAN Not. 51(6), 194\u2013208 (2016)","journal-title":"SIGPLAN Not."},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-58338-6_98","volume-title":"Mathematical Foundations of Computer Science 1994","author":"C Meinel","year":"1994","unstructured":"Meinel, C., Slobodov\u00e1, A.: On the complexity of constructing optimal ordered binary decision diagrams. In: Pr\u00edvara, I., Rovan, B., Ruzi\u010dka, P. (eds.) MFCS 1994. LNCS, vol. 841, pp. 515\u2013524. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58338-6_98"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Neumann, T., Radke, B.: Adaptive optimization of very large join queries. In: Proceedings of the 2018 International Conference on Management of Data, pp. 677\u2013692 (2018)","DOI":"10.1145\/3183713.3183733"},{"issue":"6","key":"5_CR34","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/2499370.2462176","volume":"48","author":"J Ragan-Kelley","year":"2013","unstructured":"Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., Amarasinghe, S.: Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines. ACM SIGPLAN Not. 48(6), 519\u2013530 (2013)","journal-title":"ACM SIGPLAN Not."},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Scholz, B., Jordan, H., Suboti\u0107, P., Westmann, T.: On fast large-scale program analysis in datalog. In: Proceedings of the 25th International Conference on Compiler Construction, pp. 196\u2013206 (2016)","DOI":"10.1145\/2892208.2892226"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: Readings in Artificial Intelligence and Databases, pp. 511\u2013522. Elsevier (1989)","DOI":"10.1016\/B978-0-934613-53-8.50038-8"},{"issue":"1","key":"5_CR37","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"TK Sellis","year":"1988","unstructured":"Sellis, T.K.: Multiple-query optimization. ACM Trans. Database Syst. 13(1), 23\u201352 (1988)","journal-title":"ACM Trans. Database Syst."},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Seo, J., Guo, S., Lam, M.S.: Socialite: datalog extensions for efficient social network analysis. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 278\u2013289. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544832"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Sereni, D., Avgustinov, P., de Moor, O.: Adding magic to an optimising datalog compiler. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 553\u2013566. SIGMOD 2008, Association for Computing Machinery, NY (2008). https:\/\/doi.org\/10.1145\/1376616.1376673","DOI":"10.1145\/1376616.1376673"},{"issue":"7","key":"5_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/351403.351408","volume":"35","author":"MD Smith","year":"2000","unstructured":"Smith, M.D.: Overcoming the challenges to feedback-directed optimization (keynote talk). SIGPLAN Not. 35(7), 1\u201311 (2000)","journal-title":"SIGPLAN Not."},{"issue":"2","key":"5_CR41","doi-asserted-by":"publisher","first-page":"141","DOI":"10.14778\/3282495.3282500","volume":"12","author":"P Suboti\u0107","year":"2018","unstructured":"Suboti\u0107, P., Jordan, H., Chang, L., Fekete, A., Scholz, B.: Automatic index selection for large-scale datalog computation. Proc. VLDB Endow. 12(2), 141\u2013153 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11575467_8","volume-title":"Programming Languages and Systems","author":"John Whaley","year":"2005","unstructured":"Whaley, John, Avots, Dzintars, Carbin, Michael, Lam, Monica S..: Using datalog with binary decision diagrams for program analysis. In: Yi, Kwangkeun (ed.) APLAS 2005. LNCS, vol. 3780, pp. 97\u2013118. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575467_8"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yang, M., Baghdadi, R., Kamil, S., Shun, J., Amarasinghe, S.: GraphIt: a high-performance graph DSL. In: Proceedings of the ACM on Programming Languages 2(OOPSLA), pp. 1\u201330 (2018)","DOI":"10.1145\/3276491"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Zhao, D., Subotic, P., Raghothaman, M., Scholz, B.: Towards elastic incrementalization for datalog. In: Veltri, N., Benton, N., Ghilezan, S. (eds.) PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, Tallinn, Estonia, 6\u20138 September 2021, pp. 20:1\u201320:16. ACM (2021)","DOI":"10.1145\/3479394.3479415"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16767-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T16:44:22Z","timestamp":1727973862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16767-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031167669","9783031167676"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16767-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","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":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lopstr2022.webs.upv.es","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":"17","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":"8","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":"47% - 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)"}}]}}