Patents by Inventor Yonghua Ding
Yonghua Ding 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: 11987802Abstract: The embodiments of the present disclosure may provide an oncolytic virus vector and an application thereof. The oncolytic virus vector may comprise a recombinant nucleic acid. The recombinant nucleic acid may include: (i) a first nucleic acid fragment encoding a soluble PD-1 molecule; (ii) a second nucleic acid fragment encoding a CD86 molecule; and (iii) a third nucleic acid fragment encoding an antibody to a CD3 molecule.Type: GrantFiled: July 11, 2023Date of Patent: May 21, 2024Assignee: SHANGHAI YUNYING BIOPHARMACEUTICAL TECHNOLOGY CO., LTD.Inventors: Ziying Gong, Daoyun Zhang, Yonghua Sun, Yi Wang, Nan Shi, Jun Zhu, Miao Ding
-
Patent number: 11841845Abstract: The present disclosure describes techniques of providing data consistency for hybrid transactional and analytical processing. Logical logs and log serial numbers (LSNs) associated with the logical logs may be generated based on data captured by a first processing engine. The logical logs and the LSNs may be propagated to a storage subsystem configured to be in communication with the first processing engine and a second processing engine. The LSNs and information indicative of LSN schema versions may be stored and distributed by a metadata service. The first processing engine, the second processing engine, the storage subsystem and the metadata service are modularized, and support a LSN mechanism for maintaining data consistency.Type: GrantFiled: August 31, 2021Date of Patent: December 12, 2023Assignee: LEMON INC.Inventors: Jianjun Chen, Yonghua Ding, Ye Liu, Fangshi Li, Lixun Cao, Yang Liu, Li Zhang, Mingyi Zhang, Xiangrui Meng, Junda Zhao, Lei Zhang, Rui Shi
-
Patent number: 11789936Abstract: The present disclosure describes storage techniques for hybrid transactional and analytical processing. Data captured by a first processing engine may be received. The first processing engine may be configured to perform online transactional processing). Multiple replicas of logical logs generated based on the data may be distributed to a Delta Store by applying a quorum protocol on the multiple replicas. Data in the Delta Store are stored in a row format and are visible to a query for online analytical processing performed by a second processing engine. Data may be flushed from the Delta Store to a Base Store based on one or more predetermined rules. Data in the Base Store are stored in a columnar format and may be accessible by the second processing engine.Type: GrantFiled: August 31, 2021Date of Patent: October 17, 2023Assignee: LEMON INC.Inventors: Jianjun Chen, Yonghua Ding, Ye Liu, Fangshi Li, Li Zhang, Mingyi Zhang, Kui Wei, Wei Ding, Kai Wu, Jason Yang Sun
-
Publication number: 20230062198Abstract: The present disclosure describes techniques of providing data consistency for hybrid transactional and analytical processing. Logical logs and log serial numbers (LSNs) associated with the logical logs may be generated based on data captured by a first processing engine. The logical logs and the LSNs may be propagated to a storage subsystem configured to be in communication with the first processing engine and a second processing engine. The LSNs and information indicative of LSN schema versions may be stored and distributed by a metadata service. The first processing engine, the second processing engine, the storage subsystem and the metadata service are modularized, and support a LSN mechanism for maintaining data consistency.Type: ApplicationFiled: August 31, 2021Publication date: March 2, 2023Inventors: Jianjun Chen, Yonghua Ding, Ye Liu, Fangshi Li, Lixun Cao, Yang Liu, Li Zhang, Mingyi Zhang, Xiangrui Meng, Junda Zhao, Lei Zhang, Rui Shi
-
Publication number: 20230063730Abstract: The present disclosure describes storage techniques for hybrid transactional and analytical processing. Data captured by a first processing engine may be received. The first processing engine may be configured to perform online transactional processing). Multiple replicas of logical logs generated based on the data may be distributed to a Delta Store by applying a quorum protocol on the multiple replicas. Data in the Delta Store are stored in a row format and are visible to a query for online analytical processing performed by a second processing engine. Data may be flushed from the Delta Store to a Base Store based on one or more predetermined rules. Data in the Base Store are stored in a columnar format and may be accessible by the second processing engine.Type: ApplicationFiled: August 31, 2021Publication date: March 2, 2023Inventors: Jianjun Chen, Yonghua Ding, Ye Liu, Fangshi Li, Li Zhang, Mingyi Zhang, Kui Wei, Wei Ding, Kai Wu, Jason Yang Sun
-
Publication number: 20230066540Abstract: The present disclosure describes hybrid transactional and analytical processing (HTAP) techniques. A HTAP system comprises a first processing engine configured to perform online transactional processing, a second processing engine configured to perform online analytical processing, and a storage in communication with the first processing engine and the second processing engine. The first processing engine, the second processing engine, and the storage may be modularized and configured to be decoupled from each other. The system may be configured to capture data by the first processing engine in real time, organize the data in a first format in a first part of the storage for use by the first processing engine, propagate the data to a second part of the storage subsystem, and organize the data in a second format in the second part of the storage for use by the second processing engine.Type: ApplicationFiled: August 31, 2021Publication date: March 2, 2023Inventors: Jianjun Chen, Yonghua Ding, Ye Liu, Fangshi Li, Lixun Cao, Yang Liu, Li Zhang, Mingyi Zhang, Lei Zhang, Rui Shi
-
Patent number: 11514049Abstract: A query suggestion to expand an initial query is calculated whereby the cost of the expanded initial query is bounded in both time and quality. The user validates a subset of the top-n answers Q(G) to a query Q and provides adjusted configuration parameters. The top-n diversified ?-expansion terms Q? are calculated from the validated subset of answers Q(G) to the query Q and are provided to an interactive user interface for selection. Answers Q?(G) for the top-n diversified ?-expansion terms Q? are cost bounded by cost threshold ? and exploration range r specified by the user. The user selects a new term of terms Q? and an incremental query evaluation of the new term is invoked to compute expanded query answers Q?(G) by incrementally updating the validated subset of answers Q(G), without re-evaluating an expanded query Q? including the new term from scratch.Type: GrantFiled: November 12, 2020Date of Patent: November 29, 2022Assignees: Huawei Technologies Co., Ltd., Washington State UniversityInventors: Mohammad Hossein Namaki, Yinghui Wu, Xin Zhang, Yonghua Ding
-
Publication number: 20210064620Abstract: A query suggestion to expand an initial query is calculated whereby the cost of the expanded initial query is bounded in both time and quality. The user validates a subset of the top-n answers Q(G) to a query Q and provides adjusted configuration parameters. The top-n diversified ?-expansion terms Q? are calculated from the validated subset of answers Q(G) to the query Q and are provided to an interactive user interface for selection. Answers Q?(G) for the top-n diversified ?-expansion terms Q? are cost bounded by cost threshold ? and exploration range r specified by the user. The user selects a new term of terms Q? and an incremental query evaluation of the new term is invoked to compute expanded query answers Q?(G) by incrementally updating the validated subset of answers Q(G), without re-evaluating an expanded query Q? including the new term from scratch.Type: ApplicationFiled: November 12, 2020Publication date: March 4, 2021Inventors: Mohammad Hossein Namaki, Yinghui Wu, Xin Zhang, Yonghua Ding
-
Patent number: 10649996Abstract: A massively parallel processing shared nothing relational database management system includes a plurality of storages assigned to a plurality of compute nodes. The system comprises a non-transitory memory having instructions and one or more processors in communication with the memory. The one or more processors execute the instructions to store a set of data in a first set of storages in the plurality of storages. The first set of data is hashed into a repartitioned set of data. The first set of storages is reassigned to a second set of compute nodes in the plurality of compute nodes. The repartitioned set of data is distributed to the second set of compute nodes and a database operation is performed on the repartitioned set of data by the second set of compute nodes.Type: GrantFiled: December 9, 2016Date of Patent: May 12, 2020Assignee: Futurewei Technologies, Inc.Inventors: Li Zhang, Jason Yang Sun, Yonghua Ding
-
Patent number: 10339137Abstract: A system and method of caching and parameterizing intermediate representation code includes receiving, by a database, a query, parsing, by the database, the query to obtain a plan tree comprising a plurality of plan nodes arranged in hierarchical order descending from a top plan node, generating, by the database, node intermediate representations (IRs) for the plan nodes, executing, by the database, a first query using the node IRs, and reusing, by the database, the node IRs to execute subsequent queries.Type: GrantFiled: December 7, 2015Date of Patent: July 2, 2019Assignee: Futurewei Technologies, Inc.Inventors: Kumar Rajeev Rastogi, Yonghua Ding, Cheng Zhu
-
Patent number: 10031940Abstract: A method includes receiving, by a database system, a query statement and forming a runtime plan tree in accordance with the query statement. The method also includes traversing the runtime plan tree including determining whether a function node of the runtime plan tree is qualified for just-in-time (JIT) compilation. Additionally, the method includes, upon determining that the function node is a qualified for JIT compilation producing a string key in accordance with a function of the function node and determining whether a compiled object corresponding to the string key is stored in a compiled object cache.Type: GrantFiled: September 24, 2015Date of Patent: July 24, 2018Assignee: Futurewei Technologies, Inc.Inventors: Cheng Zhu, Yonghua Ding, Guogen Zhang
-
Publication number: 20180165331Abstract: A massively parallel processing shared nothing relational database management system includes a plurality of storages assigned to a plurality of compute nodes. The system comprises a non-transitory memory having instructions and one or more processors in communication with the memory. The one or more processors execute the instructions to store a set of data in a first set of storages in the plurality of storages. The first set of data is hashed into a repartitioned set of data. The first set of storages is reassigned to a second set of compute nodes in the plurality of compute nodes. The repartitioned set of data is distributed to the second set of compute nodes and a database operation is performed on the repartitioned set of data by the second set of compute nodes.Type: ApplicationFiled: December 9, 2016Publication date: June 14, 2018Applicant: Futurewei Technologies, Inc.Inventors: Li Zhang, Jason Yang Sun, Yonghua Ding
-
Patent number: 9934051Abstract: The disclosure relates to technology for query compilation in a database management system. A first execution time of code for at least one database query without applying a code generation method is estimated and in response to receiving the at least one database query, and for one or more code generation methods, a compilation cost and a second execution time of the code as modified by the code generation methods is estimated. A cost savings for each of the one or more code generation methods is calculated, where the cost savings is calculated as the first execution time less the second execution time of the code generation method, less the compilation cost of the code generation method. One of the code generation methods or the no code generation method with the highest cost savings is then selected.Type: GrantFiled: April 17, 2017Date of Patent: April 3, 2018Assignee: FUTUREWEI TECHNOLOGIES, INC.Inventors: Yonghua Ding, Jason Yang Sun, Li Zhang
-
Patent number: 9934210Abstract: Optimizing update instructions in hierarchically structured documents is provided. A pending update list including a first plurality of items is received. Each item of the first plurality of items describes an update to a hierarchically structured document. Each of one or more items of the first plurality of items is added to a subsumed update list having a second plurality of items. The subsumed update list is ordered based, at least in part, on a document order and on a target node of each of the second plurality of items. Subsume logic is applied to each of the one or more items based, at least in part, on the second plurality of items. Responsive to determining that subsume logic has been applied to each item of the first plurality of items, each of the second plurality of items of the subsumed update list is executed.Type: GrantFiled: January 23, 2017Date of Patent: April 3, 2018Assignee: International Business Machines CorporationInventors: Mengchu Cai, Rong-Hoang Chang, Li Chen, Yu Chen, Yonghua Ding, Eric N. Katayama, Kwai Hing Man
-
Patent number: 9934209Abstract: Optimizing update instructions in hierarchically structured documents is provided. A pending update list including a first plurality of items is received. Each item of the first plurality of items describes an update to a hierarchically structured document. Each of one or more items of the first plurality of items is added to a subsumed update list having a second plurality of items. The subsumed update list is ordered based, at least in part, on a document order and on a target node of each of the second plurality of items. Subsume logic is applied to each of the one or more items based, at least in part, on the second plurality of items. Responsive to determining that subsume logic has been applied to each item of the first plurality of items, each of the second plurality of items of the subsumed update list is executed.Type: GrantFiled: January 23, 2017Date of Patent: April 3, 2018Assignee: International Business Machines CorporationInventors: Mengchu Cai, Rong-Hoang Chang, Li Chen, Yu Chen, Yonghua Ding, Eric N. Katayama, Kwai Hing Man
-
Patent number: 9747264Abstract: Optimizing update instructions in hierarchically structured documents is provided. A pending update list including a first plurality of items is received. Each item of the first plurality of items describes an update to a hierarchically structured document. Each of one or more items of the first plurality of items is added to a subsumed update list having a second plurality of items. The subsumed update list is ordered based, at least in part, on a document order and on a target node of each of the second plurality of items. Subsume logic is applied to each of the one or more items based, at least in part, on the second plurality of items. Responsive to determining that subsume logic has been applied to each item of the first plurality of items, each of the second plurality of items of the subsumed update list is executed.Type: GrantFiled: June 19, 2015Date of Patent: August 29, 2017Assignee: International Business Machines CorporationInventors: Mengchu Cai, Rong-Hoang Chang, Li Chen, Yu Chen, Yonghua Ding, Eric N. Katayama, Kwai Hing Man
-
Publication number: 20170161325Abstract: A system and method of caching and parameterizing intermediate representation code includes receiving, by a database, a query, parsing, by the database, the query to obtain a plan tree comprising a plurality of plan nodes arranged in hierarchical order descending from a top plan node, generating, by the database, node intermediate representations (IRs) for the plan nodes, executing, by the database, a first query using the node IRs, and reusing, by the database, the node IRs to execute subsequent queries.Type: ApplicationFiled: December 7, 2015Publication date: June 8, 2017Inventors: Kumar Rajeev Rastogi, Yonghua Ding, Cheng Zhu
-
Publication number: 20170124032Abstract: Optimizing update instructions in hierarchically structured documents is provided. A pending update list including a first plurality of items is received. Each item of the first plurality of items describes an update to a hierarchically structured document. Each of one or more items of the first plurality of items is added to a subsumed update list having a second plurality of items. The subsumed update list is ordered based, at least in part, on a document order and on a target node of each of the second plurality of items. Subsume logic is applied to each of the one or more items based, at least in part, on the second plurality of items. Responsive to determining that subsume logic has been applied to each item of the first plurality of items, each of the second plurality of items of the subsumed update list is executed.Type: ApplicationFiled: January 23, 2017Publication date: May 4, 2017Inventors: Mengchu Cai, Rong-Hoang Chang, Li Chen, Yu Chen, Yonghua Ding, Eric N. Katayama, Kwai Hing Man
-
Publication number: 20170124033Abstract: Optimizing update instructions in hierarchically structured documents is provided. A pending update list including a first plurality of items is received. Each item of the first plurality of items describes an update to a hierarchically structured document. Each of one or more items of the first plurality of items is added to a subsumed update list having a second plurality of items. The subsumed update list is ordered based, at least in part, on a document order and on a target node of each of the second plurality of items. Subsume logic is applied to each of the one or more items based, at least in part, on the second plurality of items. Responsive to determining that subsume logic has been applied to each item of the first plurality of items, each of the second plurality of items of the subsumed update list is executed.Type: ApplicationFiled: January 23, 2017Publication date: May 4, 2017Inventors: Mengchu Cai, Rong-Hoang Chang, Li Chen, Yu Chen, Yonghua Ding, Eric N. Katayama, Kwai Hing Man
-
Publication number: 20170091269Abstract: A method includes receiving, by a database system, a query statement and forming a runtime plan tree in accordance with the query statement. The method also includes traversing the runtime plan tree including determining whether a function node of the runtime plan tree is qualified for just-in-time (JIT) compilation. Additionally, the method includes, upon determining that the function node is a qualified for JIT compilation producing a string key in accordance with a function of the function node and determining whether a compiled object corresponding to the string key is stored in a compiled object cache.Type: ApplicationFiled: September 24, 2015Publication date: March 30, 2017Inventors: Cheng Zhu, Yonghua Ding, Guogen Zhang