arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.05100cs.DB
收藏

查询重新排序作为服务

Query Reranking As A Service

Abolfazl Asudeh, Nan Zhang, Gautam Das

摘要:

分级检索模型已迅速成为客户机-服务器数据库中搜索查询处理的事实方式,特别是在Web上。尽管数据库社区在设计更好的排名功能/机制方面做出了广泛的努力,但许多这样的数据库在实践中仍然未能解决用户对元组排名的不同且有时矛盾的偏好,这可能(至少部分地)是由于数据库所有者缺乏设计真正有效的排名功能的专业知识和/或动机。本文通过定义一个新的{ \em查询重排序问题}来解决这个问题,即,我们的目标是设计一种第三方服务,该第三方服务只使用客户端-服务器数据库的公共搜索接口,以使得能够利用任何用户指定的排名功能(具有或不具有选择条件)来即时处理查询,而不管数据库是否支持排名功能。我们分析了问题的最坏情况的复杂性,并介绍了一些想法,例如,动态索引、支配检测和虚拟元组修剪,以降低查询重排序算法的平均情况成本。我们还提出了广泛的实验结果,在现实世界的数据集,在离线和在线直播系统,证明了我们提出的技术的有效性。

英文摘要:

The ranked retrieval model has rapidly become the de facto way for search query processing in client-server databases, especially those on the web. Despite of the extensive efforts in the database community on designing better ranking functions/mechanisms, many such databases in practice still fail to address the diverse and sometimes contradicting preferences of users on tuple ranking, perhaps (at least partially) due to the lack of expertise and/or motivation for the database owner to design truly effective ranking functions. This paper takes a different route on addressing the issue by defining a novel {\em query reranking problem}, i.e., we aim to design a third-party service that uses nothing but the public search interface of a client-server database to enable the on-the-fly processing of queries with any user-specified ranking functions (with or without selection conditions), no matter if the ranking function is supported by the database or not. We analyze the worst-case complexity of the problem and introduce a number of ideas, e.g., on-the-fly indexing, domination detection and virtual tuple pruning, to reduce the average-case cost of the query reranking algorithm. We also present extensive experimental results on real-world datasets, in both offline and live online systems, that demonstrate the effectiveness of our proposed techniques.

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

↑