James James Qiu, 43Union City, CA

8543544, Sep 24, 2013

Jan 6, 2012

13/345584

Frank Lu - San Jose CA, US
James Qiu - Santa Clara CA, US
Jonathan Thatcher - Mountain View CA, US
Murali Vemulapati - Santa Clara CA, US
Carl Wang - Cupertino CA, US
Terrence Barwegen - Cupertino CA, US

Apple Inc. - Cupertino CA

G06F 7/00
G06F 17/00

707634, 707649

Methods, program products, and systems for checkpoint based progressive backup are described. When a system receives a request to update a page of a storage device storing database files of a database, the system can update the page and replicate the updated page in a shadow page in a backup queue. The backup queue can store multiple shadow pages, where each updated page can correspond to at most a specified number of shadow pages in the queue. Each shadow page can be associated with a timestamp of a latest update. At pre-specified temporal checkpoints, the system can write the shadow pages in the queue to a backup file in the order of the timestamps. Upon receiving a restoration request, the system can restore the database to a state as of the time of the checkpoint using the backup file.

2012003, Feb 9, 2012

Aug 6, 2010

12/852234

James Z. Qiu - San Ramon CA, US
Paul Blokhin - Union City CA, US
Jie Liu - Foster City CA, US
Masayuki Karahashi - San Mateo CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707803, 707E17005

A method of application phased upgrade and phased user migration. In one embodiment, in one embodiment a first version of an application generates a first SQL insert statement, wherein the first SQL insert statement comprises a first table name, a first field name, and a first value. A second version of an application generates a second SQL insert statement, wherein the second SQL insert statement comprises the first table name, the first field name, and a second value. A database system inserts a first record into a first table in response to the database system receiving the first SQL insert statement. The database system inserts a second record into the first table via a view in response to the database system receiving the second SQL insert statement. The first record comprises distinct first and second fields corresponding to the first name and a second field name, respectively. The first field stores the first value. The second record comprises distinct first and second fields corresponding to the first and second field names, respectively. The second field of the second record stores the second value.

2013026, Oct 3, 2013

Apr 2, 2012

13/437464

James Qiu - Santa Clara CA, US
Murali Vemulapati - Santa Clara CA, US

G06F 17/30

707714, 707E17054

Methods, program products, and systems for filtering a distributed join are described. A computing device can receive a database join request to join a first table stored on a first system and a second table stored on a second system to create a related data set. The join request can include a filtering condition for filtering the related data set. The system can divide the filtering condition into a first sub-condition and a second sub-condition, and send the first sub-condition and a second sub-condition to the first system and second system, respectively. The first system and second system can then perform filtering locally, and send filtered intermediate result to the computing device.

2016033, Nov 17, 2016

Aug 21, 2015

14/833015

- Cupertino CA, US
James Qiu - Santa Clara CA, US
Frank Lu - San Jose CA, US

Apple Inc. - Cupertino CA

G06F 17/30

System, method, and computer program product key compression and cached-locking are described. A computer system can store database files or operating system files in a tree data structure. The system can store data or metadata as key-value pairs in nodes of the tree data structure. The keys in the key-value pairs can have a hierarchical structure, which may or may not correspond to the tree data structure. The system can compress the keys by reducing duplicated storage of shared portions of the keys. The system can use an index in a tree node to represent the hierarchical structure of the key-value pairs stored in that tree node. To access a value in a key-value pair, the system can identify the tree node to search, query the index in that tree node to locate the value, and then access the value at the indexed location.