• 中国期刊全文数据库
  • 中国学术期刊综合评价数据库
  • 中国科技论文与引文数据库
  • 中国核心期刊(遴选)数据库
郑晋斌, 李优, 周娅. 基于知识图谱终身嵌入学习的基数估计J. 桂林电子科技大学学报, xxxx, x(x): 1-8. DOI: 10.16725/j.1673-808X.2024208
引用本文: 郑晋斌, 李优, 周娅. 基于知识图谱终身嵌入学习的基数估计J. 桂林电子科技大学学报, xxxx, x(x): 1-8. DOI: 10.16725/j.1673-808X.2024208
ZHENG Jinbin, LI You, ZHOU Ya. Cardinality estimation using lifelong embedding learning on knowledge graphsJ. Journal of Guilin University of Electronic Technology, xxxx, x(x): 1-8. DOI: 10.16725/j.1673-808X.2024208
Citation: ZHENG Jinbin, LI You, ZHOU Ya. Cardinality estimation using lifelong embedding learning on knowledge graphsJ. Journal of Guilin University of Electronic Technology, xxxx, x(x): 1-8. DOI: 10.16725/j.1673-808X.2024208

基于知识图谱终身嵌入学习的基数估计

Cardinality estimation using lifelong embedding learning on knowledge graphs

  • 摘要: 动态知识图谱中的基数估计对于优化图数据库中的查询至关重要,任务目标是针对输入的查询语句,获取动态图中准确的查询基数,通过代价分析,进而选择高效的执行计划以优化查询过程。现有的解决方案主要侧重于静态图,且无法解决不断增长后的大型知识图谱上估计准确性问题。提出的基于知识图谱终身嵌入学习的基数估计模型,采用增量式的方式获取变化的查询图,利用终身嵌入学习为知识图谱中动态实体关系创建有意义的嵌入,捕获不同类型查询图和数据图之间连接的相关性,然后利用图神经网络来学习查询表示并估计连接查询的基数。此外,模型能够应用于不断增长的知识图谱,能够在动态变化的知识图谱场景中更准确地预测查询基数。

     

    Abstract: Cardinality estimation in dynamic knowledge graphs is crucial for optimizing queries in graph databases. The task goal is to obtain accurate query cardinality in dynamic graphs for input query statements and then select efficient execution plans to optimize the query process through cost analysis. Existing solutions mainly focus on static graphs and cannot solve the problem of estimation accuracy on large knowledge graphs that are constantly growing. The proposed cardinality estimation model based on lifelong learning of knowledge graph embedding incrementally acquires the changing query graph, uses lifelong embedding learning to create meaningful embeddings for dynamic entity relationships in knowledge graphs, captures the correlation between connections between different types of query graphs and data graphs, and then uses graph neural networks to learn query representations and estimate the cardinality of connected queries. The model can be applied to growing knowledge graphs and more accurately predict query cardinality in dynamically changing knowledge graph scenarios.

     

/

返回文章
返回