Academic Journal
Graph Stream Compression Scheme Based on Pattern Dictionary Using Provenance
| العنوان: | Graph Stream Compression Scheme Based on Pattern Dictionary Using Provenance |
|---|---|
| المؤلفون: | Hyeonbyeong Lee, Bokyoung Shin, Dojin Choi, Jongtae Lim, Kyoungsoo Bok, Jaesoo Yoo |
| المصدر: | Applied Sciences, Vol 14, Iss 11, p 4553 (2024) |
| بيانات النشر: | MDPI AG |
| سنة النشر: | 2024 |
| المجموعة: | Directory of Open Access Journals: DOAJ Articles |
| مصطلحات موضوعية: | graph stream, graph compression, provenance data, pattern dictionary, FP-tree, Technology, Engineering (General). Civil engineering (General), TA1-2040, Biology (General), QH301-705.5, Physics, QC1-999, Chemistry, QD1-999 |
| الوصف: | With recent advancements in network technology and the increasing popularity of the internet, the use of social network services and Internet of Things devices has flourished, leading to a continuous generation of large volumes of graph stream data, where changes, such as additions or deletions of vertices and edges, occur over time. Additionally, owing to the need for the efficient use of storage space and security requirements, graph stream data compression has become essential in various applications. Even though various studies on graph compression methods have been conducted, most of them do not fully reflect the dynamic characteristics of graph streams and the complexity of large graphs. In this paper, we propose a compression scheme using provenance data to efficiently process and analyze large graph stream data. It obtains provenance data by analyzing graph stream data and builds a pattern dictionary based on this to perform dictionary-based compression. By improving the existing dictionary-based graph compression methods, it enables more efficient dictionary management through tracking pattern changes and evaluating their importance using provenance. Furthermore, it considers the relationships among sub-patterns using an FP-tree and performs pattern dictionary management that updates pattern scores based on time. Our experiments show that the proposed scheme outperforms existing graph compression methods in key performance metrics, such as compression rate and processing time. |
| نوع الوثيقة: | article in journal/newspaper |
| اللغة: | English |
| تدمد: | 2076-3417 |
| Relation: | https://www.mdpi.com/2076-3417/14/11/4553; https://doaj.org/toc/2076-3417; https://doaj.org/article/34ededf82e104c03a75f9a68ac4502d4 |
| DOI: | 10.3390/app14114553 |
| الاتاحة: | https://doi.org/10.3390/app14114553 https://doaj.org/article/34ededf82e104c03a75f9a68ac4502d4 |
| رقم الانضمام: | edsbas.B65309D1 |
| قاعدة البيانات: | BASE |
Full Text Finder | تدمد: | 20763417 |
|---|---|
| DOI: | 10.3390/app14114553 |