首页> 外文期刊>Knowledge and Data Engineering, IEEE Transactions on >Authentication of Moving Top-k Spatial Keyword Queries
【24h】

Authentication of Moving Top-k Spatial Keyword Queries

机译:移动Top-k空间关键字查询的身份验证

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

摘要

A moving top- spatial keyword (MSK) query, which takes into account a continuously moving query location, enables a mobile client to be continuously aware of the top- spatial web objects that best match a query with respect to location and text relevance. The increasing mobile use of the web and the proliferation of geo-positioning render it of interest to consider a scenario where spatial keyword search is outsourced to a separate service provider capable at handling the voluminous spatial web objects available from various sources. A key challenge is that the service provider may return inaccurate or incorrect query results (intentionally or not), e.g., due to cost considerations or invasion of hackers. Therefore, it is attractive to be able to authenticate the query results at the client side. Existing authentication techniques are either inefficient or inapplicable for the kind of query we consider. We propose new authentication data structures, the MIR-tree and MIR-tree, that enable the authentication of MkSK queries at low computation and communication costs. We design a verification object for authenticating MkSK queries, and we provide algorithms for constructing verification objects and using these for verifying query results. A thorough experimental study on real data s- ows that the proposed techniques are capable of outperforming two baseline algorithms by orders of magnitude.
机译:考虑到连续移动的查询位置的移动顶部空间关键字(MSK)查询使移动客户端可以连续地意识到与位置和文本相关性最匹配查询的顶部空间Web对象。 Web的移动使用的增加和地理位置的激增使人们考虑考虑将空间关键字搜索外包给能够处理可从各种来源获得的大量空间Web对象的独立服务提供商的情况。关键挑战在于,例如由于成本考虑或黑客入侵,服务提供商可能会(有意或无意)返回不正确或不正确的查询结果。因此,能够在客户端对查询结果进行身份验证很有吸引力。对于我们考虑的那种查询,现有的身份验证技术要么效率低下,要么不适用。我们提出了新的身份验证数据结构,即MIR树和MIR树,它们使MkSK查询的身份验证能够以较低的计算和通信成本进行。我们设计了一个用于验证MkSK查询的验证对象,并提供了用于构造验证对象并将其用于验证查询结果的算法。对真实数据进行的全面实验研究表明,所提出的技术能够在两个数量级上胜过两个基线算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号