Patent classifications
G06F16/2453
RESOURCE PROVISIONING SYSTEMS AND METHODS
A method for a first set of processors and a second set of processors comprises, the first set of processors processing a set of queries, as a result of a change in utilization of the first set of processors, processing the set of queries using the second set of processors. The change in processors is independent of a change in storage resources, the storage resources shared by the first set of processors and the second set of processors.
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.
Generating proactive audiovisual queries using virtual assistant software applications
Methods and systems for presenting a proactive audiovisual query using a virtual assistant software application. The methods correspond to retrieving user experience data associated with a user profile for the virtual assistant software application, wherein the user experience data define one or more user experience events for the user profile. The methods further include retrieving subject matter domain data associated with the one or more user experience events, wherein the subject matter domain data define one or more probabilistic event effects for the one or more user experience events and determining, based on the user experience data and the subject matter domain data, one or more optimal query items, wherein the one or more optimal query items are associated with at least one of the one or more probabilistic event effects. The methods further include generating the proactive audiovisual query in accordance with the one or more optimal query items.
Method and system for implementing subscription barriers in a distributed computation system
Embodiments of the invention relate to a method for managing subscriptions. The method includes initiating execution of a first subscription, in response to the initiating, obtaining a first subscription barrier associated with a first subscription, making, using the first subscription barrier, a first determination to block execution of a first query request associated with the first subscription, and in response to the first determination, ceasing execution of the first subscription.
Method and system for implementing subscription barriers in a distributed computation system
Embodiments of the invention relate to a method for managing subscriptions. The method includes initiating execution of a first subscription, in response to the initiating, obtaining a first subscription barrier associated with a first subscription, making, using the first subscription barrier, a first determination to block execution of a first query request associated with the first subscription, and in response to the first determination, ceasing execution of the first subscription.
System of visualizing and querying data using data-pearls
A system and method for visualizing and querying high dimensional data to a user. The system includes a user device, a data-pearls visualization and querying server. The server obtains the high dimensional data from the user device associated with user. The server generates data clusters and sub-divides the data clusters into non-overlapping subsets of data-pearls using a clustering technique. The server selects a shape for each data-pearl by comparing a distance between centroid of a data-pearl and a farthest point from a determined centroid using L.sub.p norm distance measures. The server configures each data-pearl in a three-dimensional plot. The server enables the user to visualize the data-pearls on a screen of the user device. The server queries data based on a query using data dimension technique. The server dimensions data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.
Implementing linear algebra functions via decentralized execution of query operator flows
A method for execution by a query processing system includes determining a query request that indicates a plurality of operators, where the plurality of operators includes at least one relational algebra operator and further includes at least one non-relational operator. A query operator execution flow is generated from the query request that indicates a serialized ordering of the plurality of operators. A query resultant of the query is generated by facilitating execution of the query via a set of nodes of a database system that each perform a plurality of operator executions in accordance with the query operator execution flow, where a subset of the set of nodes each execute at least one operator execution corresponding to the at least one non-relational operator in accordance with the execution of the query.
Columnar techniques for big metadata management
A method for managing big metadata using columnar techniques includes receiving a query request requesting data blocks from a data table that match query parameters. The data table is associated with system tables that each includes metadata for a corresponding data block of the data table. The method includes generating, based on the query request, a system query to return a subset of rows that correspond to the data blocks that match the query parameters. The method further includes generating, based on the query request and the system query, a final query to return a subset of data blocks from the data table corresponding to the subset of rows. The method also includes determining whether any of the data blocks in the subset of data blocks match the query parameters, and returning the matching data blocks when one or more data blocks match the query parameters.
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.
Robustness metrics for optimization of query execution plans
A method may include responding to a query to retrieve data from a database by identifying a plurality of query execution plans. An overall robustness value may be determined for each query execution plan. The overall robustness value of a query execution plan may correspond to a sum of individual robustness values for each operator included in the query execution plan. Each operator may have an individual robustness value that corresponds to a first change in a total cost of a query execution plan including the operator relative to a second change in an output cardinality of the operator. One of the plurality of query execution plans may be selected based on the overall robustness value of each of the plurality of query execution plans. The query may be executed by performing a sequence of operators included in the selected one of the plurality of query execution plan.