查询重写的指数下界和分离
Exponential Lower Bounds and Separation for Query Rewriting
摘要：
我们建立连接的电路和计算单调布尔函数的公式的大小和一阶和非递归的数据重写OWL 2 QL本体的合取查询的大小之间。我们使用已知的下限和分离结果从电路复杂性证明类似的结果，不使用非签名常数的重写的大小。例如，我们表明，在最坏的情况下，积极的存在和非递归的数据库重写是指数比原来的查询更长;非递归的数据库重写一般指数比积极的存在重写更简洁;而一阶重写可以是超多项式比积极的存在重写更简洁。
英文摘要：
We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we show that, in the worst case, positive existential and nonrecursive Datalog rewritings are exponentially longer than the original queries; nonrecursive Datalog rewritings are in general exponentially more succinct than positive existential rewritings; while first-order rewritings can be superpolynomially more succinct than positive existential rewritings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
