.png){kind=icon}
.png){kind=icon}
Return
NPAC: numeric pattern aware compression algorithm for floating-point time-series data
.png){kind=icon}
PRE
AI
DOI：10.1007/s11280-025-01382-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the rapid development of the Internet of Things (IoT), massive numbers of devices generate vast amounts of time series data. Efficient compression techniques are essential for reducing storage costs and enhancing query performance. Among various data types, floating-point time series data poses significant compression challenges due to its high precision and dynamic range. However, the numerical patterns of time series data vary widely across applications and sensor types, so compression algorithms designed for a single pattern often lack the flexibility to address diverse needs. To overcome this limitation, we propose NPAC, a Numeric Pattern-Aware Compression algorithm for floating-point time-series data. NPAC employs a classification model at the time window level to identify the underlying numerical patterns in the data and introduces a two-layer decision architecture to balance compression ratio and time overhead. In the first layer, several candidate schemes with potentially high compression ratios are selected based on the classification model. In the second layer, a cost function evaluates both compression and decompression time to select the most efficient scheme as the optimal one. We evaluate NPAC against traditional compression algorithms using 18 real-world datasets. The results show that NPAC outperforms the others in most scenarios, achieving an average compression ratio improvement of 61.63%.
Keywords:
Time series database
Lossless compression
Floating-point compression
Machine learning
Data numerical patterns
Journal
W
IF:
0
Papers:
68
Citations:
0