Aggregable Generalized Deduplication

Considering the edge-cloud environment and uploading large amounts of data from IoT devices through the edge node towards the cloud, this paper investigates an aggregation method of data streams compressed by Generalized Deduplication (GD) for the edge node. The simplest way is to decode GDcompressed data streams, aggregate raw streams and re-encode it into a single GD-compression stream. However, this involves a large computational complexity for aggregation due to the decoding and re-encoding of linear codes underlain the GD. From this observation, this paper presented a novel aggregation method, called Aggregable GD (AGD). The AGD is designed to aggregate multiple GD streams into a single AGD stream, and removes duplicated information among GD streams without decoding and re-encoding operations of GD. This paper also shows that AGD involves smaller computational complexity for data aggregation than the ordinary simple scheme. Furthermore, by the preliminary computer simulation using the Hamming code as the underlying linear code of GD, we demonstrate that AGD performs comparable to the ordinary method from the viewpoints of the compression rate.

Authors

Institutions

Publication Details

Published
2024-11-10
DOI
https://doi.org/10.23919/isita60732.2024.10858264
Citations
1
Primary Topic
Advanced Algebra and Logic
Type
article
Field-Weighted Citation Impact
0.36
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Aggregable Generalized Deduplication

Jun Kurihara, Toshiaki Tanaka, Riki Aoshima
1 citations
Advanced Algebra and Logic
0.36
article

Aggregable Generalized Deduplication

Jun Kurihara, Toshiaki Tanaka, Riki Aoshima
article en
1 citations

Abstract

Considering the edge-cloud environment and uploading large amounts of data from IoT devices through the edge node towards the cloud, this paper investigates an aggregation method of data streams compressed by Generalized Deduplication (GD) for the edge node. The simplest way is to decode GDcompressed data streams, aggregate raw streams and re-encode it into a single GD-compression stream. However, this involves a large computational complexity for aggregation due to the decoding and re-encoding of linear codes underlain the GD. From this observation, this paper presented a novel aggregation method, called Aggregable GD (AGD). The AGD is designed to aggregate multiple GD streams into a single AGD stream, and removes duplicated information among GD streams without decoding and re-encoding operations of GD. This paper also shows that AGD involves smaller computational complexity for data aggregation than the ordinary simple scheme. Furthermore, by the preliminary computer simulation using the Hamming code as the underlying linear code of GD, we demonstrate that AGD performs comparable to the ordinary method from the viewpoints of the compression rate.

University of Hyogo (JP)
Openalex Percentile: Top 32%
Advanced Algebra and Logic
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Aggregable Generalized Deduplication — Jun Kurihara, Toshiaki Tanaka, et al. · (2024) | TGRS Research Map | TGRS