International Business Machines Corporation

Future Wei Technologies, Inc.

Huawei Technologies Co., Limited

Washington State University

Yonghua Ding

Li Fu Chen

Yu Cheng Chen

Mengchu Cai

Eric N Katayama

Rong-Hoang Chang

Guogen Zhang

Cheng Zhu

Kwai Hing Man

Jason Yang Sun

Li Zhang

Yinghui Wu

Kumar Rajeev Rastogi

Mohammad Hossein Namaki

Xin Zhang

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 &#x3b4;-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&#x2032;(G) for the top-n diversified &#x3b4;-expansion terms Q&#x2032; are cost bounded by cost threshold &#x3b4; and exploration range r specified by the user. The user selects a new term of terms Q&#x2032; and an incremental query evaluation of the new term is invoked to compute expanded query answers Q&#x2032;(G) by incrementally updating the validated subset of answers Q(G), without re-evaluating an expanded query Q&#x2032; including the new term from scratch.

Quality-aware keyword query suggestion and evaluation

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.

Dynamic computation node grouping with cost based optimization for massively parallel processing

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.

System and method for caching and parameterizing IR

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.

System and method for database query

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.

Adaptive code generation with a cost model for JIT compiled execution in a database system

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.

Optimizing update operations in hierarchically structured documents

Growing community of inventors

San Jose, CA, United States of America

Yonghua Ding