S4: Top-k Spreadsheet-Style Search for Query Discovery
S4: Top-k Spreadsheet-Style Search for Query Discovery
复制标题
S4：用于查询发现的 Top-k 电子表格式搜索
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
S. Chaudhuri
中科院分区：
文献类型：
--
作者：
Fotis Psallidas;Bolin Ding;K. Chakrabarti;S. Chaudhuri
企业信息工作者通常知道查询输出中应出现的一些示例元组。查询发现系统已被开发用于发现在其输出中包含给定示例元组的项目连接查询。但是，它们要求输出准确包含所有示例元组并且不执行任何排名。为了解决这个限制，我们研究了有效发现 top-k 项目连接查询的问题，这些查询在其输出中大约包含给定的示例元组。我们扩展我们的算法，以便在用户完成键入/修改单元格后立即增量生成结果。我们对现实生活和合成数据集的实验表明，与应用最先进的算法相比，我们提出的解决方案明显更有效。
An enterprise information worker is often aware of a few example tuples that should be present in the output of the query. Query discovery systems have been developed to discover project-join queries that contain the given example tuples in their output. However, they require the output to exactly contain all the example tuples and do not perform any ranking. To address this limitation, we study the problem of efficiently discovering top-k project join queries which approximately contain the given example tuples in their output. We extend our algorithms to incrementally produce results as soon as the user finishes typing/modifying a cell. Our experiments on real-life and synthetic datasets show that our proposed solution is significantly more efficient compared with applying state-of-the-art algorithms.