公开(公告)号：US09104770B2

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

申请号：US13780990

申请日：2013-02-28

Applicant: Oracle International Corporation

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

IPC: G06F17/30

CPC classification number: G06F17/30424 ,  G06F17/30327 ,  G06F17/30595 ,  G06F17/30625 ,  G06F17/30831 ,  G06F17/3087 ,  G06F17/30961 ,  G06K9/4638 ,  G06K9/6878

Abstract: An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry.

Abstract translation: 公开了一种处理查询的优化方法，该查询请求描述测试几何和查询几何之间的空间关系，例如点，线，多边形及其集合。 该方法的第一部分发现测试几何的最小边界矩形（MBR）与构建为描述查询几何的内存R树（IMR-tree）之间的第一空间关系。 如果第一个关系没有指定所请求的描述，则该方法的第二部分使用查询几何的IMR树来查找测试几何本身与查询几何之间的第二个空间关系。 优化适用于第一部分和第二部分。 第二部分的优化取决于测试几何。

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