Affiliation:
1. Bharathiyar College of Engineering and Technology, India
2. Pondicherry Engineering College, India
Abstract
Most web and mobile applications are based on searching the location-based objects called spatial objects. In spatial database systems, searching such objects is a challenging task since it deals with geo-spatial capabilities. Sometimes, the spatial queries are associated with text information in order to obtain the most relevant answers nearest to the given location. Such queries are called spatial textual query. Conventional spatial indexes and text indexes are not suitable for resolving such queries. Since these indexes use various approaches to perform searching, they can cause performance degradation. Effective processing of the query mainly depends on the index structure, searching algorithms, and location-based ranking. This chapter reviews the different hybrid index structures and search mechanisms to extract the spatial objects, the different ranking model it supports, and the performance characteristics.
Reference44 articles.
1. Selectivity estimation in spatial databases
2. Supporting Location-Based Approximate-Keyword Queries.;S.Alsubaiee;Proceeding GIS ’10 Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems,2010
3. Fuzzy Keyword Search on Spatial Data
4. Efficient exact set-similarity joins.;A.Arasu;Proceeding VLDB ’06 Proceedings of the 32nd international conference on Very large data bases,2006
5. Beckmann, N., Kriegel, H. P., Schneider, R., & Seeger, B. (1990). The R*-tree: An efficient and robust access method for points and rectangles. SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data, 322-331.