Premium
Sketch maps for searching in spatial data
Author(s) -
Zare Zardiny Ali,
Hakimpour Farshad,
Shahbazi Mozhdeh
Publication year - 2020
Publication title -
transactions in gis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.721
H-Index - 63
eISSN - 1467-9671
pISSN - 1361-1682
DOI - 10.1111/tgis.12619
Subject(s) - sketch , computer science , matching (statistics) , redundancy (engineering) , data mining , abstraction , data redundancy , process (computing) , implementation , spatial analysis , information retrieval , algorithm , database , mathematics , philosophy , statistics , epistemology , programming language , operating system
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 F Measure 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.