Please use this identifier to cite or link to this item:
|Title:||Efficient safe-region construction for moving top-K spatial keyword queries|
|Keywords:||moving top-k spatial keyword queries|
|Citation:||Huang, W.,Li, G.,Tan, K.-L.,Feng, J. (2012). Efficient safe-region construction for moving top-K spatial keyword queries. ACM International Conference Proceeding Series : 932-941. ScholarBank@NUS Repository. https://doi.org/10.1145/2396761.2396879|
|Abstract:||Many real-world applications have requirements to support moving spatial keyword queries. For example a tourist looks for top-k "seafood restaurants" while walking in a city. She will continuously issue moving queries. However existing spatial keyword search methods focus on static queries and it calls for new effective techniques to support moving queries efficiently. In this paper we propose an effective method to support moving top-k spatial keyword queries. In addition to finding top-k answers of a moving query, we also calculate a safe region such that if a new query with a location falling in the safe region, we can directly use the answer set to answer the query. To this end, we propose an effective model to represent the safe region and devise efficient search algorithms to compute the safe region. We have implemented our method and experimental results on real datasets show that our method achieves high efficiency and outperforms existing methods significantly. © 2012 ACM.|
|Source Title:||ACM International Conference Proceeding Series|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 12, 2019
checked on Feb 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.