.png){kind=icon}
返回
A Dual-Store Structure for Knowledge Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2021.3093200.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To effectively manage increasing knowledge graphs in various domains, a hot research topic, knowledge graph storage management, has emerged. Existing methods are classified to relational stores and native graph stores. Relational stores are able to store large-scale knowledge graphs and convenient in updating knowledge, but the query performance weakens obviously when the selectivity of a knowledge graph query is large. Native graph stores are efficient in processing complex knowledge graph queries due to its index-free adjacent property, but they are inapplicable to manage a large-scale knowledge graph due to limited storage budgets or inflexible updating process. Motivated by this, we propose a dual-store structure which leverages a graph store to accelerate the complex query process in the relational store. However, it is challenging to determine what data to transfer from relational store to graph store at what time. To address this problem, we formulate it as a Markov Decision Process and derive a physical design tuner DOTIL based on reinforcement learning. With DOTIL, the dual-store structure is adaptive to dynamic changing workloads. Experimental results on real knowledge graphs demonstrate that our proposed dual-store structure improves query performance up to average 50.11 percent compared with the most commonly used relational stores.
Keyword:
Query processing
Physical design
Relational databases
Tuners
Periodic structures
Knowledge engineering
Storage management
Knowledge graph
storage management
reinforcement learning
relational store
graph store
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
分享收藏分享收藏Research progress on the relationship between sex hormone‐binding globulin and male reproductive system diseases.png)
Andrologia
OAAI
AndrologiaIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容