관계형데이터를 이용한 그래프 데이터베이스의 모델별 구조 분석과 쿼리 성능 비교 연구

• Published in: 멀티미디어학회논문지 Vol. 22; no. 9; pp. 1036 - 1045
• Main Authors: 배석민(Bae Suk Min), 김진형(Kim Jin Hyung), 유재민(Yoo Jae Min), 양성열(Yang Seong Ryul), 정재진(Jung Jai Jin)
• Format: Journal Article
• Language: Korean
• Published: 한국멀티미디어학회 2019
• Subjects: 전자/정보통신공학; Performance Test; Graph Database; Graph Model Structure
• ISSN: 1229-7771; 2384-0102
• DOI: 10.9717/kmms.2019.22.9.1036

Relational databases have a notion of normalization, in which the model for storing data is standardized according to the organization's business processes or data operations. However, the graph database is relatively early in this standardization and has a high degree of freedom in modeling. Therefore various models can be created with the same data, depending on the database designers. The essences of the graph database are two aspects. First, the graph database allows accessing relationships between the objects semantically. Second, it makes relationships between entities as important as individual data. Thus increasing the degree of freedom in modeling and providing the modeling developers with a more creative system. This paper introduces different graph models with test data. It compares the query performances by the results of response speeds to the query executions per graph model to find out how the efficiency of each model can be maximized.