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

公开(公告)号：US09519680B2

公开(公告)日：2016-12-13

申请号：US14754210

申请日：2015-06-29

Applicant: Oracle International Corporation

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

IPC: G06F17/30 ,  G06K9/46 ,  G06K9/68

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.

公开(公告)号：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树来查找测试几何本身与查询几何之间的第二个空间关系。 优化适用于第一部分和第二部分。 第二部分的优化取决于测试几何。

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

公开(公告)号：US20150317358A1

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

申请号：US14754210

申请日：2015-06-29

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树来查找测试几何本身与查询几何之间的第二个空间关系。 优化适用于第一部分和第二部分。 第二部分的优化取决于测试几何。

公开(公告)号：US20140244635A1

公开(公告)日：2014-08-28

申请号：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树来查找测试几何本身与查询几何之间的第二个空间关系。 优化适用于第一部分和第二部分。 第二部分的优化取决于测试几何。