Hierarchical Indexing and Compression Method with AI-Enhanced Restoration for Scientific Data Service
-
Published:2024-06-25
Issue:13
Volume:14
Page:5528
-
ISSN:2076-3417
-
Container-title:Applied Sciences
-
language:en
-
Short-container-title:Applied Sciences
Author:
Song Biao1, Fang Yuyang1, Guan Runda2, Zhu Rongjie3, Pan Xiaokang2, Tian Yuan4
Affiliation:
1. School of Software, Nanjing University of Information Science and Technology, Nanjing 210044, China 2. School of Computer Science, Nanjing University of Information Science and Technology, Nanjing 210044, China 3. School of Teacher Education, Nanjing University of Information Science and Technology, Nanjing 210044, China 4. School of International Education, Nanjing Institute of Technology, Nanjing 211167, China
Abstract
In the process of data services, compressing and indexing data can reduce storage costs, improve query efficiency, and thus enhance the quality of data services. However, different service requirements have diverse demands for data precision. Traditional lossy compression techniques fail to meet the precision requirements of different data due to their fixed compression parameters and schemes. Additionally, error-bounded lossy compression techniques, due to their tightly coupled design, cannot achieve high compression ratios under high precision requirements. To address these issues, this paper proposes a lossy compression technique based on error control. Instead of imposing precision constraints during compression, this method first uses the JPEG compression algorithm for multi-level compression and then manages data through a tree-based index structure to achieve error control. This approach satisfies error control requirements while effectively avoiding tight coupling. Additionally, this paper enhances data restoration effects using a deep learning network and provides a range query processing algorithm for the tree-based index to improve query efficiency. We evaluated our solution using ocean data. Experimental results show that, while maintaining data precision requirements (PSNR of at least 39 dB), our compression ratio can reach 64, which is twice that of the SZ compression algorithm.
Reference30 articles.
1. Liu, J., Di, S., Zhao, K., Jin, S., Tao, D., Liang, X., Chen, Z., and Cappello, F. (2021, January 7–10). Exploring autoencoder-based error-bounded compression for scientific data. Proceedings of the 2021 IEEE International Conference on Cluster Computing (CLUSTER), Portland, OR, USA. 2. Guan, R., Wang, Z., Pan, X., Zhu, R., Song, B., and Zhang, X. (2023). SbMBR Tree—A Spatiotemporal Data Indexing and Compression Algorithm for Data Analysis and Mining. Appl. Sci., 13. 3. A survey on data compression techniques: From the perspective of data quality, coding schemes, data type and applications;Jayasankar;J. King Saud Univ.-Comput. Inf. Sci.,2021 4. Ballé, J., Laparra, V., and Simoncelli, E.P. (2016). End-to-end optimized image compression. arXiv. 5. End-to-End Deep ROI Image Compression;Akutsu;IEICE Trans. Inf. Syst.,2020
|
|