答案图:大型图中的因子分解问题
Answer Graph: Factorization Matters in Large Graphs
摘要:
我们的回答图方法来评估SPARQL合取查询(CQ)找到一个因式分解的答案集,一个答案图,然后从中找到嵌入元组。这种方法可以大大降低CQ的评估成本。这提供了第二个优势:我们可以构建一个基于成本的计划器。我们提出了答案图的方法,并概述了我们的原型系统,线框。然后,我们通过YAGO2s数据集上的微基准测试提供概念证明,该数据集具有两种常见的查询形状,雪花和钻石。我们将Wireframe的性能与PostgreSQL、Virtuoso、MonetDB和Neo4J进行了比较,以说明我们的应答图方法的性能优势。
英文摘要:
Our answer-graph method to evaluate SPARQL conjunctive queries (CQs) finds a factorized answer set first, an answer graph, and then finds the embedding tuples from this. This approach can reduce greatly the cost to evaluate CQs. This affords a second advantage: we can construct a cost-based planner. We present the answer-graph approach, and overview our prototype system, Wireframe. We then offer proof of concept via a micro-benchmark over the YAGO2s dataset with two prevalent shapes of queries, snowflake and diamond. We compare Wireframe's performance over these against PostgreSQL, Virtuoso, MonetDB, and Neo4J to illustrate the performance advantages of our answer-graph approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。