INDEX-BASED OPTIMIZATION OF CONVEX HULL AND MINIMUM BOUNDING CIRCLE QUERIES
    1.
    发明申请
    INDEX-BASED OPTIMIZATION OF CONVEX HULL AND MINIMUM BOUNDING CIRCLE QUERIES 有权
    基于索引的索引优化和最小循环查询

    公开(公告)号:US20150254302A1

    公开(公告)日:2015-09-10

    申请号:US14200415

    申请日:2014-03-07

    Abstract: Systems, methods, and other embodiments associated with index-based optimization of geometric figured-related queries are described. In one embodiment, a method includes receiving two points selected from a corpus of spatial data. A hierarchical index on the data is accessed to choose candidate nodes. The index is a hierarchical arrangement of nodes arranged in paths from root node entries to leaf node entries such that each node is contained in all nodes in a path leading to the node. The method includes determining a spatial relationship between the two points and the candidate nodes in the index. The candidate nodes are a proper subset of the nodes in the index, such that the spatial relationship is not determined between the two points and some non-candidate nodes. A candidate node is selected based on the determined angles for processing related to construction of a geometric figure describing the spatial data.

    Abstract translation: 描述与几何图形相关查询的基于索引的优化相关联的系统,方法和其他实施例。 在一个实施例中,一种方法包括接收从空间数据的语料库中选择的两个点。 访问数据上的层次索引以选择候选节点。 索引是从根节点条目到叶节点条目的路径中排列的节点的分层排列,使得每个节点被包含在通向节点的路径中的所有节点中。 该方法包括确定索引中两点和候选节点之间的空间关系。 候选节点是索引中节点的适当子集,使得在两个点和一些非候选节点之间没有确定空间关系。 基于与描述空间数据的几何图形的构造相关的处理的确定的角度来选择候选节点。

Patent Agency Ranking