Sketch maps for searching in spatial data

Much research has been conducted on the use of sketch maps to search in spatial databases, nevertheless, they have faced challenges, such as modeling of the data abstraction level, aggregated features in sketches, modeling of semantic aspects of data, data redundancy, and evaluation of the results. Considering these challenges, in this article a new solution is presented for searching in databases based on data matching. The main difference between this solution and the other approaches lies in the parameters introduced to match data and how to solve the matching problem. Using geometrical, topological, and semantic parameters in the matching, as well as performing the matching process in the two phases of partial and global, has resulted in an of about 78%. The evaluation process is performed based on the matching parameters and the matching procedure; finally, the result is acceptable compared to previous implementations.     

Route Matching in Sketch and Metric Maps

Journal of Geographical Systems - Despite all distortions and incompleteness present in Sketch maps, they can be used for different purposes such as collecting and searching spatial data and...