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.

中文翻译：

---

用于空间数据搜索的草图

关于使用草图在空间数据库中进行搜索已经进行了很多研究，但是，它们仍然面临挑战，例如数据抽象级别的建模，草图中的聚集特征，数据语义方面的建模，数据冗余以及评估等。结果。考虑到这些挑战，本文提出了一种新的解决方案，用于基于数据匹配的数据库搜索。该解决方案与其他方法之间的主要区别在于为匹配数据而引入的参数以及如何解决匹配问题。在匹配中使用几何，拓扑和语义参数，以及在部分和全局两个阶段执行匹配过程，导致了约占78％。基于匹配参数和匹配过程进行评估过程；最后，与以前的实现相比，结果是可以接受的。