Abstract
With the proliferation of geo-positioning and geo-tagging, spatial keyword query (SKQ) processing is gaining great concern recently. Typically, a top-k spatial keyword query returns the k best spatio-textual objects ranked according to their proximity to the query location and relevance to the query keywords. While there has been much work devoted to top-k spatial keyword processing, most of them are either focused on single query or only suitable for Euclidean space. In this paper, we take the first step to study the problem of multiple query points (or group) top-k spatial keyword query processing in road networks. We first propose a basic group query-processing algorithm by using three distinct index structures. Next, we propose another more efficient algorithm based on the concept of Minimum Bounding Rectangle (MBR), which can significantly reduce the objects to be examined and thus achieve higher performance. Finally, extensive experiments using real data sets are conducted to validate the effectiveness of the proposed algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.