首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >Answering Why-Not Group Spatial Keyword Queries
【24h】

Answering Why-Not Group Spatial Keyword Queries

机译:回答为什么不分组空间关键字查询

获取原文
获取原文并翻译 | 示例

摘要

With the proliferation of geo-textual objects on the web, extensive efforts have been devoted to improving the efficiency of top-kk spatial keyword queries in different settings. However, comparatively much less work has been reported on enhancing the quality and usability of such queries. In this context, we propose means of enhancing the usability of a top-kk group spatial keyword query, where a group of users aim to find kk objects that contain given query keywords and are nearest to the users. Specifically, when users receive the result of such a query, they may find that one or more objects that they expect to be in the result are in fact missing, and they may wonder why. To address this situation, we develop a so-called why-not query that is able to minimally modify the original query into a query that returns the expected, but missing, objects, in addition to other objects. Specifically, we formalize the why-not query in relation to the top-kk group spatial keyword query, called the Why-not Group Spatial Keyword Query (mathsf{WGSK}WGSK) that is able to provide a group of users with a more satisfactory query result. We propose a three-phase framework for efficiently computing the mathsf{WGSK}WGSK. The first phase substantially reduces the search space for the subsequent phases by retrieving a set of objects that may affect the ranking of the user-expected objects. The second phase provides an incremental sampling algorithm that generates candidate weightings of more promising queries. The third phase determines the penalty of each refined query and returns the query with minimal penalty, i.e., the minimally modified query. Extensive experiments with real and synthetic data offer evidence that the proposed solution excels over baselines with respect to both effectiveness and efficiency.
机译:随着Web上地理文本对象的激增,人们已经进行了广泛的努力来提高在不同设置中top-kk空间关键字查询的效率。但是,有关提高此类查询的质量和可用性的工作报道相对较少。在这种情况下,我们提出了增强top-kk组空间关键字查询可用性的方法,其中一组用户旨在查找包含给定查询关键字并且最接近用户的kk对象。具体而言,当用户收到这样的查询结果时,他们可能会发现实际上期望丢失的一个或多个对象丢失了,他们可能想知道为什么。为了解决这种情况,我们开发了一个所谓的“为什么”查询,该查询能够将原始查询最小化为一个查询,该查询除了返回其他对象外,还返回预期但缺少的对象。具体来说,我们将与top-kk组空间关键字查询相关的“为什么”查询形式化,称为“为什么”组空间关键字查询( mathsf {WGSK} WGSK),该查询能够为一组用户提供更多满意的查询结果。我们提出了一个三相框架,可有效地计算 mathsf {WGSK} WGSK。第一阶段通过检索可能影响用户预期对象排名的一组对象,大大减少了后续阶段的搜索空间。第二阶段提供一种增量采样算法,该算法生成更有前途的查询的候选权重。第三阶段确定每个改进查询的惩罚,并以最小惩罚即最小修改的查询返回查询。使用真实和合成数据进行的大量实验提供了证据,表明所提出的解决方案在有效性和效率方面都优于基线。

著录项

  • 来源
  • 作者

  • 作者单位

    Huazhong Univ Sci & Technol Wuhan 430074 Peoples R China;

    Univ Elect Sci & Technol China Big Data Res Ctr Chengdu 611731 Sichuan Peoples R China;

    Aalborg Univ DK-9100 Aalborg Denmark;

    Griffith Univ Nathan Qld 4111 Australia;

    Univ Queensland St Lucia Qld 4072 Australia;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Spatial keyword queries; why-not; top-k query; query processing;

    机译:空间关键字查询;为什么不;top-k查询;查询处理;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号