公开(公告)号：US20220237509A1

公开(公告)日：2022-07-28

申请号：US17379937

申请日：2021-07-19

Applicant: Oracle International Corporation

Inventor： John Frederick Courtney ,  Kenneth Paul Baclawski ,  Dieter Gawlick ,  Kenny C. Gross ,  Guang Chao Wang ,  Anna Chystiakova ,  Richard Paul Sonderegger ,  Zhen Hua Liu

IPC: G06N20/00 ,  G06N5/04 ,  G06F11/32

Abstract: Techniques for providing decision rationales for machine-learning guided processes are described herein. In some embodiments, the techniques described herein include processing queries for an explanation of an outcome of a set of one or more decisions guided by one or more machine-learning processes with supervision by at least one human operator. Responsive to receiving the query, a system determines, based on a set of one or more rationale data structures, whether the outcome was caused by human operator error or the one or more machine-learning processes. The system then generates a query response indicating whether the outcome was caused by the human operator error or the one or more machine-learning processes.

公开(公告)号：US20220114178A1

公开(公告)日：2022-04-14

申请号：US17162564

申请日：2021-01-29

Applicant: Oracle International Corporation

Inventor： Vlad Ioan Haprian ,  Mikael Gonzalez Morales ,  Laurent Daynes ,  Zhen Hua Liu ,  Danica Porobic ,  Marco Arnaboldi ,  Jean-Pierre Lozi ,  Hugo Kapp ,  Sungpack Hong ,  Shasank Kisan Chavan ,  Hassan Chafi

IPC: G06F16/2455 ,  G06F16/26 ,  G06F16/2453 ,  G06F16/248 ,  G06F16/22

Abstract: Techniques are provided for processing a graph query by exploiting an in-memory graph index and minimizing the number of storage accesses needed to project properties of generated paths. A predefined number of paths from a graph query runtime is accumulated, using different data structures, before executing storage accesses necessary to retrieve all properties needed. A first data structure stores all paths from the graph query runtime that hit cache(s) entirely. A second data structure stores paths that do not hit caches at any level or only a subset of the levels does. Once any of these data structures are full, result rows are produced based on the two data structures prior to extracting more paths from the graph query runtime.

公开(公告)号：US11226955B2

公开(公告)日：2022-01-18

申请号：US16022465

申请日：2018-06-28

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Aurosish Mishra ,  Shasank K. Chavan ,  Douglas J. McMahon ,  Vikas Arora ,  Hui Joe Chang ,  Shubhro Jyoti Roy

IPC: G06F16/30 ,  G06F16/23 ,  G06F16/22 ,  G06F16/2455

Abstract: A “hybrid derived cache” stores semi-structured data or unstructured text data in an in-memory mirrored form and columns in another form, such as column-major format. The hybrid derived cache may cache scalar type columns in column-major format. The structure of the in-memory mirrored form of semi-structured data or unstructured text data enables and/or enhances access to perform path-based and/or text based query operations. A hybrid derived cache improves cache containment for executing query operations. The in-memory mirrored form is used to compute queries in a transactionally consistent manner through the use of an invalid vector that used to determine when to retrieve the transactionally consistent persistent form of semi-structured data or unstructured text data in lieu of the in-memory form.

公开(公告)号：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.

公开(公告)号：US10942924B2

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

申请号：US15807336

申请日：2017-11-08

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Geeta Arora ,  Hui Joe Chang

IPC: G06F16/00 ,  G06F16/2455 ,  G06F16/28 ,  G06F16/22 ,  G06F16/242

Abstract: An approach for improving LOB query performance via automatic inference of locator-less LOB by value semantics in a relational database system is provided. A relational database management system (RDBMS) is implemented to perform operations on LOBs based on the semantics of a statement. During statement compilation, the RDBMS identifies inline LOB column(s) that are not required to be returned to a client. During execution, the identified column(s) are accessed via a shared buffer cache and fed to an operator for evaluation. For inline LOB column(s) that must be returned to the client, during execution, the inline LOB data is copied from the shared buffer cache to a temporary buffer area. Data in the temporary buffer area is fed to an operator for evaluation and is used to create a LOB locator for the inline LOB column(s) that must be returned to the client.

公开(公告)号：US10915575B2

公开(公告)日：2021-02-09

申请号：US13783141

申请日：2013-03-01

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Ying Li ,  Hui Joe Chang

IPC: G06F16/835

Abstract: Methods and systems for improved query evaluation in computer systems are provided. A system receives a full text query for evaluation against a collection of XML documents. The query comprises specifies one or more tokens and one or more contexts. The contexts each represent a path within an XML expression. The query is used to make multiple determinations. First, determining, using token lists, first documents that contain the tokens included in the query. Second, determining, using tag lists, second documents that contain the contexts included in the query. Third, determining third documents by comparing the first documents and the second documents to determine which documents contain both the tokens and the contexts. The query is then evaluated in view of the third documents.

公开(公告)号：US10747814B2

公开(公告)日：2020-08-18

申请号：US15848737

申请日：2017-12-20

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Beda C. Hammerschmidt ,  Sriram Krishnamurthy ,  Ying Lu ,  Douglas J. McMahon ,  Srividya Tata ,  Vikas Arora

IPC: G06F16/30 ,  G06F16/84 ,  G06F16/27 ,  G06F16/2458 ,  G06F16/83 ,  G06F16/81

Abstract: Techniques are described herein for leveraging and extending relational data sharding infrastructure to provide comprehensive support for sharding semi-structured and unstructured data, in addition to the relational data, in a single sharded database system. Specifically, techniques are described in which a catalog server pre-gathers all data it needs to answer fetches from a dynamically created temporary lob. In addition, techniques are provided in which a catalog server encodes shard identifiers in lob locators sent to the client. Techniques are provided for pushing down various operators to shard servers.

公开(公告)号：US10740310B2

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

申请号：US15925427

申请日：2018-03-19

Applicant: Oracle International Corporation

Inventor： Dieter Gawlick ,  Kenny C. Gross ,  Zhen Hua Liu ,  Adel Ghoneimy

IPC: G06F17/00 ,  G06F16/22 ,  G06N5/04 ,  G06N20/00 ,  G06F16/174 ,  G06F16/23 ,  G06F17/40 ,  G06F11/30 ,  G06F11/00

Abstract: The disclosed embodiments relate to a system that preprocesses sensor data to facilitate prognostic-surveillance operations. During operation, the system obtains training data from sensors in a monitored system during operation of the monitored system, wherein the training data comprises time-series data sampled from signals produced by the sensors. The system also obtains functional requirements for the prognostic-surveillance operations. Next, the system performs the prognostic-surveillance operations on the training data and determines whether the prognostic-surveillance operations meet the functional requirements when tested on non-training data. If the prognostic-surveillance operations do not meet the functional requirements, the system iteratively applies one or more preprocessing operations to the training data in order of increasing computational cost until the functional requirements are met.

公开(公告)号：US20200242158A1

公开(公告)日：2020-07-30

申请号：US16852094

申请日：2020-04-17

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Beda C. Hammerschmidt ,  Sriram Krishnamurthy ,  Ying Lu ,  Douglas J. McMahon ,  Srividya Tata ,  Vikas Arora

IPC: G06F16/84 ,  G06F16/27 ,  G06F16/2458 ,  G06F16/83 ,  G06F16/81 ,  G06F16/30

Abstract: Techniques are described herein for leveraging and extending relational data sharding infrastructure to provide comprehensive support for sharding semi-structured and unstructured data, in addition to the relational data, in a single sharded database system. Specifically, techniques are described in which a catalog server pre-gathers all data it needs to answer fetches from a dynamically created temporary lob. In addition, techniques are provided in which a catalog server encodes shard identifiers in lob locators sent to the client. Techniques are provided for pushing down various operators to shard servers.

公开(公告)号：US10467243B2

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

申请号：US15162235

申请日：2016-05-23

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Shasank Kisan Chavan ,  Aurosish Mishra

IPC: G06F17/30 ,  G06F7/00 ,  G06F16/25 ,  G06F16/84 ,  G06F16/22 ,  G06F16/33 ,  G06F16/28 ,  G06F16/215

Abstract: Techniques are described herein for maintaining two copies of the same semi-structured data, where each copy is organized in a different format. One copy is in a first-format that may be convenient for storage, but inefficient for query processing. For example, the first-format may be a textual format that needs to be parsed every time a query needs to access individual data items within a semi-structured object. The database system intelligently loads semi-structured first-format data into volatile memory and, while doing so, converts the semi-structured first-format data to a second-format. Because the data in volatile memory is in the second-format, processing queries against the second-format data both allows disk I/O to be avoided, and increases the efficiency of the queries themselves. For example, the parsing that may be necessary to run a query against a cached copy of the first-format data is avoided.