{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,5]],"date-time":"2026-09-05T01:10:19Z","timestamp":1788570619215,"version":"build-2803163510"},"reference-count":86,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Austrian Federal Ministry for Climate Action, Environment, Energy, Mobility, Innovation and Technology","award":["873838"],"award-info":[{"award-number":["873838"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>Compression is an effective technique for fitting data in available memory, reducing I\/O, and increasing instruction parallelism. While data systems primarily rely on lossless compression, modern machine learning (ML) systems exploit the approximate nature of ML and mostly use lossy compression via low-precision floating- or fixed-point representations. The resulting unknown impact on learning progress, and model accuracy, however, create trust concerns, that require trial and error, and are problematic for declarative ML pipelines. Given the trend towards increasingly complex, composite ML pipelines---with outer loops for hyper-parameter tuning, feature selection, and data cleaning\/augmentation---it is hard for a user to infer the impact of lossy compression. Sparsity exploitation is a common lossless scheme used to improve performance without this uncertainty. Evolving this concept to general redundancy-exploiting compression is a natural next step. Existing work on lossless compression and compressed linear algebra (CLA) enable such exploitation to a degree, but face challenges for general applicability. In this paper, we address these limitations with a workload-aware compression framework, comprising a broad spectrum of new compression schemes and kernels. Instead of a data-centric approach that optimizes compression ratios, our workload-aware compression summarizes the workload of an ML pipeline, and optimizes the compression and execution plan to minimize execution time. On various micro benchmarks and end-to-end ML pipelines, we observe improvements for individual operations up to 10,000x and ML algorithms up to \u03bdmprint6.6 x compared to uncompressed operations.<\/jats:p>","DOI":"10.1145\/3588682","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-28","source":"Crossref","is-referenced-by-count":6,"title":["AWARE: Workload-aware, Redundancy-exploiting Linear Algebra"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1463-7294","authenticated-orcid":false,"given":"Sebastian","family":"Baunsgaard","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1344-3663","authenticated-orcid":false,"given":"Matthias","family":"Boehm","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687625"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","unstructured":"Daniel J. Abadi Samuel Madden and Miguel Ferreira. 2006. Integrating compression and execution in column-oriented database systems. In SIGMOD. 671--682. https:\/\/doi.org\/10.1145\/1142473.1142548","DOI":"10.1145\/1142473.1142548"},{"key":"e_1_2_2_3_1","volume-title":"Benoit Steiner, Paul A. Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng.","author":"Abadi Mart'i","year":"2016","unstructured":"Mart'i n Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, Manjunath Kudlur, Josh Levenberg, Rajat Monga, Sherry Moore, Derek Gordon Murray, Benoit Steiner, Paul A. Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng. 2016. TensorFlow: A System for Large-Scale Machine Learning. In OSDI. 265--283. https:\/\/www.usenix.org\/conference\/osdi16\/technical-sessions\/presentation\/abadi"},{"key":"e_1_2_2_4_1","unstructured":"Amir Abboud Arturs Backurs Karl Bringmann and Marvin K\u00fc nnemann. 2020. Impossibility Results for Grammar-Compressed Linear Algebra. In NeurIPS. https:\/\/arxiv.org\/abs\/2010.14181"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0357-y"},{"key":"e_1_2_2_6_1","unstructured":"American Statistical Association (ASA). 2009. Airline on-time performance dataset. https:\/\/stat-computing.org\/dataexpo\/2009\/the-data.html."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","unstructured":"Manos Athanassoulis Kenneth S. B\u00f8gh and Stratos Idreos. 2019. Optimal Column Layout for Hybrid Workloads. In PVLDB. 2393--2407. https:\/\/doi.org\/10.14778\/3358701.3358707","DOI":"10.14778\/3358701.3358707"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457549"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","unstructured":"Sebastian Baunsgaard Matthias Boehm Kevin Innerebner Mito Kehayov Florian Lackner Olga Ovcharenko Arnab Phani Tobias Rieger David Weissteiner and Sebastian Benjamin Wrede. 2022. Federated Data Preparation Learning and Debugging in Apache SystemDS. In CIKM. 4813--4817. https:\/\/doi.org\/10.1145\/3511808.3557162","DOI":"10.1145\/3511808.3557162"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2618243.2618268"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","unstructured":"Carsten Binnig Stefan Hildenbrand and Franz F\"a rber. 2009. Dictionary-based order-preserving string compression for main memory column stores. In SIGMOD. 283--296. https:\/\/doi.org\/10.14778\/2536222.2536233","DOI":"10.14778\/2536222.2536233"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3264903"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007279"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229865"},{"key":"e_1_2_2_15_1","first-page":"52","article-title":"SystemML's Optimizer: Plan Generation for Large-Scale Machine Learning Programs","volume":"37","author":"Matthias B\u00f6","year":"2014","unstructured":"Matthias B\u00f6 hm, Douglas R. Burdick, Alexandre V. Evfimievski, Berthold Reinwald, Frederick R. Reiss, Prithviraj Sen, Shirish Tatikonda, and Yuanyuan Tian. 2014. SystemML's Optimizer: Plan Generation for Large-Scale Machine Learning Programs. IEEE Data Eng. Bull., Vol. 37, 3 (2014), 52--62.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3503585.3503588"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","unstructured":"Martin Boissier and Max Jendruk. 2019. Workload-Driven and Robust Selection of Compression Schemes for Column Stores. In EDBT. 674--677. https:\/\/doi.org\/10.5441\/002\/edbt.2019.84","DOI":"10.5441\/002"},{"key":"e_1_2_2_18_1","unstructured":"L\u00e9on Bottou and Ga\u00eblle Loosli. 2007. The infinite MNIST dataset. https:\/\/leon.bottou.org\/projects\/infimnist."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3464509.3464885"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137633"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","unstructured":"Patrick Damme Dirk Habich Juliana Hildebrandt and Wolfgang Lehner. 2017. Lightweight Data Compression Algorithms: An Experimental Survey (Experiments and Analyses). In EDBT. 72--83. https:\/\/doi.org\/10.5441\/002\/edbt.2017.08","DOI":"10.5441\/002"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323991"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","unstructured":"Patrick Damme Annett Ungeth\u00fcm Johannes Pietrzyk Alexander Krause Dirk Habich and Wolfgang Lehner. 2020. MorphStore: Analytical Query Engine with a Holistic Compression-Enabled Processing Model. In PVLDB. 2396--2410. https:\/\/doi.org\/10.14778\/3407790.3407833","DOI":"10.14778\/3407790.3407833"},{"key":"e_1_2_2_24_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994515"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318221"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547321"},{"key":"e_1_2_2_28_1","volume-title":"Daniel Roy, and Michael Carbin.","author":"Frankle Jonathan","year":"2021","unstructured":"Jonathan Frankle, Gintare Karolina Dziugaite, Daniel Roy, and Michael Carbin. 2021. Pruning Neural Networks at Initialization: Why Are We Missing the Mark?. In ICLR. https:\/\/openreview.net\/forum?id=Ig-VyQc-MLK"},{"key":"e_1_2_2_29_1","unstructured":"Google. 2019. TensorFlow Model Optimization Toolkit - Pruning API. https:\/\/blog.tensorflow.org\/2019\/05\/tf-model-optimization-toolkit-pruning-API.html."},{"key":"e_1_2_2_30_1","unstructured":"Google. 2020. Quantization Aware Training with TensorFlow Model Optimization Toolkit - Performance with Accuracy. https:\/\/blog.tensorflow.org\/2020\/04\/quantization-aware-training-with-tensorflow-model-optimization-toolkit.html."},{"key":"e_1_2_2_31_1","unstructured":"The HDF Group. 2021. The HDF5 Library and File Format. https:\/\/www.hdfgroup.org\/solutions\/hdf5\/."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","unstructured":"Ruining He and Julian McAuley. 2016. Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering. In WWW. 507--517. https:\/\/doi.org\/10.1145\/2872427.2883037","DOI":"10.1145\/2872427.2883037"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247525"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","unstructured":"Amir Ilkhechi Andrew Crotty Alex Galakatos Yicong Mao Grace Fan Xiran Shi and Ugur cC etintemel. 2020. DeepSqueeze: Deep Semantic Compression for Tabular Data. In SIGMOD. 1733--1746. https:\/\/doi.org\/10.1145\/3318464.3389734","DOI":"10.1145\/3318464.3389734"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","unstructured":"Jiawei Jiang Fangcheng Fu Tong Yang and Bin Cui. 2018. SketchML: Accelerating Distributed Machine Learning with Data Sketches. In SIGMOD. 1269--1284. https:\/\/doi.org\/10.1145\/3183713.3196894","DOI":"10.1145\/3183713.3196894"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3503585.3503597"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.290"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021023"},{"key":"e_1_2_2_39_1","unstructured":"Urs K\u00f6 ster Tristan Webb Xin Wang Marcel Nassar Arjun K. Bansal William Constable Oguz Elibol Stewart Hall Luke Hornof Amir Khosrowshahi Carey Kloss Ruby J. Pai and Naveen Rao. 2017. Flexpoint: An Adaptive Numerical Format for Efficient Training of Deep Neural Networks. In NeurIPS. 1742--1752. https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/a0160709701140704575d499c997b6ca-Abstract.html"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","unstructured":"Kornilios Kourtis Georgios I. Goumas and Nectarios Koziris. 2008. Optimizing sparse matrix-vector multiplication using index and value compression. In CF. 87--96. https:\/\/doi.org\/10.1145\/1366230.1366244","DOI":"10.1145\/1366230.1366244"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","unstructured":"Michael Kuchnik George Amvrosiadis and Virginia Smith. 2021. Progressive Compressed Records: Taking a Byte out of DeepLearning Data. In PVLDB. 2627--2641. https:\/\/doi.org\/10.14778\/3476249.3476308","DOI":"10.14778\/3476249.3476308"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723713"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882925"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","unstructured":"Robert Lasch Robert Schulze Thomas Legler and Kai-Uwe Sattler. 2021. Workload-Driven Placement of Column-Store Data Structures on DRAM and NVM. In DaMoN@SIGMOD Workshop. 5:1--5:8. https:\/\/doi.org\/10.1145\/3465998.3466008","DOI":"10.1145\/3465998.3466008"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300070"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551852"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384357"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","unstructured":"Chunwei Liu Hao Jiang John Paparrizos and Aaron J Elmore. 2021. Decomposed Bounded Floats for Fast Compression and Queries. In PVLDB. 2586--2598. https:\/\/doi.org\/10.14778\/3476249.3476305","DOI":"10.14778\/3476249.3476305"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00111"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","unstructured":"Shangyu Luo Dimitrije Jankov Binhang Yuan and Chris Jermaine. 2021. Automatic Optimization of Matrix Implementations for Distributed Machine Learning and Linear Algebra. In SIGMOD. 1222--1234. https:\/\/doi.org\/10.1145\/3448016.3457317","DOI":"10.1145\/3448016.3457317"},{"key":"e_1_2_2_51_1","unstructured":"Guido Moerkotte. 1998. Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing. In VLDB. 476--487."},{"key":"e_1_2_2_52_1","volume-title":"AutoGraph: Imperative-style Coding with Graph-based Performance. SysML","author":"Moldovan Dan","year":"2019","unstructured":"Dan Moldovan, James M Decker, Fei Wang, Andrew A Johnson, Brian K Lee, Zachary Nado, D Sculley, Tiark Rompf, and Alexander B Wiltschko. 2019. AutoGraph: Imperative-style Coding with Graph-based Performance. SysML (2019). https:\/\/proceedings.mlsys.org\/book\/272.pdf"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1712.05889"},{"key":"e_1_2_2_54_1","unstructured":"Thomas Neumann and Alfons Kemper. 2015. Unnesting Arbitrary Queries. In BTW. 383--402. https:\/\/dl.gi.de\/20.500.12116\/2418"},{"key":"e_1_2_2_55_1","unstructured":"Jianmo Ni. 2018. Amazon Product Data - Books. https:\/\/cseweb.ucsd.edu\/ jmcauley\/datasets\/amazon_v2\/."},{"key":"e_1_2_2_56_1","unstructured":"NVIDIA. 2020. NVIDIA A100 Tensor Core GPU Architecture - UNPRECEDENTED ACCELERATION AT EVERY SCALE. https:\/\/images.nvidia.com\/aem-dam\/en-zz\/Solutions\/data-center\/nvidia-ampere-architecture-whitepaper.pdf."},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415572"},{"key":"e_1_2_2_58_1","unstructured":"Kunle Olukotun. 2021. Keynote: \"Let the Data Flow!\". In CIDR."},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025117"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","unstructured":"Yongjoo Park Jingyi Qing Xiaoyang Shen and Barzan Mozafari. 2019. BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guarantees. In SIGMOD. 1135--1152. https:\/\/doi.org\/10.1145\/3299869.3300077","DOI":"10.1145\/3299869.3300077"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536233"},{"key":"e_1_2_2_62_1","unstructured":"Vijayshankar Raman and Garret Swart. 2006. How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations. In VLDB. 858--869. http:\/\/dl.acm.org\/citation.cfm?id=1164201"},{"key":"e_1_2_2_63_1","volume-title":"Combiner: Full Attention Transformer with Sparse Computation Cost. In NeurIPS. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/file\/bd4a6d0563e0604510989eb8f9ff71f5-Paper.pdf","author":"Ren Hongyu","year":"2021","unstructured":"Hongyu Ren, Hanjun Dai, Zihang Dai, Mengjiao Yang, Jure Leskovec, Dale Schuurmans, and Bo Dai. 2021. Combiner: Full Attention Transformer with Sparse Computation Cost. In NeurIPS. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/file\/bd4a6d0563e0604510989eb8f9ff71f5-Paper.pdf"},{"key":"e_1_2_2_64_1","unstructured":"Youcef Saad. 1994. SPARSKIT: a basic tool kit for sparse matrix computations - Version 2."},{"key":"e_1_2_2_65_1","unstructured":"Brennan Saeta. 2018. Training Performance A user's guide to converge faster TF Dev Summit."},{"key":"e_1_2_2_66_1","unstructured":"SAP. 2019. SAP HANA Performance Guide for Developers. https:\/\/help.sap.com\/doc\/05b8cb60dfd94c82b86828ee77f7e0d9\/2.0.04\/en-US\/SAP_HANA_Performance_Developer_Guide_en.pdf."},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","unstructured":"Maximilian Schleich Dan Olteanu and Radu Ciucanu. 2016. Learning Linear Regression Models over Factorized Joins. In SIGMOD. 3--18. https:\/\/doi.org\/10.1145\/2882903.2882939","DOI":"10.1145\/2882903.2882939"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324961"},{"key":"e_1_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Frank Seide Hao Fu Jasha Droppo Gang Li and Dong Yu. 2014. 1-bit stochastic gradient descent and its application to data-parallel distributed training of speech DNNs. In INTERSPEECH. 1058--1062. http:\/\/www.isca-speech.org\/archive\/interspeech_2014\/i14_1058.html","DOI":"10.21437\/Interspeech.2014-274"},{"key":"e_1_2_2_70_1","volume-title":"Haas","author":"Sommer Johanna","year":"2019","unstructured":"Johanna Sommer, Matthias Boehm, Alexandre V. Evfimievski, Berthold Reinwald, and Peter J. Haas. 2019. MNC: Structure-Exploiting Sparsity Estimation for Matrix Expressions. In SIGMOD. 1607--1623."},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","unstructured":"Michael Stonebraker Paul Brown Alex Poliakov and Suchi Raman. 2011. The Architecture of SciDB. In SSDBM. 1--16. https:\/\/doi.org\/10.1007\/978--3--642--22351--8_1","DOI":"10.1007\/978--3--642--22351--8_1"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","unstructured":"Felipe Petroski Such Aditya Rawal Joel Lehman Kenneth O. Stanley and Jeffrey Clune. 2020. Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Data. In ICML. 9206--9216. https:\/\/doi.org\/10.48550\/arXiv.1912.07768","DOI":"10.48550\/arXiv.1912.07768"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939864"},{"key":"e_1_2_2_74_1","unstructured":"Teradata. 2021. Teradata Documentation - Table Statements USING FAST MODE. https:\/\/docs.teradata.com\/r\/76g1CuvvQlYBjb2WPIuk3g\/Ls7re6GN7m3Tw_faIYIN2Q."},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","unstructured":"Ramakrishna Varadarajan Bibek Bharathan Ariel Cary Jaimin Dave and Sreenath Bodagala. 2014. DBDesigner: A customizable physical design tool for Vertica Analytic Database. ICDE 1084--1095. https:\/\/doi.org\/10.1109\/ICDE.2014.6816725","DOI":"10.1109\/ICDE.2014.6816725"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565858"},{"key":"e_1_2_2_77_1","unstructured":"Naigang Wang Jungwook Choi Daniel Brand Chia-Yu Chen and Kailash Gopalakrishnan. 2018. Training Deep Neural Networks with 8-bit Floating Point Numbers. In NeurIPS. 7686--7695. https:\/\/proceedings.neurips.cc\/paper\/2018\/hash\/335d3d1cd7ef05ec77714a215134914c-Abstract.html"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.14778\/3317315.3317322"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687671"},{"key":"e_1_2_2_80_1","unstructured":"Stephen Wolfram. 2002. A New Kind of Science - Data Compression. Wolfram-Media. 1069 pages."},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","unstructured":"Doris Xin Hui Miao Aditya G. Parameswaran and Neoklis Polyzotis. 2021. Production Machine Learning Pipelines: Empirical Analysis and Optimization Opportunities. In SIGMOD. 2639--2652. https:\/\/doi.org\/10.1145\/3448016.3457566","DOI":"10.1145\/3448016.3457566"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389770"},{"key":"e_1_2_2_83_1","unstructured":"Matei Zaharia Mosharaf Chowdhury Tathagata Das Ankur Dave Justin Ma Murphy McCauly Michael J. Franklin Scott Shenker and Ion Stoica. 2012. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. In NSDI. 15--28."},{"key":"e_1_2_2_84_1","unstructured":"Hantian Zhang Jerry Li Kaan Kara Dan Alistarh Ji Liu and Ce Zhang. 2017. ZipML: Training Linear Models with End-to-End Low Precision and a Little Bit of Deep Learning. In ICML. 4035--4043. https:\/\/proceedings.mlr.press\/v70\/zhang17e.html"},{"key":"e_1_2_2_85_1","volume-title":"Dally","author":"Zhu Chenzhuo","year":"2017","unstructured":"Chenzhuo Zhu, Song Han, Huizi Mao, and William J. Dally. 2017. Trained Ternary Quantization. In ICLR. https:\/\/openreview.net\/forum?id=S1_pAu9xl"},{"key":"e_1_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588682","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:13Z","timestamp":1750178833000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":86,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588682"],"URL":"https:\/\/doi.org\/10.1145\/3588682","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}