Patent classifications
G06F16/24542
OPERATOR MOVEMENT OPTIMIZATION TECHNIQUE FOR PROCEDURES
In some embodiments, a method receives a statement graph for a procedure that is used to access data and determines a set of producer statements and a set of consumer statements in the statement graph. A producer statement produces a variable for a consumer statement, and the consumer statement consumes the variable from the producer statement. The method optimizes the statement graph to generate an optimized procedure by moving an operator from a consumer statement to a producer statement or by moving an operator from a producer statement to a consumer statement. The optimized procedure is output based on the optimized statement graph.
Method, apparatus, device, and storage medium for intention recommendation
The present application discloses a method, an apparatus, a device, and a storage medium for intention recommendation, which relates to the field of big data, artificial intelligence, intelligent search, information flow and deep learning technologies in the field of computer technologies. A specific implementation scheme includes: receiving an intention query request carrying an intention keyword and a user identification, determining a first recommendation list according to the intention keyword and a pre-configured intention repository, where the intention repository includes at least one tree-shaped intention set, and each tree-shaped intention set includes at least one graded intention, processing intentions in the first recommendation list by using intention strategy information corresponding to the user identification to obtain a target recommendation list and output it.
Techniques for unifying ETL filter operators
Techniques are provided for unifying filter operators in exchange, transform, load (ETL) plans. Such a technique includes a method that may include receiving, by a computer system, an ETL plan including a split operator and a plurality of filter operators. The may include identifying, by the computer system, that the plurality of filter operators are configured to act on data output by the split operator in the ETL plan. The method may include generating, by the computer system, a unified filter operator using the plurality of filter operators. The method may include generating, by the computer system, an updated ETL plan comprising the unified filter operator providing filtered data to the split operator. The method may also include storing the updated ETL plan in a data store.
Predicting and halting runaway queries
Operations include halting a runaway query in response to determining that a performance metric of the query exceeds a performance threshold. The runaway query halting system receives a query execution plan associated with a query and divides the received execution plan into one or more components. For each component, the system determines a predicted resource usage associated with executing the component. The system further determines a predicted resource usage associated with the query execution plan based on the predicted resource usage associated with each component. The system executes the query associated with the received query execution plan and compares the predicted resource usage associated with the query to a resource usage threshold. In response to determining that the predicted resource usage of the query execution plan exceeds the resource usage threshold, the system halts execution of the query associated with the query execution plan.
Query plan migration in database systems
Methods, systems, and computer-readable storage media for receiving, by a current database system, a query plan file representative of a captured query plan from a source database system, receiving, by the current database system, a set of definitions including one or more definitions, each definition in the set of definitions corresponding to an object that is implicated by the query plan, the object being included in a set of objects, and determining, by the current database system, that each definition in the set of definitions is identical to a respective definition of a corresponding object within the current database system, and in response: executing the captured query plan in the current database system to provide a query result.
UTILIZING ARRAY FIELD DISTRIBUTION DATA IN DATABASE SYSTEMS
A method includes generating array field distribution data for an array field of a dataset. A query expression for execution that includes a query predicate indicating the array field of the dataset is received. The array field distribution data for the array field is utilized to generate query plan data for the query expression based on the query expression including the query predicate indicating the array field. Execution of the query expression is facilitated in accordance with the query plan data.
Pre-migration detection and resolution of issues in migrating databases systems
Implementations include providing, by a computer-executed migration advisor executing within a run-time of a source database system, a query data set including queries processed by the source database system during production use of the source database system, providing, by the migration advisor, an object data set including data representative of database objects stored within a database of the source database system, generating, by the migration advisor, a list of query-level features and a list of object-level features, each feature in the list of query-level features and each feature in the list of object-level features including a feature that is deprecated in a target database system, resolving one or more issues represented by features of one or more of the list of query-level features and the list of object-level features, and executing migration of the database of the source database system to the database of the target database system.
Selecting between hydration-based scanning and stateless scale-out scanning to improve query performance
When a query is received by a stateful data processing service, the service determines, for each table scan (and associated operations) of a query, whether to select the table scan for execution by a stateless data processing service. The selected table scans are sent to the stateless data processing service for execution, and results are received by the stateful data processing service. The stateful data processing service may also execute other table scans of the query locally, against a local data cache. If the data is not present in the local data cache, then the stateful data processing service will copy the table data into the local data cache before executing the table scan. A query result based on the remote and/or local table scans may then be returned to the client.
Tag-based application of masking policy
Various embodiments provide for tag-based application of a masking policy, which can be used in connection with a data platform. In particular, various embodiments enable enforcement of one or more masking policies against an entity (e.g., object) of a data platform, such as a database, a table, a row, or a column, based on one or more tags associated with the entity.
Trimming blackhole clusters
Disclosed are techniques for trimming large clusters of related records. In one embodiment, a method is disclosed comprising receiving a set of clusters, each cluster in the clusters including a plurality of records. The method extracts an oversized cluster in the set of clusters and performs a breadth-first search (BFS) on the oversized cluster to generate a list of visited records. The method terminates the BFS upon determining that the size of the list of visited records exceeds a maximum size and generates a new cluster from the list of visited records and adding the new cluster to the set of clusters. By recursively performing BFS traverse over the oversized cluster and extracting smaller new clusters from it, the oversized cluster is eventually partitioned into a set of sub-clusters with the size smaller than the predefined threshold.