0


单音SPARQL查询的规范化

Canonicalisation of Monotone SPARQL Queries
课程网址: http://videolectures.net/iswc2018_salas_canonicalisation_sparql_q...  
主讲教师: Jaime Salas
开课单位: 智利大学
开课时间: 2018-11-22
课程语种: 英语
中文简介:
在表达式查询语言(如SPARQL)的上下文中缓存由于检测等价查询的困难而变得复杂:确定两个联合查询是否等价是npc,其中添加更多的查询特性使问题无法确定。尽管如此复杂,在本文中,我们提出了一种算法,该算法执行SPARQL查询的语法规范化,使得规范化查询的答案与原始查询相比不会发生变化。我们可以保证SPARQL核心片段中两个查询的规范化(带有select、project、join和union的单调查询)是相等的,当且仅当这两个查询是等价的;我们还支持其他SPARQL特性,但具有较弱的可靠性保证:(部分)规范化查询等同于输入查询。尽管规范化必须比等价问题更难,但我们证明该算法对于从SPARQL端点日志中获取的真实查询是实用的,并且进一步表明,与纯语法方法相比,它检测到的等价查询更多。我们还展示了针对综合查询的实验结果,这些综合查询旨在对规范化方法进行压力测试,强调了困难的情况。
课程简介: Caching in the context of expressive query languages such as SPARQL is complicated by the difficulty of detecting equivalent queries: deciding if two conjunctive queries are equivalent is npc, where adding further query features makes the problem undecidable. Despite this complexity, in this paper we propose an algorithm that performs syntactic canonicalisation of SPARQL queries such that the answers for the canonicalised query will not change versus the original. We can guarantee that the canonicalisation of two queries within a core fragment of SPARQL (monotone queries with select, project, join and union) is equal if and only if the two queries are equivalent; we also support other SPARQL features but with a weaker soundness guarantee: that the (partially) canonicalised query is equivalent to the input query. Despite the fact that canonicalisation must be harder than the equivalence problem, we show the algorithm to be practical for real-world queries taken from SPARQL endpoint logs, and further show that it detects more equivalent queries than when compared with purely syntactic methods. We also present the results of experiments over synthetic queries designed to stress-test the canonicalisation method, highlighting difficult cases.
关 键 词: SPARQL核心片段; 表达式查询语言; 规范化方法进行压力测试
课程来源: 视频讲座网
数据采集: 2022-12-20:cyh
最后编审: 2022-12-23:cyh
阅读次数: 43