Geo-textual Index Structure for Approximate Keyword Search within Given Range on Spatial Database
There is more and more commercial and research interest in nearest neighbor objects for location-based search from spatial database. Spatial keyword search 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 objects that is nearest k objects from user current location and textually relevant to the user required keyword. In these systems, inconsistencies and errors can exist in the userís typed queries. To bridge the gap between queries and data, it is important to support approximate keyword search on spatial database. In this paper we study how to answer such queries efficiently. A number of geo-textual indices have been proposed in recent years which mainly combine the R-tree and its variants and the inverted file. This paper proposes new index structure that combines K-d tree and inverted file. The proposed index structure supports a wide range of query predicates efficiently. We also discuss approximate keyword search for the correct useís mistyped keywords.
Keywords- Combination Scheme, Problem Statement, Proposed System, Range Keyword Search Algorithm, System Architecture.