본문 바로가기
  • Home

Is-A Node Type Modeling Methodology to Improve Pattern Query Performance in Graph Database

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2020, 25(4), pp.123-131
  • DOI : 10.9708/jksci.2020.25.04.123
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : February 6, 2020
  • Accepted : April 17, 2020
  • Published : April 30, 2020

PARK UCHANG 1

1덕성여자대학교

Accredited

ABSTRACT

The pattern query in graph database has advantages of easy query expression and high query processing performance compared to relational database SQL. However, unlike the relational database, the graph database may not utilize the advantages of pattern query depending on modeling because the methodology for building the logical data model is not defined. In this study, in the is-a node modeling method that appears during the graph modeling process, we experiment that there is a difference in performance between graph pattern query when designing with a generalization model and designing with a specialization model. As a result of the experiment, it was shown that better performance can be obtained when the is-a node is designed as a specialization model. In addition, when writing a pattern query, we show that if a variable is bound to a node or edge, performance may be better than that of the variable of not bounded. The experimental results can be presented as an is-a node modeling method for pattern query and a graph query writing method in the graph database.

Citation status

* References for papers published after 2023 are currently being built.

This paper was written with support from the National Research Foundation of Korea.