Constraint relaxation of the polygon-polyline topological relation for geographic pictorial query languages
Constraint relaxation of the polygon-polyline topological relation for geographic pictorial query languages
复制标题
DOI：
10.2298/csis120302017f
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Anna Formica;E. Pourabbas;M. Rafanelli
中科院分区：
文献类型：
--
作者：
Anna Formica;E. Pourabbas;M. Rafanelli
这项工作解决的问题，放松空间约束的图形查询在地理数据库中的空答案。重点研究了多边形-折线拓扑关系，提出了一种基于运算符概念邻域（OCN）图和相关16交矩阵概念的计算模型。前者用于表示符号图形对象对之间的概念拓扑邻域，并指示如何放松空间约束。OCN图的节点被标记有已经被形式化的地理操作符，并且它们的语义已经被丰富，以便捕获用户查询细节。后者是一个16-交集矩阵，它提供了关于文献中提出的众所周知的9-交集矩阵的查询的附加信息。它被认为是在近似的答案中找出更接近用户需求的答案。特别是，它使我们能够量化的用户查询和配置之间的差异对应于建议的近似答案的基础上的OCN图。我们的方法的主要特点是突出通过一些查询的例子。
This work addresses the problem of relaxing spatial constraints for pictorial queries having null answers in geographical databases. It focuses on the polygon-polyline topological relationship and proposes a computational model which is based on the notions of Operator Conceptual Neighborhood (OCN) graph and the relative 16-intersection matrix. The former is addressed to represent the conceptual topological neighborhood between pairs of Symbolic Graphical Objects and indicates how spatial constraints can be relaxed. The nodes of the OCN graph are labeled with geo-operators that have been formalized and their semantics has been enriched in order to capture user query details. The latter is a 16- intersection matrix which provides additional information about the query with respect to the well-known 9-intersection matrix proposed in the literature. It has been conceived to identify, among the approximate answers, the one closer to the user needs. In particular, it allows us to quantify the difference among the user query and the configurations corresponding to the proposed approximate answers on the basis of the OCN graph. The main characteristics of our approach are highlighted through some query examples.