Batch processing of Top-k Spatial-textual Queries
Batch processing of Top-k Spatial-textual Queries
复制标题
DOI：
10.1145/2786006.2786008
复制
发表时间：
2015-05
期刊：
影响因子：
--
通讯作者：
F. Choudhury;J. Culpepper;T. Sellis
中科院分区：
文献类型：
--
作者：
F. Choudhury;J. Culpepper;T. Sellis
Top-k空间文本查询在研究界受到了极大的关注。有效处理这类查询的几种技术现在广泛应用于各种应用程序中。然而，如何最有效地处理多个查询的问题还没有得到很好的理解。依赖于处理连续查询流和离线预处理其他查询的应用程序可以从这个问题的解决方案中受益。在这项工作中，我们研究了有效处理一组top-k空间文本查询的实用解决方案。我们为top-k空间文本查询的批处理提出了一种高效的最佳优先算法，该算法促进了共享处理并减少了每个查询批中的I/O。通过将相似的查询分组并同时处理它们，我们能够使用公开可用的数据集展示显著的性能提升。
Top-k spatial-textual queries have received significant attention in the research community. Several techniques to efficiently process this class of queries are now widely used in a variety of applications. However, the problem of how best to process multiple queries efficiently is not well understood. Applications relying on processing continuous streams of queries, and offline pre-processing of other queries could benefit from solutions to this problem. In this work, we study practical solutions to efficiently process a set of top-k spatial-textual queries. We propose an efficient best-first algorithm for the batch processing of top-k spatial-textual queries that promotes shared processing and reduced I/O in each query batch. By grouping similar queries and processing them simultaneously, we are able to demonstrate significant performance gains using publicly available datasets.