Authentication of Moving Top-k Spatial Keyword Queries

Abstract

A moving top- <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> spatial keyword (M <inline-formula> <tex-math notation="LaTeX">$k$</tex-math> </inline-formula> SK) query, which takes into account a continuously moving query location, enables a mobile client to be continuously aware of the top- <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> 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 <inline-formula> <tex-math notation="LaTeX">$^*$</tex-math></inline-formula> -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 shows that the proposed techniques are capable of outperforming two baseline algorithms by orders of magnitude.