{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:37:50Z","timestamp":1780346270935,"version":"3.54.1"},"reference-count":116,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,3,12]]},"abstract":"<jats:p>Lightweight data compression is a key technique that allows column stores to exhibit superior performance for analytical queries. Despite a comprehensive study on dictionary-based encodings to approach Shannon's entropy, few prior works have systematically exploited the serial correlation in a column for compression. In this paper, we propose LeCo (i.e., Learned Compression), a framework that uses machine learning to remove the serial redundancy in a value sequence automatically to achieve an outstanding compression ratio and decompression performance. LeCo presents a general approach to this end, making existing algorithms such as Frame-of-Reference (FOR), Delta Encoding, and Run-Length Encoding (RLE) special cases under our framework. Our microbenchmark with three synthetic and eight real-world data sets shows that a prototype of LeCo achieves a Pareto improvement on both compression ratio and random access speed over the existing solutions. When integrating LeCo into widely-used applications, we observe up to 5.2\u00d7 speed up in a data analytical query in the Arrow columnar execution engine, and a 16% increase in RocksDB's throughput.<\/jats:p>","DOI":"10.1145\/3639320","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:51:32Z","timestamp":1711479092000},"page":"1-28","source":"Crossref","is-referenced-by-count":14,"title":["LeCo: Lightweight Compression via Learning Serial Correlations"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4623-5240","authenticated-orcid":false,"given":"Yihao","family":"Liu","sequence":"first","affiliation":[{"name":"Institute for Interdisciplinary Information Science, Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6858-1457","authenticated-orcid":false,"given":"Xinyu","family":"Zeng","sequence":"additional","affiliation":[{"name":"Institute for Interdisciplinary Information Science, Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4821-1558","authenticated-orcid":false,"given":"Huanchen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute for Interdisciplinary Information Science, Tsinghua University &amp; Shanghai Qi Zhi Institute, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2009. Google Varint. https:\/\/static.googleusercontent.com\/media\/research.google.com\/en\/\/people\/jeff\/WSDM09-keynote.pdf."},{"key":"e_1_2_2_2_1","unstructured":"2018. 300 Million Email Database. https:\/\/archive.org\/details\/300MillionEmailDatabase."},{"key":"e_1_2_2_3_1","unstructured":"2020. English Word Dataset in HOPE. https:\/\/github.com\/efficient\/HOPE\/blob\/master\/datasets\/words.txt."},{"key":"e_1_2_2_4_1","unstructured":"2022. Apache Arrow. https:\/\/arrow.apache.org\/."},{"key":"e_1_2_2_5_1","unstructured":"2022. Apache ORC. https:\/\/orc.apache.org\/."},{"key":"e_1_2_2_6_1","unstructured":"2022. Apache Parquet. https:\/\/parquet.apache.org\/."},{"key":"e_1_2_2_7_1","unstructured":"2022. GNU GZip. https:\/\/www.gnu.org\/software\/gzip\/."},{"key":"e_1_2_2_8_1","unstructured":"2022. Google snappy. http:\/\/google.github.io\/snappy\/."},{"key":"e_1_2_2_9_1","unstructured":"2022. Kaggle USA Real Estate Dataset. https:\/\/www.kaggle.com\/datasets\/ahmedshahriarsakib\/usa-real-estate-dataset'select=realtor-dataset-100k.csv."},{"key":"e_1_2_2_10_1","unstructured":"2022. Lz4. https:\/\/github.com\/lz4\/lz4."},{"key":"e_1_2_2_11_1","unstructured":"2022. Movie ID dataset. https:\/\/www.kaggle.com\/datasets\/grouplens\/movielens-20m-dataset'select=rating.csv."},{"key":"e_1_2_2_12_1","unstructured":"2022. Personal communication anonymized for review. ."},{"key":"e_1_2_2_13_1","unstructured":"2022. Real-time Analytics for MySQL Database Service. https:\/\/www.oracle.com\/mysql\/."},{"key":"e_1_2_2_14_1","unstructured":"2022. Rocksdb Github. https:\/\/github.com\/facebook\/rocksdb."},{"key":"e_1_2_2_15_1","unstructured":"2022. Rocksdb Performance Benchmarks. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Performance-Benchmarks."},{"key":"e_1_2_2_16_1","unstructured":"2022. Samsung 980 PRO 4.0 NVMe SSD. https:\/\/www.samsung.com\/us\/computing\/memory-storage\/solid-state-drives\/980-pro-pcie-4-0-nvme-ssd-1tb-mz-v8p1t0b-am\/."},{"key":"e_1_2_2_17_1","unstructured":"2022. SingleStore. https:\/\/www.singlestore.com\/."},{"key":"e_1_2_2_18_1","unstructured":"2022. UCI Machine Learning Repository: Timestamp in Bar Crawl: Detecting Heavy Drinking Data Set. https:\/\/archive.ics.uci.edu\/ml\/datasets\/BarCrawl%3ADetectingHeavyDrinking."},{"key":"e_1_2_2_19_1","unstructured":"2022. Zstandard. https:\/\/github.com\/facebook\/zstd."},{"key":"e_1_2_2_20_1","unstructured":"2023. GeoNames Data. https:\/\/www.geonames.org\/export\/."},{"key":"e_1_2_2_21_1","unstructured":"2023. HistData GRXEUR. https:\/\/www.histdata.com\/."},{"key":"e_1_2_2_22_1","unstructured":"2023. Kaggle Udemy Courses. https:\/\/www.kaggle.com\/datasets\/hossaingh\/udemy-courses."},{"key":"e_1_2_2_23_1","unstructured":"2023. mlcourse.ai. https:\/\/github.com\/Yorko\/mlcourse.ai\/tree\/main\/data."},{"key":"e_1_2_2_24_1","unstructured":"2023. Public BI Benchmark. https:\/\/homepages.cwi.nl\/~boncz\/PublicBIbenchmark\/."},{"key":"e_1_2_2_25_1","unstructured":"2023. TPC-DS Benchmark Standard Specification. https:\/\/www.tpc.org\/tpcds\/."},{"key":"e_1_2_2_26_1","unstructured":"2023. TPC-H Benchmark Standard Specification. https:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_2_2_27_1","volume-title":"Stratos Idreos, and Samuel Madden.","author":"Abadi Daniel","year":"2013","unstructured":"Daniel Abadi, Peter Boncz, Stavros Harizopoulos Amiato, Stratos Idreos, and Samuel Madden. 2013. The design and implementation of modern column-oriented database systems. Now Hanover, Mass."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142548"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.653274"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526045"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559877"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976472.4"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407851"},{"key":"e_1_2_2_34_1","volume-title":"Second Biennial Conference on Innovative Data Systems Research (CIDR). 225--237","author":"Boncz Peter A.","year":"2005","unstructured":"Peter A. Boncz, Marcin Zukowski, and Niels Nes. 2005. MonetDB\/X100: Hyper-Pipelining Query Execution. In Second Biennial Conference on Innovative Data Systems Research (CIDR). 225--237."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00362-011-0423-0"},{"key":"e_1_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Scott H Cameron. 1966. Piece-wise linear approximations. Technical Report. IIT RESEARCH INST CHICAGO IL COMPUTER SCIENCES DIV.","DOI":"10.21236\/AD0647190"},{"key":"e_1_2_2_37_1","volume-title":"12th International Conference on Data Warehousing and Knowledge Discovery (DaWaK)","author":"Christian Lemke","year":"2010","unstructured":"Lemke Christian, Sattler Kai-Uwe, Faerber Franz, and Zeier Alexander. 2010. Speeding up queries in column stores: a case for compression. 12th International Conference on Data Warehousing and Knowledge Discovery (DaWaK) (2010), 117--129."},{"key":"e_1_2_2_38_1","unstructured":"Google Cloud. 2017. OpenStreetMap(2017). https:\/\/console.cloud.google.com\/marketplace\/details\/openstreetmap\/geo-openstreetmap."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2903741"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407833"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824074"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389711"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483840"},{"key":"e_1_2_2_45_1","volume-title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding. arXiv preprint arXiv:1311.2540","author":"Duda Jarek","year":"2013","unstructured":"Jarek Duda. 2013. Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding. arXiv preprint arXiv:1311.2540 (2013)."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0368-8"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687645"},{"key":"e_1_2_2_48_1","volume-title":"On data mining, compression, and kolmogorov complexity. Data mining and knowledge discovery 15, 1","author":"Faloutsos Christos","year":"2007","unstructured":"Christos Faloutsos and Vasileios Megalooikonomou. 2007. On data mining, compression, and kolmogorov complexity. Data mining and knowledge discovery 15, 1 (2007), 3--20."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094114.2094126"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747642"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_2_2_52_1","volume-title":"Measuring and Accounting for Innovation in the 21st Century","author":"Flamm Kenneth","unstructured":"Kenneth Flamm. 2019. Measuring Moore's law: evidence from price, cost, and quality indexes. In Measuring and Accounting for Innovation in the 21st Century. University of Chicago Press."},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319860"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939867"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655800"},{"key":"e_1_2_2_56_1","volume-title":"Data compression and database performance","author":"Graefe Goetz","unstructured":"Goetz Graefe and Leonard D Shapiro. 1990. Data compression and database performance. University of Colorado, Boulder, Department of Computer Science."},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742795"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415535"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.237"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389734"},{"key":"e_1_2_2_62_1","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases (VLDB). 186--198","author":"Jagadish H. V.","unstructured":"H. V. Jagadish, J. Madar, and Raymond T. Ng. 1999. Semantic Compression and Pattern Extraction with Fascicles. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB). 186--198."},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380761"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457283"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"e_1_2_2_66_1","volume-title":"SOSD: A Benchmark for Learned Indexes. In 33rd Conference on Neural Information Processing Systems (NeurIPS).","author":"Kipf A.","unstructured":"A. Kipf, R Marcus, A Van Renen, M. Stoian, A. Kemper, T. Kraska, and T. Neumann. 2019. SOSD: A Benchmark for Learned Indexes. In 33rd Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3401071.3401659"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594521"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113373"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367518"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882925"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824071"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260811"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137767"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733008"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2203"},{"key":"e_1_2_2_78_1","unstructured":"Ming Li Paul Vit\u00e1nyi et al. 2008. An introduction to Kolmogorov complexity and its applications. Vol. 3. Springer."},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489512"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737787"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465322"},{"key":"e_1_2_2_82_1","unstructured":"Libraries.io. 2017. Repository ID in Libraries.io. https:\/\/libraries.io\/data."},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00111"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113282"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609615"},{"key":"e_1_2_2_86_1","volume-title":"Proceedings of the 2017 ACM SIGMOD International Conference on Management of Data. 1771--1775","author":"\u00d6zcan Fatma","year":"2017","unstructured":"Fatma \u00d6zcan, Yuanyuan Tian, and Pinar T\u00f6z\u00fcn. 2017. Hybrid transactional\/analytical processing: A survey. In Proceedings of the 2017 ACM SIGMOD International Conference on Management of Data. 1771--1775."},{"key":"e_1_2_2_87_1","volume-title":"Hybrid transaction\/analytical processing will foster opportunities for dramatic business innovation. Gartner","author":"Pezzini Massimo","year":"2014","unstructured":"Massimo Pezzini, Donald Feinberg, Nigel Rayner, and Roxane Edjlali. 2014. Hybrid transaction\/analytical processing will foster opportunities for dramatic business innovation. Gartner (2014, January 28) Available at https:\/\/www.gartner.com\/doc\/2657815\/hybrid-transactionanalyticalprocessing-foster-opportunities (2014), 4--20."},{"key":"e_1_2_2_88_1","first-page":"1812","article-title":"On optimally partitioning variable-byte codes","volume":"32","author":"Pibiri Giulio Ermanno","year":"2019","unstructured":"Giulio Ermanno Pibiri and Rossano Venturini. 2019. On optimally partitioning variable-byte codes. IEEE Transactions on Knowledge and Data Engineering 32, 9 (2019), 1812--1823.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_2_89_1","volume-title":"Vectorized VByte Decoding. Computerence","author":"Plaisance J.","year":"2016","unstructured":"J. Plaisance, N. Kurz, and D Lemire. 2016. Vectorized VByte Decoding. Computerence (2016)."},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559846"},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536233"},{"key":"e_1_2_2_92_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases. 858--869","author":"Raman Vijayshankar","year":"2006","unstructured":"Vijayshankar Raman and Garret Swart. 2006. How to wring a table dry: Entropy compression of relations and querying of compressed relations. In Proceedings of the 32nd International Conference on Very Large Data Bases. 858--869."},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869389.1869394"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574699"},{"key":"e_1_2_2_95_1","volume-title":"A mathematical theory of communication. The Bell system technical journal 27, 3","author":"Shannon Claude Elwood","year":"1948","unstructured":"Claude Elwood Shannon. 1948. A mathematical theory of communication. The Bell system technical journal 27, 3 (1948), 379--423."},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871592"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063627"},{"key":"e_1_2_2_98_1","volume-title":"Proceedings of the 8th ACM SIGKDD International Workshop on Urban Computing.","author":"Taylor Phillip M","year":"2019","unstructured":"Phillip M Taylor, Nathan Griffiths, Zhou Xu, and Alexandros Mouzakitis. 2019. Data mining and compression: where to apply it and what are the effects?. In Proceedings of the 8th ACM SIGKDD International Workshop on Urban Computing."},{"key":"e_1_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(72)90024-1"},{"key":"e_1_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433409"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2011.80"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.3.193"},{"key":"e_1_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"e_1_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551848"},{"key":"e_1_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0355-0"},{"key":"e_1_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/2757667.2757684"},{"key":"e_1_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSN.2011.6013638"},{"key":"e_1_2_2_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177457.3177482"},{"key":"e_1_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526764"},{"key":"e_1_2_2_110_1","doi-asserted-by":"publisher","DOI":"10.14778\/3626292.3626298"},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380583"},{"key":"e_1_2_2_113_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551823"},{"key":"e_1_2_2_114_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_2_2_115_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.150"},{"key":"e_1_2_2_116_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.148"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639320","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T15:16:19Z","timestamp":1755789379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":116,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,12]]}},"alternative-id":["10.1145\/3639320"],"URL":"https:\/\/doi.org\/10.1145\/3639320","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}