Efficient continuously moving top-k spatial keyword query processing

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  • Dingming Wu, Aalborg Universitet, Danmark
  • Man Lung Yiu, Hong Kong Polytechnic University, Hong Kong
  • Christian S. Jensen
  • ,
  • Gao Cong, Nanyang Technological University, Singapore
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.
OriginalsprogEngelsk
TidsskriftProceedings of the International Conference on Data Engineering
Sider (fra-til)541-552
Antal sider12
ISSN1063-6382
DOI
StatusUdgivet - 2011
Begivenhed2011 IEEE 27th International Conference on Data Engineering - Hannover, Tyskland
Varighed: 11 apr. 201116 apr. 2011

Konference

Konference2011 IEEE 27th International Conference on Data Engineering
LandTyskland
ByHannover
Periode11/04/201116/04/2011

Se relationer på Aarhus Universitet Citationsformater

ID: 44134658