Institute of Electrical & Electronic Engineers
In this paper, the authors present a comprehensive study for spatial approximate string queries in both the Euclidean space and road networks. They use the edit distance as the similarity measurement for the string predicate and focus on the range queries as the spatial predicate. They also address the problem of query selectivity estimation for queries in the Euclidean space. Future work includes examining spatial approximate sub-string queries, designing methods that are more update-friendly, and solving the selectivity estimation problem for RSAS queries.