{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:12:17Z","timestamp":1773771137457,"version":"3.50.1"},"reference-count":23,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T00:00:00Z","timestamp":1740960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"EU\u2014NGEU","award":["PE00000014"],"award-info":[{"award-number":["PE00000014"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this paper, we explore a framework to identify an optimal choice of compression algorithms that enables the best allocation of computing resources in a large-scale data storage environment: our goal is to maximize the efficiency of data compression given a time limit that must be observed by the compression process. We tested this approach with lossless compression of one-dimensional data (text) and two-dimensional data (images) and the experimental results demonstrate its effectiveness. We also extended this technique to lossy compression and successfully applied it to the lossy compression of two-dimensional data.<\/jats:p>","DOI":"10.3390\/a18030135","type":"journal-article","created":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T05:52:16Z","timestamp":1740981136000},"page":"135","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Data Compression with a Time Limit"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1960-9986","authenticated-orcid":false,"given":"Bruno","family":"Carpentieri","sequence":"first","affiliation":[{"name":"Dipartmento di Informatica, Universit\u00e0 di Salerno, 84084 Fisciano, SA, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zohar, E., and Cassuto, Y. (2015, January 7\u20139). Data Compression Cost Optimization. Proceedings of the Data Compression Conference (DCC 2015), Snowbird, UT, USA.","DOI":"10.1109\/DCC.2015.18"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Carpentieri, B. (2024, January 1\u20132). Data Compression in Massive Data Storage Systems. Proceedings of the International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA 2024), Victoria, Seychelles.","DOI":"10.1109\/ACDSA59508.2024.10467390"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Liao, K., Moffat, A., Petri, M., and Wirth, A. (2017, January 10\u201314). A Cost Model for Long-Term Compressed Data Retention. Proceedings of the Tenth ACM International Conference on Web Search and Data Mining (WSDM \u201917), Hannover, Germany.","DOI":"10.1145\/3018661.3018738"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Wiseman, Y., Schwan, K., and Widener, P. (2004, January 24\u201326). Efficient End to End Data Exchange Using Configurable Compression. Proceedings of the 24th IEEE Conference on Distributed Computing Systems (ICDCS 2004), Tokyo, Japan.","DOI":"10.1109\/ICDCS.2004.1281587"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0255(01)00104-9","article-title":"LZ-based image compression","volume":"135","author":"Rizzo","year":"2001","journal-title":"Inf. Sci."},{"key":"ref_8","first-page":"85","article-title":"Huffman encoding","volume":"52","author":"Moffat","year":"2019","journal-title":"ACM Comput. Surv."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Commun. ACM"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Deutsch, P. (1996). Rfc 1952: GZIP File Format Specification Version 4.3, RFC Editor.","DOI":"10.17487\/rfc1952"},{"key":"ref_11","unstructured":"Burrows, M., and Wheeler, D.J. (1994). A Block\u2013Sorting Lossless Data Compression Algorithm, Digital Systems Research Center."},{"key":"ref_12","unstructured":"Roelofs, G., and Koman, R. (1999). PNG: The Definitive Guide, O\u2019Reilly Media."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A Technique for High-Performance Data Compression","volume":"17","author":"Welch","year":"1984","journal-title":"Computer"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1109\/83.855427","article-title":"The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS","volume":"9","author":"Weinberger","year":"2000","journal-title":"IEEE Trans. Image Process."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/79.952804","article-title":"The JPEG 2000 still image compression standard","volume":"18","author":"Skodras","year":"2001","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Sharma, K., and Gupta, K. (2017, January 5\u20136). Lossless data compression techniques and their performance. Proceedings of the 2017 International Conference on Computing, Communication and Automation (ICCCA), Greater Noida, India.","DOI":"10.1109\/CCAA.2017.8229810"},{"key":"ref_17","unstructured":"Howard, P.G., and Vitter, J.S. (April, January 30). Fast and efficient lossless image compression. Proceedings of the DCC \u203293: Data Compression Conference, Snowbird, UT, USA."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/331624.331630","article-title":"Image compression\u2014From DCT to wavelets: A review","volume":"6","author":"Saha","year":"2000","journal-title":"XRDS Crossroads ACM Mag. Stud."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/30.125072","article-title":"The JPEG still picture compression standard","volume":"38","author":"Wallace","year":"1992","journal-title":"IEEE Trans. Consum. Electron."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.image.2012.01.011","article-title":"Objective assessment of the WebP image coding algorithm","volume":"27","author":"Ginesu","year":"2012","journal-title":"Signal Process. Image Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIP.2003.819861","article-title":"Image Quality Assessment: From Error Visibility to Structural Similarity","volume":"13","author":"Wang","year":"2004","journal-title":"IEEE Trans. Image Process."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Pizzolante, R., and Carpentieri, B. (2016). Multiband and Lossless Compression of Hyperspectral Images. Algorithms, 9.","DOI":"10.3390\/a9010016"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Pizzolante, R., and Carpentieri, B. (2013, January 1\u20133). Lossless, low-complexity, compression of three-dimensional volumetric medical images via linear prediction. Proceedings of the 18th International Conference on Digital Signal Processing (DSP 2013), Fira, Greece.","DOI":"10.1109\/ICDSP.2013.6622763"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/3\/135\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:46:10Z","timestamp":1760028370000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/3\/135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,3]]},"references-count":23,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["a18030135"],"URL":"https:\/\/doi.org\/10.3390\/a18030135","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,3]]}}}