arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.04044cs.DBcs.DScs.LO
收藏

FAQ:常见问题

FAQ: Questions Asked Frequently

Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra

AI总结:

本文定义并研究了功能聚合查询(FAQ)问题,提出InsideOut算法,通过变量消元和优化变量排序,统一并改进了约束满足、数据库、矩阵运算、图模型推断和逻辑中的多种查询求解方法。

摘要:

我们定义并研究了功能聚合查询(FAQ)问题,该问题涵盖了约束满足、数据库、矩阵运算、概率图模型和逻辑中的许多常见问题。这是我们主要的概念性贡献。\n随后,我们提出了一种名为“InsideOut”的简单算法来解决这个一般性问题。InsideOut是传统的基于变量消元的约束规划动态规划方法的一种变体。我们的变体在基本变量消元的基础上增加了几个简单的调整,以处理FAQ的普遍性,充分利用Grohe和Marx的分数边覆盖框架,以及最近最坏情况最优关系连接算法的分析。\n与约束规划和图模型推断一样,为了使InsideOut高效运行,我们需要解决一个优化问题来计算合适的“变量排序”。这项工作的主要技术贡献是对变量排序何时与输入FAQ表达式给出的变量排序“语义等价”进行了精确刻画。然后,我们设计了一种近似算法来寻找具有最佳“分数FAQ宽度”的等价变量排序。我们的结果蕴含了图模型推断、矩阵运算、关系连接和逻辑中的一系列已知结果和一些新结果。\n我们还简要解释了最近关于连接的超最坏情况分析算法以及求解SAT和#SAT的算法如何被视为变量消元,以在紧凑表示的输入函数上求解FAQ。

英文摘要:

We define and study the Functional Aggregate Query (FAQ) problem, which encompasses many frequently asked questions in constraint satisfaction, databases, matrix operations, probabilistic graphical models and logic. This is our main conceptual contribution. We then present a simple algorithm called "InsideOut" to solve this general problem. InsideOut is a variation of the traditional dynamic programming approach for constraint programming based on variable elimination. Our variation adds a couple of simple twists to basic variable elimination in order to deal with the generality of FAQ, to take full advantage of Grohe and Marx's fractional edge cover framework, and of the analysis of recent worst-case optimal relational join algorithms. As is the case with constraint programming and graphical model inference, to make InsideOut run efficiently we need to solve an optimization problem to compute an appropriate 'variable ordering'. The main technical contribution of this work is a precise characterization of when a variable ordering is 'semantically equivalent' to the variable ordering given by the input FAQ expression. Then, we design an approximation algorithm to find an equivalent variable ordering that has the best 'fractional FAQ-width'. Our results imply a host of known and a few new results in graphical model inference, matrix operations, relational joins, and logic. We also briefly explain how recent algorithms on beyond worst-case analysis for joins and those for solving SAT and #SAT can be viewed as variable elimination to solve FAQ over compactly represented input functions.

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

↑