G06F16/2454

Clustering suggestions for partial query auto-completion

Aspects of the present disclosure relate to providing, based on a partial query string, a plurality of autosuggestions that are diverse in nature such that the user is more likely to see the preferred complete query terms and therefore more likely to select one of the preferred suggestions which will increase search efficiency. As described herein, such functionality relates to generating cluster groups of candidate suggestions, each cluster including sub-topics, then performing the search based on a selected cluster or sub-topic. To generate the cluster groups, systems and methods, as described herein, analyze the similarity between candidate suggestions as well as the popularity of generated sub-topics. The cluster groups and sub-topics may be displayed visually, and in certain embodiments the cluster groups are ordered vertically from top to bottom and aligned to the left side of the display, while sub-topics are ordered horizontally from left to right following the cluster label.

INTERLEAVED EXECUTION INFRASTRUCTURE IN DATABASE ENGINES

Interleaved infrastructure can interleave fragment execution during query compilation. For example, compilation can be paused, and a plan fragment is executed. The results of the plan fragment can be fed back into the compiler, which can then restart the compilation and modify the compilation based on the results of the plan fragment execution. The interleaved workflow provides a flexible, robust infrastructure, which can enable and improve a variety of database features and query optimizations.

METHOD, SYSTEM, AND APPARATUS FOR PERFORMING FLOW-BASED PROCESSING USING STORED PROCEDURE
20190057130 · 2019-02-21 ·

Disclosed is a method for a hub module to perform flow-based processing, which includes: receiving a flow including at least one task; a stored procedure generation allowance step for allowing a DBMS module to generate a stored procedure based on the flow when the received flow is not a previously processed flow, wherein the stored procedure includes at least one of a flow query, meta information, and exception handling information, and the meta information includes execution time of the flow query, execution results, and user information; and a stored procedure call allowance step for allowing the DBMS module to call the stored procedure corresponding to a previously processed flow when the received flow is the previously processed flow.

Query Method and Query Device
20190042621 · 2019-02-07 ·

A query method and a query device, where the method includes determining N execution plans respectively corresponding to N query requests according to the received N query requests, determining at least two same first sub-plans, generating a first sub-query result corresponding to any one of the at least two same first sub-plans, and in a process of generating, according to the N query requests, a query result corresponding to each of the N query requests, the same first sub-query result corresponding to any one of the first sub-plans is used for all the same first sub-plans. Hence, a large amount of repeated calculation can be reduced, database system resources are reduced, and query efficiency and a throughput of a database system in a large-scale concurrent query application scenario are improved.

DYNAMIC DIAGONAL SEARCH IN DATABASES
20180373759 · 2018-12-27 ·

A query identifier is generated for a query received in a database. The received query identifier is matched with query identifiers stored in a dynamic table. It is determined whether an execution plan is available based on matching the query identifiers in the dynamic table. For the matching query identifier, it is determined whether dynamic search criteria are met. Upon determining that the dynamic search criteria are met, a memory address corresponding to the query identifier is retrieved from the dynamic table. Based on the available diagonal search execution plan, the dynamic diagonal search is performed in the table from the memory address to retrieve search result. The dynamic diagonal search involves incrementing a data pointer to access the memory address in a diagonal manner in the table.

ACTION QUEUE FOR HIERARCHY MAINTENANCE
20180349428 · 2018-12-06 ·

A system includes reception of a first instruction at a first system to effect a first change to a hierarchy data model, storage of a first record including first values specifying the first change in a local memory of the first system, reception of a second instruction to effect a second change to the hierarchy data model, storage of a second record including second values specifying the second change in the local memory of the first computer system, reception of an instruction to save the changed hierarchy data model, and, in response to the instruction, transmit the first record and the second record to a second system. The first record and the second record are received and merged to generate a third record including third values specifying a third change to the hierarchy data model, and a query language statement is generated to effect the third change to the hierarchy data model based on the third record.

Using synthetic events to identify complex relation lookups

An approach is provided in which a knowledge manager analyzes a corpus of documents based upon relations corresponding to entities in a structured resource and constructs a natural language context associated with a set of the relations. The knowledge manager maps the natural language context to a database query and, in turn, invokes the database query when the knowledge manager matches a question to the natural language context.

EXPLICIT DECLARATION OF ASSOCIATIONS TO OPTIMIZE GROUPING OF ELEMENTS BY LARGE DATA OBJECTS

The disclosure generally describes methods, software, and systems, including a method for optimizing queries referencing large object (LOB) information. A structured query language (SQL) query containing an LOB field is identified. LOB replacement information for the LOB field is obtained from a data model. The SQL query is optimized including substituting, using the obtained LOB replacement information, the LOB field with replacement language to create an updated SQL query, and extending the updated SQL query with a join of LOB field language to create an extended SQL query.

Using synthetic events to identify complex relation lookups

An approach is provided in which a knowledge manager analyzes a corpus of documents based upon relations corresponding to entities in a structured resource and constructs a natural language context associated with a set of the relations. The knowledge manager maps the natural language context to a database query and, in turn, invokes the database query when the knowledge manager matches a question to the natural language context.

Database Creation and Collision Reduction

A system, method, and computer-readable medium for proving feedback on database instructions, identifying, for example, existing patterns and providing suggested replacement instructions. This may have the effect of improving the efficiency of instructions used to create and/or manipulate databases. According to some aspects, these and other benefits may be achieved by parsing received instructions into an organizational structure, traversing the organizational structure for known patterns, and suggesting replacement patterns. In implementation, this may be effected by receiving one or more sets of known patterns and corresponding replacement patterns, parsing received instructions, comparing the known patterns with the parsed instructions, and providing suggested replacement patterns based on one or more known patterns matching the parsed instructions. A benefit of may include reducing Cartesian products during the merging of tables.