Demai Te Ni

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.

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.

US Patent:

20060106758, May 18, 2006

Filed:

Nov 16, 2004

Appl. No.:

10/990834

Inventors:

Yao-Ching Chen - Saratoga CA, US
Irene Liu - San Jose CA, US
Demai Ni - Davis CA, US
Guogen Zhang - San Jose CA, US
Qinghua Zou - Los Angeles CA, US

International Classification:

G06F 17/00

US Classification:

707002000

Abstract:

A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.

US Patent:

20180341677, Nov 29, 2018

Filed:

Apr 30, 2018

Appl. No.:

15/966465

Inventors:

- Plano TX, US
Yang Cao - Edinburgh, GB
Floris Geerts - Berchem, BE
Ping Lu - Beijing, CN
Yu Chen - San Jose CA, US
Demai Ni - Danville CA, US

International Classification:

G06F 17/30

Abstract:

A mechanism for rewriting a bounded query onto a view is disclosed. A query, access constraints, and cached view(s) are obtained. The cached view(s) contain results of the query as applied to a dataset stored in a database. A query rewriting plan is generated by adding a fetch from query operation to the plan when a rewritten query variable can be fetched from a query constant. A fetch from database operation is added to the plan when a rewritten query variable can be fetched as a query variable that obtains bounded data from the database. An access view operation is added to the plan when a rewritten query variable can be fetched from the cached view. The query rewriting plan is executed to fetch retrieved data. The query is executed on the retrieved data to determine updated results to the query without reapplying the query to the dataset.

US Patent:

20180330008, Nov 15, 2018

Filed:

May 4, 2018

Appl. No.:

15/971524

Inventors:

- Plano TX, US
Chunming Hu - Beijing, CN
Chao Tian - Edinburgh, GB
Yu Chen - San Jose CA, US
Demai Ni - Danville CA, US

International Classification:

G06F 17/30
G06F 9/448
G06K 9/62

Abstract:

A mechanism of updating query results for a graph linking data in a computer system is disclosed. Results of the query on the graph linking data are received along with a change to the graph. The change to the graph is determined to be localizable or relatively bounded. Based on the determination of the localizable or relatively bounded change to the graph, the results of the query are updated based on the change to the graph without determining updated results of the query over the graph. This is accomplished by discovering nodes that are affected by the change to the graph, updating data associated with the affected nodes, and applying the updated data to the results of the query.