The points of spatial dataset usually consist of the spatial information and the described text information.The problem of approximate string reverse furthest neighbors search (ASRFNS) query is defined to search all points in a spatial dataset that take the given query point as its furthest neighbor while their text satisfies the string similarity constraint.Based on the existing reverse furthest neighbors search algorithm and approximate string search algorithm

we proposed two solution algorithms:the convex hull furthest cells join algorithm (CHFCsJoin) and the convex hull furthest cell approximate string serial search algorithm (CHFCASSS).In order to further improve the query performance

we also proposed an efficient algorithm of the convex hull furthest cell filter-Rtree (CHFilterRtree) which contains disk resident structure of space and keyword information.With the real dataset experiments and analysis

the results demonstrate that our proposed algorithms obtained a good performance.