Efficient Top K Temporal Spatial Keyword Search

Abstract

Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale in many emerging applications such as location based services and social networks. Due to their importance, a large body of work has focused on efficiently computing various spatial keyword queries. In this paper,we study the top-$k$ temporal spatial keyword query which considers three important constraints during the search including time, spatial proximity and textual relevance. A novel index structure, namely SSG-tree, to efficiently insert/delete spatio-temporal web objects with high rates. Base on SSG-tree an efficient algorithm is developed to support top-k temporal spatial keyword query. We show via extensive experimentation with real spatial databases that our method has increased performance over alternate techniques

References in corpus (6)

• Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization
• Deep Adaptive Feature Embedding with Local Sample Distributions for Person Re-identification
• Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval
• What-and-Where to Match: Deep Spatially Multiplicative Integration Networks for Person Re-identification
• Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering
• Structured Deep Hashing with Convolutional Neural Networks for Fast Person Re-identification