Oracle International Corporation

Emc IP Holding Company LLC

Pivotal Software, Inc.

Emc Corporation

Salesforce Com, Inc.

Siebel Systems, Inc.

Jeffrey Ira Cohen

Caleb E Welton

Cetin Ozbutun

Hakan Jakobsson

Michael Charles Depledge

Tao Ma

Lei Chang

Zhanwei Wang

Hitoshi Harada

Radhika Reddy

Mark Kremer

Quoc Tai Tran

William H Waddington

Alexander C Ho

Kurt Harriman

John Glenn Eshleman

Luke Lonergan

Brian C Hagenbuch

King Lun Choi

Julian Hyde

Matthew Clark McCline

Gavin John Sherry

Florian Michael Waas

Milena Bergant

Robert A Brodersen

Serge Philippe Rielau

Daniel Leary

Jonathan D Klein

Peter S Lim

Prashant Chatterjee

Alon Goldshuv

Joy Jie Kent

Chris Pedrotti

Gavin Sherry

Punit B Shah

Randy Philip Spalten

Peter Siam Sy Lim, Iii

Kenneth A Sell

Charles F McDevitt

Kenneth E Sell

Peter Siam Sy Lim Iii

A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, and the master node may distribute this metadata with query plans to worker nodes. The worker nodes may request additional metadata from the master node when necessary.

Parallel processing database system with a shared metadata store

Techniques are disclosed for handling database queries from multiple different application versions using a single database. A computer system executing a database management system (DBMS) may receive a database query for a database, where the database query is received from a particular version of an application having a plurality of versions. The database query may specify the particular version. The computer system may then identify catalog tables, where the catalog tables include version information columns storing version access information. The computer system may determine that version access information for the database query indicates that one or more database objects corresponding to the database query are accessible to the particular version of the application. Based on the determining, the computer system may access one or more database objects that are responsive to the database query and are accessible to the particular version of the application, which may advantageously reduce or avoid duplication of data stored in the database.

Database implementation for different application versions

Techniques are disclosed relating to concurrently processing transactions. A computer system may maintain a database table having a plurality of versions. Each of the versions may identify a corresponding portion of the database table that transactions associated with that version are permitted to access. The computer system may receive a first request to perform a first transaction to modify a definition of the database table. The computer system may receive a second request to perform a second transaction to modify data stored in the database table. In response to determining that the first and second transactions are associated with different versions of the plurality of versions, the computer system may concurrently process the first and second transactions.

Version-based table locking

A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, where the master node is the root node in a tree. The master node may distribute query plans and query metadata to other nodes in the cluster. These additional nodes may request additional metadata from each other or the master nodes as necessary.

Parallel processing database system

A method and system for executing a query in parallel is disclosed. A master node may receive a query from a client and develop query plans from that query. The query plans may be forwarded to worker nodes for execution, and each query plan may be accompanied by query metadata. The metadata may be stored in a catalog on the master node.

Processing a database query using a shared metadata store

Method of providing access controls and permissions over relational data stored in a hadoop file system

A first and a second catalog access statement are obtained. For the first catalog access statement, a first lock schedule which includes a catalog resource being locked and a lock strength is obtained. For the second catalog access statement, a second lock schedule which includes a catalog resource being locked and a lock strength are obtained. A potential deadlock between the first and the second catalog access statement is identified, including by comparing the first lock schedule and the second lock schedule.

Method of testing coverage of meta data access patterns within a distributed relational system

Database system comprising nodes configured in a tree structure is disclosed. The system includes a shared metadata store on the root node. Child nodes may request metadata from their ancestors. Parents will forward the request upward until the metadata is found or the root node is reached.

Parallel processing database tree structure

A CaQL API is provided by receiving a query directed to a catalog that includes metadata. A catalog access target is determined based at least in part on one or more of the following: a CaQL keyword which is included in the query, a name of a table in the catalog which is included in the query, or a predicate which is included in the query. A catalog function is generated based at least in part on the CaQL keyword and the catalog function is performed on the catalog access target.

Simplified query language for accessing metadata

A computer readable storage medium includes executable instructions to define a map-reduce document that coordinates processing of data in a distributed database. The map-reduce document complies with a map-reduce specification that integrates map-reduce functions with queries in a query language. The operations specified by the map-reduce document are executed in the distributed database.

Integrating map-reduce into a distributed relational database

Growing community of inventors

Sunnyvale, CA, United States of America

Jeffrey Ira Cohen