首页> 外文会议>IEEE international conference on data engineering >GQBE: Querying knowledge graphs by example entity tuples
【24h】

GQBE: Querying knowledge graphs by example entity tuples

机译:GQBE:通过示例实体元组查询知识图形

获取原文

摘要

We present GQBE, a system that presents a simple and intuitive mechanism to query large knowledge graphs. Answers to tasks such as “list university professors who have designed some programming languages and also won an award in Computer Science” are best found in knowledge graphs that record entities and their relationships. Real-world knowledge graphs are difficult to use due to their sheer size and complexity and the challenging task of writing complex structured graph queries. Toward better usability of query systems over knowledge graphs, GQBE allows users to query knowledge graphs by example entity tuples without writing complex queries. In this demo we present: 1) a detailed description of the various features and user-friendly GUI of GQBE, 2) a brief description of the system architecture, and 3) a demonstration scenario that we intend to show the audience.
机译:我们呈现GQBE,这是一个呈现简单直观的查询大知识图形的系统。 “列出了设计了一些编程语言的列表大学教授以及在计算机科学中获得奖项”的答案,以知识图中最佳地发现了实体及其关系。由于其纯粹的大小和复杂性以及编写复杂结构图查询的具有挑战性的任务,难以使用的现实世界知识图。在知识图形上,对查询系统的更好可用性,GQBE允许用户通过示例实体元组查询知识图,而无需编写复杂查询。在这个演示中我们存在:1)GQBE的各种特征和用户友好GUI的详细描述,2)系统架构的简要描述,以及3)我们打算显示观众的示范场景。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号