Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Motion adaptive indexing for moving continual queries over moving objects
Proceedings of the thirteenth ACM international conference on Information and knowledge management
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Indexing and ranking in Geo-IR systems
Proceedings of the 2005 workshop on Geographic information retrieval
Hybrid index structures for location-based web search
Proceedings of the 14th ACM international conference on Information and knowledge management
Efficient query processing in geographic web search engines
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Processing Spatial-Keyword (SK) Queries in Geographic Information Retrieval (GIR) Systems
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Keyword Search in Spatial Databases: Towards Searching by Document
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Reverse spatial and textual k nearest neighbor search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Location-aware type ahead search on spatial databases: semantics and efficiency
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient continuously moving top-k spatial keyword query processing
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
DESKS: Direction-Aware Spatial Keyword Search
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Seal: spatio-textual similarity search
Proceedings of the VLDB Endowment
Proceedings of the 21st ACM international conference on Information and knowledge management
Proceedings of the 21st ACM international conference on Information and knowledge management
Spatial keyword query processing: an experimental evaluation
Proceedings of the VLDB Endowment
TsingNUS: a location-based service system towards live city
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Location-aware publish/subscribe
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Database research at the National University of Singapore
ACM SIGMOD Record
Hi-index | 0.00 |
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.