Oracle International Corporation

Sybase, Inc.

Hui Zhang

Zhen Hua Liu

Vikas Arora

Ying Lu

Muralidhar Krishnaprasad

Douglas James McMahon

James W Warner

Beda Christoph Hammerschmidt

Anand Manikutty

Hui Joe Chang

Susan M Kotsovolos

Sriram Krishnamurthy

Geeta Arora

Joshua Jeffrey Spiegel

Sundeep Abraham

Srikrishnan Suresh

Alfonso Colunga Sosa

Peter J Schneider

Rohan Angrish

Nipun Agarwal

Ravi Murthy

Qin Yu

Abhyudaya Agrawal

Denis B Mukhin

Karuna Muthiah

Douglas James Mcmahon

Herein is a self-tuning database management system (DBMS) storing JavaScript object notation (JSON) documents and operating a JSON datatype as native to the DBMS. In an embodiment, a computer hosts a DBMS that executes a data definition language (DDL) statement that defines, in a database dictionary of the DBMS, a JSON document column of a database table that stores JSON documents as instances of the JSON datatype that is native in the DBMS. The DBMS may autonomously set or adjust configuration settings that control behaviors such as a default width of a JSON document column, in lining or not of the JSON document column, kind and scope and duration of indexing of the JSON document column, and/or caching of the JSON document column such as in an in memory columnar unit (IMCU). The DBMS may use the various configuration settings to control how JSON documents and the native JSON datatype are stored and/or processed.

Technique of efficiently, comprehensively and autonomously support native JSON datatype in RDBMS for both OLTP and OLAP

Herein is acceleration for JavaScript object notation (JSON) documents in a relational database based on multilevel, multifield, multivalued indexing and querying. In an embodiment, into a table in a relational database, a computer stores many hierarchical data objects that respectively contain multiple levels that respectively contain one or more fields. An index is generated for indexed values in fields in at least two of the multiple levels. Based on the index, a database statement that references the table in the relational database and at least one of the indexed fields is executed. Indices herein provide matching to more fields in more levels of hierarchical data objects thereby decreasing or eliminating further filtering by brute force after index access. Matching ordinal positions within an array field needs no further filtration after index access. A single index provides increased spatial locality of index entries for acceleration. Index maintenance is minimized for acceleration.

Technique of comprehensively supporting multi-value, multi-field, multilevel, multi-position functional index over stored aggregately stored data in RDBMS

Disclosed herein are system, method, and computer program product embodiments for optimizing a query plan reuse in a database server system accessible by a plurality of client connections. An embodiment comprises determining if a query plan in a global cache storage is reserved by a client connection of a plurality of client connections, generating a cloned query plan from the query plan based on the determining, and associating the cloned query plan with a second client connection of the plurality of client connections.

Query plan optimization for prepared SQL statements

System, methods and articles of manufacture for optimizing a query plan reuse in a database server system accessible by a plurality of client connections. An embodiment comprises providing at least one global cache storage and a private cache storage to a plurality of client connections, and coordinating utilization of the at least one global cache storage and the private cache storage to share light weight stored procedures and query plans for prepared SQL statements across the plurality of client connections via the at least one global cache storage while avoiding a spinlock access for executing the prepared SQL statements.

Optimization is provided for database statements involving XML data, e.g., XPath and XQuery, which operate over views that use aggregate set operators, e.g., UNION ALL. As part of a 'view merge' stage of query transformation, the query that operates over the view is merged with a query that defines the view. One or more expressions (e.g., operators, predicates, virtual table constructs) from the query that operates over the view are then 'pushed down' to operate on the individual underlying XML data constructs. &#x201c;Branch elimination&#x201d; is performed based on the structure of the view and the query acting over the view, based on which it is possible to determine whether any of the sub-queries, if executed, would result in the return of zero rows. If so, then such branches are eliminated from the transformed query, leaving a reduced set of data containers on which to execute the query.

Optimization of queries over XML views that are based on union all operators

Techniques are provided for processing a query, including receiving the query, where the query specifies certain operations to be performed, including (a) a first set of one or more operations that are to be performed on a markup language data source and (b) a second set of one or more operations that are to be performed on a second data source. Then it is determined that a first server that manages the markup language data source is capable of performing the first set of operations. A request is sent to the first server to perform the first set of operations. A response is received, where the response contains results of performing the first set of operations on the markup language data source. Finally, results are generated for the query based at least in part on the results of performing the first set of operations.

Processing queries against one or more markup language sources

To associate XML data objects ('child objects'), stored in rows of relational or object-relational tables, with the appropriate XML data objects ('parent objects') from which the child objects descend, tables that contain child objects (&#x201c;out-of-line&#x201d; tables) are constructed with an additional column. In one embodiment, this column stores values that identify the root objects, in the appropriate table, from which the respective child objects descend. Hence, the root object from which any given object descends is traceable by following the respective value back to the corresponding root object. In one embodiment, this column stores values that identify the complete XML hierarchical path, through multiple tables, back to the root object from which the respective child objects descend. Consequently, XML query language queries against XML documents stored in such tables can be rewritten as SQL queries against the data in the tables, even in the presence of cyclic constructs.

Techniques for efficiently storing and querying in a relational database, XML documents conforming to schemas that contain cyclic constructs

Techniques are provided for processing a query including receiving the query, where the query specifies certain operations; determining that the query includes a first portion in a first query language and a second portion in a second query language; generating a first in-memory representation for the first portion; generating a second in-memory representation for the second portion; generating a third in-memory representation of the query based on the first in-memory representation and the second in-memory representation; and performing the certain operations based on the third in-memory representation.

Efficient evaluation of queries using translation

Growing community of inventors

Fremont, CA, United States of America

Hui Zhang