基于重构的RDF图的RDFS本体查询应答Reformulation-based query answering for RDF graphs with RDFS ontologies |
|
课程网址: | http://videolectures.net/eswc2019_buron_reformulation_ontologies/ |
主讲教师: | Maxime Buron |
开课单位: | 巴黎综合理工学院 |
开课时间: | 2019-09-19 |
课程语种: | 英语 |
中文简介: | 传统上,RDF知识库中的查询应答要么通过图形饱和(即将所有隐式三元组添加到图形中)执行,要么通过查询重新格式化(即修改查询以查找精确包含原始查询所需内容的显式三元组)执行。RDF中最具表现力的片断是所谓的数据库片断[12],其中隐式三元组仅限于使用RDFS本体所涉及的那些片断。在这个片段中,查询应答目前仅限于查询数据三元组(非RDFS);然而,RDF特有的一个强大特性是能够同时查询数据和模式三元组。在本文中,我们解决了一般的查询应答问题,通过一个查询前重新格式化步骤,将其简化为使用[12]中的查询重新格式化技术解决的问题。我们还报告了实验结果,证明了我们的重新格式化算法的低成本。 |
课程简介: | Query answering in RDF knowledge bases has traditionally been performed either through graph saturation, i.e., adding all implicit triples to the graph, or through query reformulation, i.e., modifying the query to look for the explicit triples entailing precisely what the original query asks for. The most expressive fragment of RDF for which Reformulation-based quey answering exists is the so-called database fragment [12], in which implicit triples are restricted to those entailed using an RDFS ontology. Within this fragment, query answering was so far limited to the interrogation of data triples (non-RDFS ones); however, a powerful feature specific to RDF is the ability to query data and schema triples together. In this paper, we address the general query answering problem by reducing it, through a pre-query reformulation step, to that solved by the query reformulation technique of [12]. We also report on experiments demonstrating the low cost of our reformulation algorithm. |
关 键 词: | 基于重构的RDF图; RDFS本体查询应答; RDF知识库; 同时查询数据和模式三元组 |
课程来源: | 视频讲座网 |
数据采集: | 2022-09-23:cyh |
最后编审: | 2022-09-28:cyh |
阅读次数: | 29 |