公开(公告)号：US09910878B2

公开(公告)日：2018-03-06

申请号：US14452351

申请日：2014-08-05

Applicant: Oracle International Corporation

Inventor： Ying Hu ,  Siva Ravada ,  Daniel Geringer ,  Richard J. Anderson

IPC: G06F17/30

CPC classification number: G06F17/30327 ,  G06F17/30 ,  G06F17/30289 ,  G06F17/30292 ,  G06F17/30424 ,  G06F17/30657 ,  G06F17/3087

Abstract: Techniques and systems for processing within-distance queries are provided. A query for geometry objects within a query distance of a query geometry is received. An in-memory R-tree (IMR-tree) is generated for the query geometry. The IMR-tree includes nodes corresponding to edges of the query geometry. An R-tree index for a plurality of candidate geometries is accessed. At least one node of the R-tree index is processed by: generating an expanded bounding geometry based on the query distance, and using the IMR-tree to determine a topological relationship between the expanded bounding geometry and the query geometry. When the expanded bounding geometry intersects the query geometry, if at least one within-distance test is satisfied, the candidate geometries associated with the selected node are added to a result set. Otherwise, if the selected node is a non-leaf node of the R-tree index, child nodes of the selected node are processed.

公开(公告)号：US09495466B2

公开(公告)日：2016-11-15

申请号：US14092503

申请日：2013-11-27

Applicant: Oracle International Corporation

Inventor： Daniel Geringer ,  Siva Ravada ,  Richard J. Anderson ,  Ying Hu

IPC: G06F17/30

CPC classification number: G06F17/3087 ,  G06F17/30961

Abstract: A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request.

Abstract translation: 提供了一种用于查询包含点空间数据和无索引的数据库表的方法和装置。 表中的点空间数据的请求包括由用户提供的查询窗口，并描述用户期望其中包含的点空间数据的感兴趣区域。 查询窗口被平铺以创建内部瓦片和边界瓦片。 形成第一个查询以确定内部瓦片中包含的点空间数据。 形成第二个查询以确定包含在边界瓦片内以及查询窗口内的点空间数据。 第二个查询包括测试以确定边界瓦片内的点空间数据是否也位于查询窗口内的函数。 第一和第二查询部分地在增强型数据存储设备上执行，并且结果被加入并返回给用户以回答该请求。

公开(公告)号：US09436731B2

公开(公告)日：2016-09-06

申请号：US14200415

申请日：2014-03-07

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Ying Hu ,  Siva Ravada ,  Richard James Anderson, Jr.

IPC: G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/30241 ,  G06F17/30327 ,  G06F17/30336

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

公开(公告)号：US20150049944A1

公开(公告)日：2015-02-19

申请号：US13966691

申请日：2013-08-14

Applicant: Oracle International Corporation

Inventor： Bhuvan Bamba ,  Siva Ravada ,  Ying Hu ,  Richard J. Anderson

IPC: G06K9/34

CPC classification number: G06F17/30241

Abstract: Techniques are described for memory-efficient spatial histogram construction. A hierarchical spatial index has leaf nodes and non-leaf nodes, each leaf node representing a bounding region containing a spatial object, each non-leaf node representing a bounding region at least partially containing one or more spatial objects. A plurality of selected nodes is selected from the plurality of non-leaf nodes. The plurality of selected nodes includes an ancestor of each leaf node. For each particular node in the plurality of selected nodes, a weight is determined. The weight is based on the number of spatial objects contained within the bounding region of the particular node. A spatial partitioning of the plurality of selected nodes is determined. A spatial histogram is generated based on the spatial partitioning of the weights of the plurality of selected nodes.

Abstract translation: 描述了记忆效率空间直方图构造的技术。 分层空间索引具有叶节点和非叶节点，每个叶节点表示包含空间对象的边界区域，每个非叶节点表示至少部分地包含一个或多个空间对象的边界区域。 从多个非叶节点中选择多个选择的节点。 多个选定节点包括每个叶节点的祖先。 对于多个选定节点中的每个特定节点，确定权重。 权重基于包含在特定节点的边界区域内的空间对象的数量。 确定多个选定节点的空间划分。 基于多个选定节点的权重的空间分割生成空间直方图。

公开(公告)号：US20210081490A1

公开(公告)日：2021-03-18

申请号：US16848375

申请日：2020-04-14

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： William Martinez Cortes ,  Shasank Kisan Chavan ,  Siva Ravada ,  Ying Hu

IPC: G06F17/16 ,  G06F9/38

Abstract: Techniques described herein perform spherical PIP analysis by detecting whether a test ray (defined by a test point (TP) and a point (EP) that is external to a spherical polygon) crosses edge arcs (“edges”) of the polygon based on relative orientations of vertices of the test ray and edges. A classifier vector (CV) for a test ray is calculated based on the cross-product of the TP and the EP. Using the CV, the orientation of each vertex of the polygon with respect to the test ray is determined. Candidate edges having vertices with opposite orientations with respect to the test ray are identified. Crossing edges are determine by calculating CVs for each candidate edge, and determining orientations of the TP and EP with respect to each candidate edge. A set of crossing edges is determined, where the TP and the EP have opposite orientations with respect to each crossing edge.

公开(公告)号：US10789231B2

公开(公告)日：2020-09-29

申请号：US15248155

申请日：2016-08-26

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Roberto Infante Suarez ,  Juan Carlos Reyes Martinez ,  Hector Alejandro Saucedo Briseno ,  Siva Ravada ,  Zazhil Ha Herena Ulloa

IPC: G06F16/22 ,  G06F16/29

Abstract: Systems, methods, and other embodiments associated with indexing spatial data in a distributed file system using local indexes are described. In one embodiment, a method includes dividing the spatial data into splits. Each of the splits includes a portion of the spatial data and includes additional sub-units that further sub-divide the spatial data. The example method may also include populating index records for the sub-units using metadata extracted from the spatial data. The metadata for each of the sub-units describes sub-unit characteristics of a respective one of the sub-units and split characteristics of one of the splits associated with the respective one of the sub-units. The method includes indexing the spatial data by generating local indexes using the index records with one of the local indexes for each of the splits and generating a global index that identifies the local indexes.

公开(公告)号：US09317529B2

公开(公告)日：2016-04-19

申请号：US13966691

申请日：2013-08-14

Applicant: Oracle International Corporation

Inventor： Bhuvan Bamba ,  Siva Ravada ,  Ying Hu ,  Richard J. Anderson

IPC: G06K9/00 ,  G06F17/30

CPC classification number: G06F17/30241

Abstract: Techniques are described for memory-efficient spatial histogram construction. A hierarchical spatial index has leaf nodes and non-leaf nodes, each leaf node representing a bounding region containing a spatial object, each non-leaf node representing a bounding region at least partially containing one or more spatial objects. A plurality of selected nodes is selected from the plurality of non-leaf nodes. The plurality of selected nodes includes an ancestor of each leaf node. For each particular node in the plurality of selected nodes, a weight is determined. The weight is based on the number of spatial objects contained within the bounding region of the particular node. A spatial partitioning of the plurality of selected nodes is determined. A spatial histogram is generated based on the spatial partitioning of the weights of the plurality of selected nodes.

Abstract translation: 描述了记忆效率空间直方图构造的技术。 分层空间索引具有叶节点和非叶节点，每个叶节点表示包含空间对象的边界区域，每个非叶节点表示至少部分地包含一个或多个空间对象的边界区域。 从多个非叶节点中选择多个选择的节点。 多个选定节点包括每个叶节点的祖先。 对于多个选定节点中的每个特定节点，确定权重。 权重基于包含在特定节点的边界区域内的空间对象的数量。 确定多个选定节点的空间划分。 基于多个选定节点的权重的空间分割生成空间直方图。

公开(公告)号：US20160019248A1

公开(公告)日：2016-01-21

申请号：US14452351

申请日：2014-08-05

Applicant: Oracle International Corporation

Inventor： Ying Hu ,  Siva Ravada ,  Daniel Geringer ,  Richard J. Anderson

IPC: G06F17/30

CPC classification number: G06F17/30327 ,  G06F17/30 ,  G06F17/30289 ,  G06F17/30292 ,  G06F17/30424 ,  G06F17/30657 ,  G06F17/3087

Abstract: Techniques and systems for processing within-distance queries are provided. A query for geometry objects within a query distance of a query geometry is received. An in-memory R-tree (IMR-tree) is generated for the query geometry. The IMR-tree includes nodes corresponding to edges of the query geometry. An R-tree index for a plurality of candidate geometries is accessed. At least one node of the R-tree index is processed by: generating an expanded bounding geometry based on the query distance, and using the IMR-tree to determine a topological relationship between the expanded bounding geometry and the query geometry. When the expanded bounding geometry intersects the query geometry, if at least one within-distance test is satisfied, the candidate geometries associated with the selected node are added to a result set. Otherwise, if the selected node is a non-leaf node of the R-tree index, child nodes of the selected node are processed.

Abstract translation: 提供了用于处理远距离查询的技术和系统。 接收到查询几何的查询距离内的几何对象的查询。 为查询几何生成内存中R树（IMR-tree）。 IMR树包括与查询几何的边缘对应的节点。 访问用于多个候选几何的R树索引。 通过以下方式处理R树索引的至少一个节点：基于查询距离生成扩展的边界几何，并使用IMR树来确定扩展的边界几何和查询几何之间的拓扑关系。 当扩展的边界几何与查询几何相交时，如果至少一个距离内测试被满足，则与所选节点相关联的候选几何被添加到结果集中。 否则，如果所选节点是R树索引的非叶节点，则处理所选节点的子节点。

公开(公告)号：US09183435B2

公开(公告)日：2015-11-10

申请号：US14097388

申请日：2013-12-05

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Daniel Louis Geringer ,  Siva Ravada

IPC: G06K9/00 ,  G06K9/46 ,  G06K9/62 ,  G06F17/30 ,  G06T17/05

CPC classification number: G06K9/00442 ,  G01C21/32 ,  G06F17/30259 ,  G06K9/46 ,  G06K9/6202 ,  G06T17/05 ,  G06T2210/36

Abstract: Systems, methods, and other embodiments associated with feature generalization leveraging topological model functionality are described. In one embodiment, a method includes loading primitives associated with a first feature and a second feature into a topological model. The topological model may be an existing topological model or a topological model that is created by the feature generalization methods and systems described herein. The topological model stores primitives that are shared by the first feature and the second feature as a single unique shared primitive. The method includes generalizing respective primitives including at least one shared primitive to produce corresponding respective generalized primitives, and associating a generalized primitive corresponding to the shared primitive with the first feature and the second feature, while maintaining alignment across shared edges of adjacent features and hierarchical relationships between features.

Abstract translation: 描述了利用拓扑模型功能的特征泛化相关联的系统，方法和其他实施例。 在一个实施例中，一种方法包括将与第一特征相关联的图元和第二特征加载到拓扑模型中。 拓扑模型可以是由本文描述的特征泛化方法和系统创建的现有拓扑模型或拓扑模型。 拓扑模型将由第一个特征和第二个特征共享的原语存储为一个唯一的共享基元。 该方法包括对包括至少一个共享原语的各个基元进行泛化，以产生对应的各自的广义基元，以及将对应于共享基元的通用原语与第一特征和第二特征相关联，同时保持相邻特征和层次关系的共享边缘 特征之间。