Patents by Inventor Demai Ni
Demai Ni has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10885118Abstract: 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.Type: GrantFiled: May 4, 2018Date of Patent: January 5, 2021Assignee: Futurewei Technologies, Inc.Inventors: Wenfei Fan, Chunming Hu, Chao Tian, Yu Chen, Demai Ni
-
Patent number: 10649994Abstract: 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.Type: GrantFiled: April 30, 2018Date of Patent: May 12, 2020Assignee: Futurewei Technologies, Inc.Inventors: Wenfei Fan, Yang Cao, Floris Geerts, Ping Lu, Yu Chen, Demai Ni
-
Patent number: 10506030Abstract: A system (and associated method) includes a processor which determines a performance metric ratio of a performance metric of a second type of server relative to a performance metric of a first server type for each of multiple sizes of multiple benchmark datasets to thereby determine a plurality of performance metric ratio values. The processor also determines an interpolation function for the plurality of performance metric ratio values usable to compute interpolation performance metric ratios of the second type of server relative to the first type of server for dataset sizes other than the first plurality of sizes. Given a second dataset, the processor determines an amount of the second dataset to provide to each of the respective server types using the interpolation function. The processor configures a load balancer based on the amount of the second dataset determined for each type of server.Type: GrantFiled: June 2, 2017Date of Patent: December 10, 2019Assignee: Futurewei Technologies, Inc.Inventors: Demai Ni, Mingyi Zhang, Le Cai
-
Publication number: 20180352024Abstract: A system (and associated method) includes a processor which determines a performance metric ratio of a performance metric of a second type of server relative to a performance metric of a first server type for each of multiple sizes of multiple benchmark datasets to thereby determine a plurality of performance metric ratio values. The processor also determines an interpolation function for the plurality of performance metric ratio values usable to compute interpolation performance metric ratios of the second type of server relative to the first type of server for dataset sizes other than the first plurality of sizes. Given a second dataset, the processor determines an amount of the second dataset to provide to each of the respective server types using the interpolation function. The processor configures a load balancer based on the amount of the second dataset determined for each type of server.Type: ApplicationFiled: June 2, 2017Publication date: December 6, 2018Inventors: Demai Ni, Mingyi Zhang, Le Cai
-
Publication number: 20180341677Abstract: 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.Type: ApplicationFiled: April 30, 2018Publication date: November 29, 2018Inventors: Wenfei Fan, Yang Cao, Floris Geerts, Ping Lu, Yu Chen, Demai Ni
-
Publication number: 20180330008Abstract: 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.Type: ApplicationFiled: May 4, 2018Publication date: November 15, 2018Inventors: Wenfei Fan, Chunming Hu, Chao Tian, Yu Chen, Demai Ni
-
Publication number: 20160306810Abstract: System and method for storing statistical data of records stored in a distributed file system. In one aspect a statistical data block is allocated in a memory of a data node for storing statistical data of records stored in a storage disk of the data node. Each data block of the plurality of data blocks in the data node has a respective entry in the statistical data block, which is collocated with data blocks on the data node. Statistical data of records stored in the distributed file system are collected, and written to statistical data block in the memory of the data node.Type: ApplicationFiled: April 15, 2015Publication date: October 20, 2016Inventors: Demai NI, Guogen ZHANG, Qingqing ZHOU, Jason Yang SUN
-
Patent number: 7840552Abstract: 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.Type: GrantFiled: April 16, 2008Date of Patent: November 23, 2010Assignee: International Business Machines CorporationInventors: Thomas Abel Beavin, Mengchu Cai, Yao-Ching Stephen Chen, Hsiuying Yen Cheng, Fen-Ling Lin, Irene Ching-Hua Liu, Jerry Mukai, Demai Ni, Yoichi Tsuji, Li Xia, Ying Zeng
-
Publication number: 20080215534Abstract: 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.Type: ApplicationFiled: April 16, 2008Publication date: September 4, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Thomas Abel BEAVIN, Mengchu CAI, Yao-Ching Stephen CHEN, Hsiuying Yen CHENG, Fen-Ling LIN, Irene Ching-Hua LIU, Jerry MUKAI, Demai NI, Yoichi TSUJI, Li XIA, Ying ZENG
-
Patent number: 7376646Abstract: 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.Type: GrantFiled: June 17, 2005Date of Patent: May 20, 2008Assignee: International Business Machines CorporationInventors: Thomas Abel Beavin, Mengchu Cai, Yao-Ching Stephen Chen, Hsiuying Yen Cheng, Fen-Ling Lin, Irene Ching-Hua Liu, Jerry Mukai, Demai Ni, Yoichi Tsuji, Li Xia, Ying Zeng
-
Patent number: 7346609Abstract: 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.Type: GrantFiled: November 16, 2004Date of Patent: March 18, 2008Assignee: International Business Machines CorporationInventors: Yao-Ching Stephen Chen, Irene Ching-Hua Liu, Demai Ni, Guogen Zhang, Qinghua Zou
-
Publication number: 20060287979Abstract: 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.Type: ApplicationFiled: June 17, 2005Publication date: December 21, 2006Inventors: Thomas Beavin, Mengchu Cai, Yao-Ching Chen, Hsiuying Cheng, Fen-Ling Lin, Irene Liu, Jerry Mukai, Demai Ni, Yoichi Tsuji, Li Xia, Ying Zeng
-
Publication number: 20060106758Abstract: 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.Type: ApplicationFiled: November 16, 2004Publication date: May 18, 2006Inventors: Yao-Ching Chen, Irene Liu, Demai Ni, Guogen Zhang, Qinghua Zou