{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T16:53:42Z","timestamp":1790700822905,"version":"4.1.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>\n                    Applications in diverse domains such as astronomy, economics and industrial monitoring, increasingly press the need for analyzing massive collections of\n                    <jats:italic>time series<\/jats:italic>\n                    data. The sheer size of the latter hinders our ability to efficiently store them and also yields significant storage costs. Applying general purpose compression algorithms would effectively reduce the size of the data, at the expense of introducing significant computational overhead. Time Series Management Systems that have emerged to address the challenge of handling this overwhelming amount of information, cannot suffer the ingestion rate restrictions that such compression algorithms would cause. Data points are usually encoded using faster, streaming compression approaches. However, the techniques that contemporary systems use do not fully utilize the compression potential of time series data, with implications in both storage requirements and access times. In this work, we propose a novel streaming compression algorithm, suitable for floating point time series data. We empirically establish properties exhibited by a diverse set of time series and harness these features in our proposed encodings. Our experimental evaluation demonstrates that our approach\n                    <jats:italic>readily outperforms<\/jats:italic>\n                    competing techniques, attaining compression ratios that are competitive with\n                    <jats:italic>slower<\/jats:italic>\n                    general purpose algorithms, and on average around 50% of the space required by state-of-the-art streaming approaches. Moreover, our algorithm outperforms all earlier techniques with regards to both\n                    <jats:italic>compression and access time<\/jats:italic>\n                    , offering a significantly\n                    <jats:italic>improved trade-off<\/jats:italic>\n                    between space and speed. The aforementioned benefits of our approach - in terms of\n                    <jats:italic>all<\/jats:italic>\n                    space requirements, compression time and read access - significantly improve the efficiency in which we can store and analyze time series data.\n                  <\/jats:p>","DOI":"10.14778\/3551793.3551852","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T18:25:03Z","timestamp":1664475903000},"page":"3058-3070","source":"Crossref","is-referenced-by-count":81,"title":["Chimp"],"prefix":"10.14778","volume":"15","author":[{"given":"Panagiotis","family":"Liakos","sequence":"first","affiliation":[{"name":"Athens University of Economics and Business, Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katia","family":"Papakonstantinopoulou","sequence":"additional","affiliation":[{"name":"Athens University of Economics and Business, Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Kotidis","sequence":"additional","affiliation":[{"name":"Athens University of Economics and Business, Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Retrieved","author":"The","year":"2022","unstructured":"2009. The . xz File Format. (2009) . Retrieved May 21, 2022 from https:\/\/tukaani.org\/xz\/xz-file-format.txt 2009. The .xz File Format. (2009). Retrieved May 21, 2022 from https:\/\/tukaani.org\/xz\/xz-file-format.txt"},{"key":"e_1_2_1_2_1","unstructured":"2011. LZ4. Retrieved May 21 2022 from https:\/\/lz4.github.io\/lz4\/  2011. LZ4. Retrieved May 21 2022 from https:\/\/lz4.github.io\/lz4\/"},{"key":"e_1_2_1_3_1","volume-title":"snappy. Retrieved","year":"2022","unstructured":"2011. snappy. Retrieved May 21, 2022 from http:\/\/google.github.io\/snappy\/ 2011. snappy. Retrieved May 21, 2022 from http:\/\/google.github.io\/snappy\/"},{"key":"e_1_2_1_4_1","unstructured":"2015. Zstd. Retrieved May 21 2022 from https:\/\/facebook.github.io\/zstd\/  2015. Zstd. Retrieved May 21 2022 from https:\/\/facebook.github.io\/zstd\/"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2019.8766229"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3231935"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.948"},{"key":"e_1_2_1_8_1","unstructured":"Timescale Blog. 2020. Time-series compression algorithms explained. https:\/\/blog.timescale.com\/blog\/time-series-compression-algorithms-explained\/. Accessed: 2022-02-03.  Timescale Blog. 2020. Time-series compression algorithms explained. https:\/\/blog.timescale.com\/blog\/time-series-compression-algorithms-explained\/. Accessed: 2022-02-03."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2007.44"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHSS.2004.1392089"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0173-5"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687645"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838221"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2004.1281488"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2001.903264"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00681"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2740932"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236215"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00123"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014077"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260811"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00102"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/882082.882086"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.143"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3136623"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.48443\/S9YA-ZC81"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.48443\/RXR7-PP32"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.48443\/4E6X-V373"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.48443\/JNWY-B177"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.48443\/Z99V-0502"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Michael L Overton. 2001. Numerical computing with IEEE floating point arithmetic. SIAM.  Michael L Overton. 2001. Numerical computing with IEEE floating point arithmetic. SIAM.","DOI":"10.1137\/1.9780898718072"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49192-8_6"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824078"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2006.35"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.1997.645815"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627534.2627558"},{"key":"e_1_2_1_37_1","unstructured":"Aliaksandr Valialkin. 2019. VictoriaMetrics: achieving better compression than Gorilla for time series data. https:\/\/faun.pub\/victoriametrics-achieving-better-compression-for-time-series-data-than-gorilla-317bc1f95932. Accessed: 2022-05-31.  Aliaksandr Valialkin. 2019. VictoriaMetrics: achieving better compression than Gorilla for time series data. https:\/\/faun.pub\/victoriametrics-achieving-better-compression-for-time-series-data-than-gorilla-317bc1f95932. Accessed: 2022-05-31."},{"key":"e_1_2_1_38_1","unstructured":"VictoriaMetrics. 2022. VictoriaMetrics: fast cost-effective and scalable monitoring solution and time series database. https:\/\/github.com\/VictoriaMetrics\/VictoriaMetrics. Accessed: 2022-02-03.  VictoriaMetrics. 2022. VictoriaMetrics: fast cost-effective and scalable monitoring solution and time series database. https:\/\/github.com\/VictoriaMetrics\/VictoriaMetrics. Accessed: 2022-02-03."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415504"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3551793.3551852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T05:50:17Z","timestamp":1672206617000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3551793.3551852"}},"subtitle":["efficient lossless floating point compression for time series databases"],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":39,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.14778\/3551793.3551852"],"URL":"https:\/\/doi.org\/10.14778\/3551793.3551852","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}