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

用OPTIONAL和UNION表达式高效执行SPARQL查询

Efficient Execution of SPARQL Queries with OPTIONAL and UNION Expressions

Lei Zou, Yue Pang, M. Tamer Özsu, Jiaqi Chen

摘要:

RDF数据集的激增导致了对SPARQL查询处理优化的研究。大多数现有的工作都集中在基本图模式(BGP)上,而忽略了SPARQL中的其他重要运算符,如UNION和OPTIONAL。SPARQL查询与这些运营商,我们称为SPARQL-UO,提出了严重的查询计划生成的挑战。在本文中,我们提出了一种新的BGP为基础的评估(BE)-树表示的查询计划的基础上,使用BGP执行作为一个构建块执行SPARQL-UO查询的技术。在此之上,我们提出了一系列的成本驱动的BE树转换,以产生更有效的计划,通过减少搜索空间和中间结果的大小,和候选人修剪技术,进一步提高效率,在查询时。实验证实,我们的方法优于国家的最先进的数量级。

英文摘要:

The proliferation of RDF datasets has resulted in studies focusing on optimizing SPARQL query processing. Most existing work focuses on basic graph patterns (BGPs) and ignores other vital operators in SPARQL, such as UNION and OPTIONAL. SPARQL queries with these operators, which we abbreviate as SPARQL-UO, pose serious query plan generation challenges. In this paper, we propose techniques for executing SPARQL-UO queries using BGP execution as a building block, based on a novel BGP-based Evaluation (BE)-Tree representation of query plans. On top of this, we propose a series of cost-driven BE-tree transformations to generate more efficient plans by reducing the search space and intermediate result sizes, and a candidate pruning technique that further enhances efficiency at query time. Experiments confirm that our method outperforms the state-of-the-art by orders of magnitude.

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

↑