Efficient Algorithm for Finding Aggregate Nearest Place Between Two Users

摘要

Keyword search over a large amount of data is an important operation in a wide range of domains. Spatial keyword search on spatial database has been well studied for years due to its importance to commercial search engines. Specially, a spatial keyword query takes a user location and user-supplied keywords as arguments and returns object that is nearest k objects from user current location and textually relevant to the user required keyword. Geo-textual index structure plays an important role in spatial keyword querying. This paper proposes the geo-textual index structure that intends to reduce unnecessary cost in processing spatial keyword queries and searching time for required results. The proposed index is used for searching most relevance results between two users that is based on the most spatial and textual relevance to query point and required keyword within given range. It can search the required result point with minimum IO costs and CPU costs. In this system, we also discuss how to answer inconsistencies and errors in the user's typed queries.