Mengchu Cai from 1155 Lone Pine Ln, San Jose, CA 95120, age 54, Phone: 408 268-2493

Resumes

Principal Software Engineer

view source

Location:

San Francisco, CA

Industry:

Computer Software

Work:

Amazon Web Services
Principal Software Engineer
Ibm Aug 2000 - Dec 2013
Senior Technical Staff Member
University of Nebraska–Lincoln 1998 - 2000
Research Assistant
Beida Jade Bird Jul 1995 - May 1998
Project Manager

Education:

Peking University 1988 - 1995
Masters, Computer Science University of Nebraska - Lincoln
Doctorates, Doctor of Philosophy, Philosophy

Skills:

Software Development
Db2
Sql
C
Agile Methodologies
Unix
C++
Data Warehousing
Soa
Java Enterprise Edition
Amazon Web Services
Eclipse
Relational Databases

Us Patents

Method, System, And Program For Optimizing Processing Of Nested Functions
view source
US Patent:

7124137, Oct 17, 2006
Filed:

Dec 19, 2002
Appl. No.:

10/325781
Inventors:

Fen-Ling Lin - San Jose CA, US
Yao Ching Stephen Chen - Saratoga CA, US
Yun Wang - Saratoga CA, US
Guogen Zhang - San Jose CA, US
Mengchu Cai - Redmond WA, US
Jason Alexander Cu - San Jose CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
G06F 15/177
US Classification:

707100, 707 4, 709223
Abstract:

Disclosed is a method, system, and program for processing a function. A set of nested functions are received. A composite function is generated for the set of nested functions. A tagging template is generated for the set of nested functions that corresponds to the composite function. A result is produced by evaluating the composite function using the tagging template.

Method, System, And Program For Optimizing Aggregate Processing
view source
US Patent:

7243098, Jul 10, 2007
Filed:

Dec 19, 2002
Appl. No.:

10/325854
Inventors:

Yun Wang - Saratoga CA, US
Fen-Ling Lin - San Jose CA, US
Yao Ching Stephen Chen - Saratoga CA, US
Mengchu Cai - Redmond WA, US
Jason Alexander Cu - San Jose CA, US
Allan Benjamin Lebovitz - San Jose CA, US
Guogen Zhang - San Jose CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
G06F 15/16
US Classification:

707 4, 707 3, 707 5, 709203
Abstract:

Disclosed is a method, system, and program for processing an aggregate function. Rows that contain a reference to intermediate result structures are grouped to form groups. For each group, aggregate element structures are formed from the intermediate result structures and, if the aggregate function specifies ordering, the aggregate element structures are sorted based on a sort key.

Cost-Based Subquery Correlation And Decorrelation
view source
US Patent:

7376646, May 20, 2008
Filed:

Jun 17, 2005
Appl. No.:

11/156500
Inventors:

Thomas Abel Beavin - Milpitas CA, US
Mengchu Cai - San Jose CA, US
Yao-Ching Stephen Chen - Saratoga CA, US
Hsiuying Yen Cheng - Fremont CA, US
Fen-Ling Lin - San Jose CA, US
Irene Ching-Hua Liu - San Jose CA, US
Jerry Mukai - San Jose CA, US
Demai Ni - Davis CA, US
Yoichi Tsuji - San Jose CA, US
Li Xia - San Jose CA, US
Ying Zeng - Santa Clara CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
US Classification:

707 3, 707 4, 707102
Abstract:

Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.

Optimizing Aggregate Processing
view source
US Patent:

7657570, Feb 2, 2010
Filed:

Apr 20, 2007
Appl. No.:

11/738406
Inventors:

Yun Wang - Saratoga CA, US
Fen-Ling Lin - San Jose CA, US
Yao-Ching Chen - Saratoga CA, US
Mengchu Cai - Redmond WA, US
Jason Alexander Cu - San Jose CA, US
Allan Benjamin Lebovitz - San Jose CA, US
Guogen Zhang - San Jose CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/00
US Classification:

7071041, 707101, 707102, 707103 R
Abstract:

Disclosed is method for processing an aggregate function. Rows that contain a reference to intermediate result structures are grouped to form groups. For each group, aggregate element structures are formed from the intermediate result structures and, if the aggregate function specifies ordering, the aggregate element structures are sorted based on a sort key.

Cost-Based Subquery Correlation And Decorrelation
view source
US Patent:

7840552, Nov 23, 2010
Filed:

Apr 16, 2008
Appl. No.:

12/104379
Inventors:

Thomas Abel Beavin - Milpitas CA, US
Mengchu Cai - San Jose CA, US
Yao-Ching Stephen Chen - Saratoga CA, US
Hsiuying Yen Cheng - Fremont CA, US
Fen-Ling Lin - San Jose CA, US
Irene Ching-Hua Liu - San Jose CA, US
Jerry Mukai - San Jose CA, US
Demai Ni - Davis CA, US
Yoichi Tsuji - San Jose CA, US
Li Xia - San Jose CA, US
Ying Zeng - Santa Clara CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
US Classification:

707713, 707714, 707999003
Abstract:

Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.

Supporting Efficient Partial Update Of Hierarchically Structured Documents Based On Record Storage
view source
US Patent:

8495085, Jul 23, 2013
Filed:

Sep 27, 2010
Appl. No.:

12/891146
Inventors:

Mengchu Cai - San Jose CA, US
Yu Chen - San Jose CA, US
Eric Naoto Katayama - San Jose CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
US Classification:

707769, 707770
Abstract:

Methods and apparatus, including computer program products, implementing and using techniques for performing a partial update of a hierarchically structured document referencing one or more records stored in a database. An expression specifying one or more updates to be applied to the document is received. The document is searched to find update target position(s). Based on the received expression, a pending update list is built. When an update target position is found, a row of a document column in a base table is updated with the new version number for the document. New database records for insertion into the new document version are generated from the pending update list. Old database records to be replaced are identified. A database table for the document is updated to mark the old database records as obsolete and to add new database records to be referenced in the new version of the document.

Streaming Xpath Algorithm For Xpath Expressions With Predicates
view source
US Patent:

20070198479, Aug 23, 2007
Filed:

Feb 16, 2006
Appl. No.:

11/356366
Inventors:

Mengchu Cai - San Jose CA, US
Jason Cu - Cupertino CA, US
Fen-Ling Lin - San Jose CA, US
Guogen Zhang - San Jose CA, US
Qinghua Zou - Issaquah WA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
US Classification:

707003000
Abstract:

A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

Streaming Xpath Algorithm For Xpath Expressions With Predicates
view source
US Patent:

20080222176, Sep 11, 2008
Filed:

May 19, 2008
Appl. No.:

12/122963
Inventors:

Mengchu CAI - San Jose CA, US
Jason Alexander Cu - Cupertino CA, US
Fen-Ling Lin - San Jose CA, US
Guogen Zhang - San Jose CA, US
Qinghua Zou - Issaquah WA, US
Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:

G06F 17/30
US Classification:

707100, 707E17044
Abstract:

A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.