Mengmeng Chen

US Patent:

8572051, Oct 29, 2013

Filed:

Aug 8, 2012

Appl. No.:

13/569377

Inventors:

Mengmeng Chen - Belmont CA, US
Yali Zhu - Foster City CA, US
Thierry Cruanes - Foster City CA, US
Alan Wood - San Jose CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707687, 7079992

Abstract:

Parallel execution of SQL statements is made fault-tolerant. Specifically, during parallel query processing, a new row source is created that allows checkpoints to be stored at certain points in the query processing. If a failure occurs, then the query can be restarted from the most recent checkpoint (rather than from the very beginning of the query). The checkpoints are implemented at operation boundaries where rows need to be redistributed among processes. These are natural checkpoint locations because (1) each subsequent operation can proceed from the output of the previous operation, which is stored as a checkpoint, and (2) these operation completions tend to be points in the computation where the query state is minimized, thus minimizing checkpoint storage requirements.

US Patent:

20160078079, Mar 17, 2016

Filed:

Sep 17, 2014

Appl. No.:

14/489192

Inventors:

- Plano TX, US
Mengmeng CHEN - San Jose CA, US
Aniket ADNAIK - Sunnyvale CA, US
Chi Yong KU - San Ramon CA, US

International Classification:

G06F 17/30

Abstract:

A method for updating a column store database and includes establishing a row store database, wherein each row comprises a plurality of attributes. The method includes establishing a column store database including attribute vectors corresponding to at least one attribute in the row store, wherein each attribute vector includes data used to satisfy at least one of previously received analytic queries. The method includes collecting a SQL change statements beginning from a synchronization point indicating when the row store database and the column store database are synchronized, and continuing until an analytic query is received. The method includes sending the plurality of SQL change statements to the column store database upon receipt of the analytic query for updating the column store database for purposes of satisfying the query, wherein the analytic query is directed to a queried range of primary key attributes in the plurality of attributes

US Patent:

20160078089, Mar 17, 2016

Filed:

Sep 17, 2014

Appl. No.:

14/488775

Inventors:

- Plano TX, US
Guangyu SHI - Cupertino CA, US
Masood MORTAZAVI - San Jose CA, US
Chi Yong KU - San Ramon CA, US
Mengmeng CHEN - San Jose CA, US

International Classification:

G06F 17/30

Abstract:

A method for dynamically building a column store database from a row store database. The method includes establishing the row store database for storing data, wherein each row includes a plurality of attributes, and wherein data in row store database is current to a temporal point in time. The method includes establishing the column store database including data structured to satisfy received analytic queries. The method includes beginning from an initial state of the column store database, for each subsequently received analytic query, importing a targeted amount of data from a corresponding temporal state of the row store database into the column store database to satisfy the corresponding subsequently received analytic query.

US Patent:

20150269202, Sep 24, 2015

Filed:

Mar 19, 2015

Appl. No.:

14/663210

Inventors:

- Plano TX, US
Ron-Chung Hu - Palo Alto CA, US
Mengmeng Chen - San Jose CA, US

International Classification:

G06F 17/30

Abstract:

A method of dynamically computing an optimal materialization schedule for each column in a column oriented RDBMS. Dynamic column-specific materialization scheduling in a distributed column oriented RDBMS is optimized by choosing a materialization strategy based on execution cost including central processing unit (CPU), disk, and network costs for each individual exchange operator. The dynamic programming approach is computationally feasible because the optimal schedule for a sub-plan is path independent.

US Patent:

20150220571, Aug 6, 2015

Filed:

Jan 30, 2015

Appl. No.:

14/610574

Inventors:

- Plano TX, US
Mengmeng Chen - San Jose CA, US
Ron-Chung Hu - Palo Alto CA, US
Masood Mortazavi - San Jose CA, US
Fang Cao - San Jose CA, US

International Classification:

G06F 17/30

Abstract:

A method of pipelining re-shuffled data of a distributed column oriented relational database management system (RDBMS). A request is received from a consumer process that requires RDBMS column data to be shuffled in a specific order according to an order that each of a plurality of columns will be used by the consumer process. For each of the plurality of columns, the method re-shuffles the RDBMS column data according to the specific order to form re-shuffled RDBMS column data, and sends the re-shuffled RDBMS column data to the consumer process.

US Patent:

20150205812, Jul 23, 2015

Filed:

Jan 22, 2014

Appl. No.:

14/161388

Inventors:

- Plano TX, US
Mengmeng Chen - San Jose CA, US
Aniket Adnaik - Sunnyvale CA, US

Assignee:

Futurewei Technologies Inc. - Plano TX

International Classification:

G06F 17/30
G06F 9/46

Abstract:

Various disclosed embodiments include methods and systems for managing lock or latch chains in concurrent execution of database queries. A method includes receiving a plurality of transactions, each transaction associated with one or more queuing requests. The method includes, for each transaction, determining one or more partition sets. Each partition set corresponds to one or more database partitions needed for the transaction. The one or more database partitions are included within a partitioned database. The method includes, for each transaction, determining one or more queues needed for the transaction and storing a bitmap representation of the one or more queues needed for the transaction. The one or more queues needed for the transaction correspond to the one or more database partitions needed for the transaction.

US Patent:

20150066972, Mar 5, 2015

Filed:

Sep 4, 2014

Appl. No.:

14/477296

Inventors:

- Plano TX, US
Masood Mortazavi - Santa Clara CA, US
Mengmeng Chen - San Jose CA, US
Fang Cao - San Jose CA, US

International Classification:

G06F 17/30

US Classification:

707765

Abstract:

A method that comprises receiving a logical execution plan for a database query corresponding to a plurality of tables of the database, wherein the logical execution plan comprises one or more operators, receiving an operator cost for each of the operators in the logical execution plan, computing a first accumulated processing cost for a first of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the first table, computing a second accumulated processing cost for a second of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the second table, comparing the first accumulated processing cost and the second accumulated processing cost to determine a table with the highest accumulated processing cost, and responsive to comparing the accumulated processing costs, computing a physical execution plan that requires partitioning the table with the highest accumulated processing cost.