.png){kind=icon}
.png){kind=icon}
Return
Data cube-based storage optimization for resource-constrained edge computing
.png){kind=icon}
OA
AI
DOI：10.1016/j.hcc.2024.100212.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the evolving landscape of the digital era, edge computing emerges as an essential paradigm, especially critical for low-latency, real-time applications and Internet of Things (IoT) environments. Despite its advantages, edge computing faces severe limitations in storage capabilities and is fraught with reliability issues due to its resource-constrained nature and exposure to challenging conditions. To address these challenges, this work presents a tailored storage mechanism for edge computing, focusing on space efficiency and data reliability. Our method comprises three key steps: relation factorization, column clustering, and erasure encoding with compression. We successfully reduce the required storage space by deconstructing complex database tables and optimizing data organization within these sub-tables. We further add a layer of reliability through erasure encoding. Comprehensive experiments on TPC-H datasets substantiate our approach, demonstrating storage savings of up to 38.35% and time efficiency improvements by 3.96x in certain cases. Furthermore, our clustering technique shows a potential for additional storage reduction up to 40.41%. (c) 2024 The Author(s). Published by Elsevier B.V. on behalf of Shandong University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords:
Edge computing
Data storage
Reliability
Compression efficiency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
H
IF:
3
Papers:
239
Citations:
407
Organization
No organization information available