Abstract
Given a set of spatial points $D$ containing keywords information, a set of query objects Q and m query keywords, a top-k aggregate nearest keyword (ANK) query retrieves k objects from Q with the minimum sum of distances to its nearest points in D such that each nearest point matches at least one of query keywords. For example, consider there is a spatial database D which manages facilities (e.g., school, restaurants, hospital, etc.) represented by sets of keywords. A user may want to rank a set of locations with respect to the sum of distances to nearest interested facilities. For processing this query, several algorithms are proposed using IR2-Tree as index structure. Experiments on real data sets indicate that our approach is scalable and efficient in reducing query response time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
