Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23902
Title: Efficient continuously moving top-k spatial keyword query processing
Authors: Wu, D
Yiu, ML 
Jensen, CS
Cong, G
Issue Date: 2011
Source: 2011 IEEE 27th International Conference on Data Engineering (ICDE), 11-16 April 2011, Hannover, p. 541-552
Abstract: 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.
Keywords: Internet
Client-server systems
Query processing
Publisher: IEEE
ISBN: 978-1-4244-8959-6
978-1-4244-8958-9 (E-ISBN)
ISSN: 1063-6382
DOI: 10.1109/ICDE.2011.5767861
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

115
Last Week
0
Last month
Citations as of Aug 14, 2020

Page view(s)

126
Last Week
4
Last month
Citations as of Sep 14, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.