Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
A Framework for Generating Network-Based Moving Objects
Geoinformatica
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
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
Hybrid index structures for location-based web search
Proceedings of the 14th ACM international conference on Information and knowledge management
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
Efficient query processing in geographic web search engines
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Nearest and reverse nearest neighbor queries for moving objects
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Continuous obstructed nearest neighbor queries in spatial databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
IR-Tree: An Efficient Index for Geographic Document Search
IEEE Transactions on Knowledge and Data Engineering
Reverse spatial and textual k nearest neighbor search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Collective spatial keyword querying
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
A framework for efficient spatial web object retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Spatial keyword query processing: an experimental evaluation
Proceedings of the VLDB Endowment
CALBA: capacity-aware location-based advertising in temporary social networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
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 text 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 the safe zone associated with a result. 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 server-side computation 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. We present techniques that aim to compute the next safe zone efficiently, and we present two types of conservative safe zones that aim to reduce the communication cost. Empirical studies with real data suggest that the proposals are efficient. To understand the effectiveness of the proposed safe zones, we study analytically the expected area of a safe zone, which indicates on average for how long a safe zone remains valid, and we study the expected number of influence objects needed to define a safe zone, which gives an estimate of the average communication cost. The analytical modeling is validated through empirical studies.