Web users and content are increasingly being geo-positioned. This development gives prominence to spatial keyword queries, which involve both the locations and textual descriptions of content. We study the efficient processing of continuously moving top-k spatial keyword (MkSK) queries over spatial keyword data. State-of-the-art solutions for moving queries employ safe zones that guarantee the validity of reported results as long as the user remains within a zone. However, existing safe zone methods focus solely on spatial locations and ignore text relevancy. We propose two algorithms for computing safe zones that guarantee correct results at any time and that aim to optimize the computation on the server as well as the communication between the server and the client. We exploit tight and conservative approximations of safe zones and aggressive computational space pruning. Empirical studies with real data suggest that our proposals are efficient.
|Title of host publication||27th International Conference on Data Engineering, Hannover, Germany, April 11-16, 2011|
|Number of pages||12|
|Publication status||Published - 2011|
|Event||The 27th IEEE International Conference on Data Engineering, ICDE - Hannover, Germany|
Duration: 11 Apr 2011 → 16 Apr 2011
|Conference||The 27th IEEE International Conference on Data Engineering, ICDE|
|Period||11/04/2011 → 16/04/2011|