スケールフリー性を考慮した反復的グラフ走査を含む問合せ最適化
Warning: foreach() argument must be of type array|object, null given in /usr/share/nginx/html/wp-content/themes/iconic-one/functions.php on line 673
波多野 賢治
Warning: foreach() argument must be of type array|object, null given in /usr/share/nginx/html/wp-content/themes/iconic-one/functions.php on line 673
楠 和馬
概要
Graphs are data structures consisting of nodes and edges representing data relationships. Due to their complexity, graphs can become large and complex to manage. Graph Database Management Systems (GDBMS) have been developed to tackle this, allowing efficient search and analysis of large graph structures. In real-world graphs, a few high-degree nodes often dominate, while most other nodes have fewer connections. This fact can lead to inefficiencies in graph traversal, where these high-degree nodes are encountered frequently, slowing down the search process. Our previous research, RPD-index, was designed to reduce the cost of searching high-degree nodes. As the graph grows, however, building the RPD-index becomes time-consuming. This study proposes a more efficient method for constructing the RPD-index and evaluates its effectiveness in improving the performance of graph traversal while minimizing construction time.
引用情報
波多野 賢治, 楠 和馬, スケールフリー性を考慮した反復的グラフ走査を含む問合せ最適化, 2024年度ハリス理化学研究発表会予稿集, 2024-11-26.