用布尔张量代数定义SPARQL
On Defining SPARQL with Boolean Tensor Algebra
摘要：
资源描述框架（RDF）将信息表示为主语-谓语-宾语三元组。这些三元组通常被解释为有向标号图。我们提出了一种替代方法，将数据解释为3路布尔张量。我们展示了如何SPARQL查询-RDF的标准查询-可以表示为布尔代数中的初等运算，给我们一个完整的重新解释RDF和SPARQL。我们将展示如何布尔张量解释允许新的优化和分析的复杂性SPARQL查询。例如，估计不同连接查询的结果大小变得简单得多。
英文摘要：
The Resource Description Framework (RDF) represents information as subject-predicate-object triples. These triples are commonly interpreted as a directed labelled graph. We propose an alternative approach, interpreting the data as a 3-way Boolean tensor. We show how SPARQL queries - the standard queries for RDF - can be expressed as elementary operations in Boolean algebra, giving us a complete re-interpretation of RDF and SPARQL. We show how the Boolean tensor interpretation allows for new optimizations and analyses of the complexity of SPARQL queries. For example, estimating the size of the results for different join queries becomes much simpler.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
