Patent classifications
G06F16/8365
RUNTIME METRIC ESTIMATIONS FOR FUNCTIONS
In some examples, a system receives function descriptors for different types of functions to be used when processing database queries, each function descriptor of the function descriptors comprising information relating to a respective function of the different types of functions. The system computes, based on a first function descriptor for a first function of the different types of functions, an estimate of a runtime metric associated with execution of the first function for processing a database query.
Automated Query Analysis and Remediation Tool
Aspects of the disclosure relate to an automated query analysis and remediation tool. A computing platform may receive a query for analysis. The computing platform may load an extensible markup language (XML) query execution plan for the received query. In addition, the query execution plan may include a sequence of operations used to access data in a relational database. The computing platform may shred XML data from the query execution plan into relational database tables. The computing platform may identify tuning parameters based on the shredded XML data. Based on the identified tuning parameters and using a machine learning engine, the computing platform may generate an optimized query. The computing platform may cause the optimized query to be displayed on one or more user interfaces.
SYSTEMS AND METHODS FOR GENERATING A CUSTOMIZED GUI
Systems and methods including one or more processors and one or more non-transitory computer-readable storage devices storing computing instructions configured to run on the one or more processors and cause the one or more processors to perform functions comprising determining one or more similar items similar to an item; determining one or more complementary items complementary to both the one or more similar items and the item; applying one or more labels to the one or more complementary items based on a rank of the one or more complementary items; training a predictive algorithm on the one or more labels; receiving a request to generate a customized graphical user interface (GUI) for the item; and coordinating displaying the customized GUI for the item using the predictive algorithm. Other embodiments are disclosed herein.
Summarized logical forms for controlled question answering
Systems, devices, and methods discussed herein provide improved autonomous agent applications that are configured to generate automated answers to a question using summarized logical forms (SLFs). A myriad of techniques may be utilized to manually or automatically generate one or more summarized logical forms for an answer, where the summarized logical form(s) identifies the main entities/informative portions of the answer. Instead of indexing the whole of the answer as in conventional methods, an answer can be indexed using the summarized logical forms. A subsequent query may be matched to the SLF and the answer may be provided in response to the question. By indexing the answer with its informative portions, the speed and accuracy of identifying the answer is improved.
System for accessing a relational database using semantic queries
The invention is a system for integrating data sets organized in one organization type with data sets organized in a second organization type so that data queries submitted to be processed in the manner of the first organization type can be translated into queries usable by the data set in the second data organization type and the results returned to satisfy the first query.
Method and system for querying an XML database
A method is provided for selecting a query execution plan, including: receiving an XML document including a plurality of root nodes and a plurality of leaf nodes; determining root-to-leaf paths based on the plurality of root nodes and the plurality of leaf nodes; generating a prime number for each unique root-to-leaf path; calculating a number of instances in which each prime number appears; generating an XML synopsis based on the prime numbers and the number of instances; determining a comparison between a query tree pattern and the XML synopsis; determining a type of the query tree pattern; calculating for each query tree pattern plan, a selectivity estimate based on the comparison and the type of the query tree pattern; determining an optimal query execution plan based on the selectivity estimate; and selecting the optimal query execution plan for performing a query of the XML document based on the determination.
Database scanning tool for optimizing queries
A query management application provides performing an initial query to retrieve records stored in a database, storing the records as initial query content in a memory, creating a file with a list of commands used during the initial query, initiating a subsequent query to obtain updated information for the records, retrieving the file and applying the list of commands to the subsequent query, performing the subsequent query, and updating the memory with results of the subsequent query.
METHOD AND DATABASE SYSTEM FOR SEQUENTIALLY EXECUTING A QUERY AND METHODS FOR USE THEREIN
A database system operates by facilitating execution of the query upon a plurality of data blocks by performing a plurality of sequential operator execution steps, wherein each of a plurality of sequential operator execution steps includes: determining whether each of the plurality of operators of the query operator execution flow is currently executable at the each of the plurality of sequential operator execution steps; generating a plurality of priority values by calculating a priority value for each of the plurality of operators of the query operator execution flow based on whether the each of the plurality of operators of the query operator execution flow is determined to be currently executable, and further based on the position value of the each of the plurality of operators; identifying one of the plurality of operators with a corresponding most favorable one of the plurality of priority values; facilitating execution of the one of the plurality of operators on a queued set of data blocks of the one of the plurality of operators to generate at least one output data block; identifying a next one of the plurality of operators serially positioned consecutively after the one of the plurality of operators in the query operator execution flow; appending the at least one output data block to another queued set of data blocks of the next one of the plurality of operators; and advancing to a next one of the plurality of sequential operator execution steps.
SYSTEM FOR ACCESSING A RELATIONAL DATABASE USING SEMANTIC QUERIES
The invention is a system for integrating data sets organized in one organization type with data sets organized in a second organization type so that data queries submitted to be processed in the manner of the first organization type can be translated into queries usable by the data set in the second data organization type and the results returned to satisfy the first query.
METHOD AND DATABASE SYSTEM FOR INITIATING EXECUTION OF A QUERY AND METHODS FOR USE THEREIN
A database system operated by: determining a plurality of queries for execution; determining query data for each of the plurality of queries, wherein the query data for the each of the plurality of queries indicates a memory usage estimate, an internal runtime estimate, and an external runtime estimate; initiating execution of a subset of the plurality of queries; generating query initiation data by determining whether to initiate execution of one query of the plurality of queries at a first temporal period, wherein the first temporal period occurs after initiating execution of the subset of the plurality of queries and occurs before the execution of the subset of the plurality of queries is complete, and wherein determining whether to initiate execution of one query of the plurality of queries is based on the query data of the one query; initiating execution of the one query when the query initiation data indicates a determination to initiate execution of the one query in the first temporal period; and generating updated query initiation data by determining whether to initiate execution of one query of the plurality of queries at a second temporal period that is after the first temporal period when the query initiation data indicates a determination to forego initiation of execution the one query in the first temporal period.