首页> 外国专利> CONSTRUCTING A KNOWLEDGE GRAPH EMPLOYING MULTIPLE SUBGRAPHS AND A LINKING LAYER INCLUDING MULTIPLE LINKING NODES

CONSTRUCTING A KNOWLEDGE GRAPH EMPLOYING MULTIPLE SUBGRAPHS AND A LINKING LAYER INCLUDING MULTIPLE LINKING NODES

机译:构建采用多个子图的知识图和包括多个链接节点的链接层

摘要

A graph-based data storage and retrieval system in which multiple subgraphs representing respective datasets in different namespaces are interconnected via a linking or "canonical" layer. Respective datasets represented by subgraphs in different namespaces may pertain to a particular information domain, and may include heterogeneous datasets. The canonical layer provides for a substantial reduction of graph complexity required to interconnect respective corresponding nodes in different subgraphs, which in turn offers distinct advantages as the number of subgraphs increases for the particular domain(s) of interest. Examples of such advantages include reductions in data storage and retrieval times, enhanced query/search efficacy and discovery of relationships in different parts of the system, enhanced ability to infer relationships in different parts of the system, and enhanced ability to train data models for natural language processing and other purposes based on information extracted from the system.
机译:基于图的数据存储和检索系统,其中在不同名称空间中表示各个数据集的多个子图通过链接或“规范”层互连。由不同名称空间中的子图表示的各个数据集可以涉及特定信息域,并且可以包括异构数据集。规范层提供了在不同子图中互连各个对应节点所需的图形复杂性的显着降低,这反过来提供了不同的优势,因为所感兴趣的特定域的子图的数量增加。这种优点的示例包括减少数据存储和检索时间,增强查询/搜索效果和系统不同部分的关系发现,增强了系统不同部分中的关系的能力,以及增强了自然培训数据模型的能力基于系统中提取的信息的语言处理和其他目的。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号