arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.26269cs.DB
收藏

基于RML映射的查询特定剪枝(扩展版)

Query-Specific Pruning of RML Mappings (Extended Version)

Ghent University - imec(根特大学-imec);Linköping University(林雪平大学)

Sitt Min Oo, Olaf Hartig

AI总结:

本文定义了SPARQL查询相对于RML映射获得的RDF数据的可满足性,利用该性质对RML映射进行剪枝,以实现部分RDF图材料化,从而提高动态联邦查询环境中生成RDF图的效率。

摘要:

当前基于RML的知识图谱构建方法专注于完整RDF图的材料化,而未考虑用户查询。因此,在动态查询环境中,映射引擎效率低下,即使只需要小部分图来回答用户查询,仍会生成大规模图。本文正式定义了SPARQL查询相对于通过RML映射获得的RDF数据的可满足性,并利用这一属性对RML映射进行剪枝,以实现部分RDF图的材料化。在GTFS-Madrid基准测试中,剪枝显著减少了材料化时间,同时减小了RDF图的规模,并明显提高了查询时间。因此,使现有的材料化引擎能够高效支持在用户查询频繁变化的动态联邦查询环境中生成RDF图。

英文摘要:

Current approaches for knowledge graph construction with RML focus on full RDF graph materialization without considering user queries, which is inefficient in dynamic query environments where often only a specific subset of the full graph is needed to answer a given query. This paper introduces an approach to prune RML mappings such that the resulting partially-materialized graph is still sufficient to answer a given SPARQL query completely. By evaluating the approach based on a well-know RML materialization benchmark, we show that such pruning significantly reduces both the materialization time and the size of the produced graph, while also noticeably reducing querying time

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑