Browse > Article
http://dx.doi.org/10.5392/JKCA.2018.18.02.438

Efficient Storage Management Scheme for Graph Historical Retrieval  

Kim, Gihoon (충북대학교 정보통신공학과)
Kim, Ina (충북대학교 빅데이터협동과정)
Choi, Dojin (충북대학교 정보통신공학과)
Kim, Minsoo (충북대학교 정보통신공학과)
Bok, Kyoungsoo (충북대학교 정보통신공학과)
Yoo, Jaesoo (충북대학교 정보통신공학과)
Publication Information
The Journal of the Korea Contents Association / v.18, no.2, 2018 , pp. 438-449 More about this Journal
Abstract
Recently, various graph data have been utilized in various fields such as social networks and citation networks. As the graph changes dynamically over time, it is necessary to manage the graph historical data for tracking changes and retrieving point-in-time graphs. Most historical data changes partially according to time, so unchanged data is stored redundantly when data is stored in units of time. In this paper, we propose a graph history storage management method to minimize the redundant storage of time graphs. The proposed method continuously detects the change of the graph and stores the overlapping subgraph in intersection snapshot. Intersection snapshots are connected by a number of delta snapshots to maintain change data over time. It improves space efficiency by collectively managing overlapping data stored in intersection snapshots. We also linked intersection snapshots and delta snapshots to retrieval the graph at that point in time. Various performance evaluations are performed to show the superiority of the proposed scheme.
Keywords
Graph Storage; Historical Graph; Graph Retrieval; social Data; Dynamic Graph;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 H. He and A. K. Singh, "Graphs-at-a-time: query language and access methods," Proc. ACM SIGMOD International Conference on Management of Data, pp.405-418, 2008.
2 K. Semertzidis and E. Pitoura, "Time Traveling in Graphs using a Graph Database," Proc. Workshops of the EDBT/ICDT 2016 Joint Conference, 2016.
3 A. G. Labouseur, P. W. Olsen, and J. H. Hwang, "Scalable and Robust Management of Dynamic Graph Data," Proc. International Workshop on Big Dynamic Distributed Data, pp.43-48, 2013.
4 B. Salzberg and V. Tsotras, "Comparison of access methods for time-evolving data," ACM Computing Surveys, Vol.31, No.2, pp.158-221,1999.   DOI
5 K. Semertzidis, E. Pitoura, and K. Lillis, "TimeReach: Historical Reachability Queries on Evolving Graphs," Proc. International Conference on Extending Database Technology, pp.121-132, 2015.
6 U. Khurana and A. Deshpande, "Efficient snapshot retrieval over historical graph data," Proc. International Conference on Data Engineering, pp.997-1008, 2013.
7 D. A. Bader, J. Berry, A. Amos-Binks, D. Chavarria-Miranda, C. Hastings, K. Madduri, and S. C. poulos, "STINGER: Spatio-temporal interaction networks and graphs (STING) extensible representation," Georgia Institute of Technology, Tech. Rep., 2009.
8 K. Iwabuchi, S. Sallinen, R.Pearce, B. Van Essen, M. Gokhale, and S. Matsuoka, "Towards a Distributed Large-Scale Dynamic Graph Data Store," Proc. International Parallel and Distributed Processing Symposium Workshops, pp.892-901, 2016.
9 P. Macko, V. J. Marathe, D. W. Margo, and M. I. Seltzer, "LLAMA: Efficient graph analytics using Large Multiversioned Arrays," Proc. International Conference on Data Engineering, pp.363-374, 2015.
10 Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, "Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide," SIAM, pp.315-336, 2000.
11 유병국, 김순홍, "소셜네트워크 분석을 통한 마케팅 전략," 한국콘텐츠학회논문지, 제13권, 제5호, pp.396-407, 2013.   DOI
12 J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica, "GraphX: graph processing in a distributed dataflow framework," Proc. USENIX Symposium on Operating Systems Design and Implementation, pp.599-613, 2014.
13 G. Malewicz, M. Austern, A. Bik, J. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: a system for large-scale graph processing," Proc. ACM SIGMOD International Conference on Management of Data, pp.135-146, 2010.
14 임종태, 복경수, 유재수, "대용량 그래프 환경에서 스카이라인을 이용한 서브 그래프 유사도 측정 기법," 한국콘텐츠학회 종합학술대회, pp.47-48, 2017.
15 A. Ching, S. Edunov, M. Kabiljo, D. Logothetis, and S. Muthukrishnan, "One trillion edges: Graph processing at facebook-scale," Proceedings of the VLDB Endowment, Vol.8, No.12, pp.184-1815, 2015.
16 https://carestruck.org/happens-internet-minute