公开(公告)号：US10089712B2

公开(公告)日：2018-10-02

申请号：US15281149

申请日：2016-09-30

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Avishkar Misra ,  Zazhil Ha Herena Ulloa ,  Juan Carlos Reyes Martinez ,  Siva Ravada

IPC: G06K9/00 ,  G06T3/00 ,  G06T7/00 ,  G06T5/00 ,  G06T5/30 ,  H04N5/232

Abstract: Systems, methods, and other embodiments are disclosed for correcting errors in the geo-spatial locations of acquired image data. In one embodiment, acquired aerial or satellite image data is segmented to generate extracted boundary data. The extracted boundary data represents boundaries of features of a portion of the Earth's surface, but at incorrect geo-spatial coordinates. The extracted boundary data is matched to expected boundary data derived from ground truth data. The expected boundary data represents boundaries of the features at correct geo-spatial coordinates. Adjustment parameters are generated that represent a geo-spatial misalignment between the extracted boundary data and the expected boundary data. Metadata in a header of the acquired image data is modified to include the adjustment parameters. The adjustment parameters may be applied to the acquired image data to generate corrected image data at correct geo-spatial coordinates.

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

公开(公告)号：US11507590B2

公开(公告)日：2022-11-22

申请号：US16904392

申请日：2020-06-17

Applicant: Oracle International Corporation

Inventor： Siva Ravada ,  Ying Hu ,  Zhen Hua Liu ,  Shasank Kisan Chavan ,  Aurosish Mishra ,  Vikas Arora

IPC: G06F16/25 ,  G06F16/22 ,  G06F9/38 ,  G06F16/242 ,  G06F16/2457

Abstract: Techniques are introduced herein for maintaining geometry-type data on persistent storage and in memory. Specifically, a DBMS that maintains a database table, which includes at least one column storing spatial data objects (SDOs), also maintains metadata for the database table that includes definition data for one or more virtual columns of the table. According to an embodiment, the definition data includes one or more expressions that calculate minimum bounding box values for SDOs stored in the geometry-type column in the table. The one or more expressions in the metadata maintained for the table are used to create one or more in-memory columns that materialize the bounding box data for the represented SDOs. When a query that uses spatial-type operators to perform spatial filtering over data in the geometry-type column is received, the DBMS replaces the spatial-type operators with operators that operate over the scalar bounding box information materialized in memory.

公开(公告)号：US20210081428A1

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

申请号：US16904392

申请日：2020-06-17

Applicant: Oracle International Corporation

Inventor： Siva Ravada ,  Ying Hu ,  Zhen Hua Liu ,  Shasank Kisan Chavan ,  Aurosish Mishra ,  Vikas Arora

IPC: G06F16/25 ,  G06F16/22 ,  G06F16/2457 ,  G06F16/242 ,  G06F9/38

Abstract: Techniques are introduced herein for maintaining geometry-type data on persistent storage and in memory. Specifically, a DBMS that maintains a database table, which includes at least one column storing spatial data objects (SDOs), also maintains metadata for the database table that includes definition data for one or more virtual columns of the table. According to an embodiment, the definition data includes one or more expressions that calculate minimum bounding box values for SDOs stored in the geometry-type column in the table. The one or more expressions in the metadata maintained for the table are used to create one or more in-memory columns that materialize the bounding box data for the represented SDOs. When a query that uses spatial-type operators to perform spatial filtering over data in the geometry-type column is received, the DBMS replaces the spatial-type operators with operators that operate over the scalar bounding box information materialized in memory.

公开(公告)号：US10255293B2

公开(公告)日：2019-04-09

申请号：US15172196

申请日：2016-06-03

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Honglei Zhu ,  Liujian Qian ,  Siva Ravada

IPC: G01C21/32 ,  G06F17/30

Abstract: Computerized systems, methods, and other embodiments associated with generating virtual map tiles according to an ad hoc specification are described. In one embodiment, a method includes defining, in response to receiving a request through an interface of a map server, virtual map tiles according to an ad hoc specification. The ad hoc specification indicates characteristics of the virtual map tiles including at least a format and map content of the virtual map tiles. The method includes computing the virtual map tiles from at least the map content specified by the ad hoc specification and according to the format indicated by the ad hoc specification. Computing the virtual map tiles includes computing the virtual map tiles in response to receiving the request. The method includes transmitting the virtual map tiles to a client device to cause the viewable region of the electronic map to be displayed on the client device.

公开(公告)号：US09384228B2

公开(公告)日：2016-07-05

申请号：US13782964

申请日：2013-03-01

Applicant: Oracle International Corporation

Inventor： Zhihai Zhang ,  Qingyun Xie ,  Siva Ravada

IPC: G06F7/00 ,  G06F17/00 ,  G06F17/30

CPC classification number: G06F17/30345

Abstract: A method, system, and computer program product for implementing a multi-column/multi-row constraint. Lock techniques prevent access collisions even when two or more concurrently running software applications are attempting to insert rows into the same relational database table (subject to the same multi-column/multi-row constraints). The method commences by receiving (e.g., from a first process) a first row to be inserted into a relational database table where the row comprises at least two constrained columns corresponding to the multi-column/multi-row constraint, then receiving (e.g., from a second process) a second row to be inserted into the same table. Using column locks, the method recognizes the potential for conflicting row insertions, and manages locks to prevent conflicting access grants to the two constrained columns of the existing database table. The evaluation of the multi-column/multi-row constraint is performed over the first row to be inserted and a row or rows of the relational database table.

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

公开(公告)号：US20150149479A1

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

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

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