G06F16/24545

GENERATING MINIMUM QUERY COST COMPLIANCE DATA FOR QUERY REQUESTS

A method includes determining a query request corresponding to a requesting entity. Query cost data is generated for the query request. Minimum query cost compliance data is generated for the query request based on the query cost data. A query result is for the query request is determined based on execution of the query request against a database system and the query result is transmitted to the requesting entity when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule.

SERVICE GRAPH FOR LOCATION-BASED SEARCHING
20220171820 · 2022-06-02 ·

System and methods are provided for executing queries across multiple services and data sources using a Service Graph. The Service Graph is customizable and trainable using continuous feedback loops among the various components of the Service Graph. The Service Graph is configured to select at least one data source or at least one location service from a plurality heterogeneous data sources and location services, generate an execution strategy for searching the at least one location service or the at least one data source, and provide the results generated as a result of the execution strategy.

INTELLIGENT QUERY PLANNING FOR METRIC GATEWAY

In accordance with some aspects of the present disclosure, an apparatus is disclosed. The apparatus includes a processor and a memory, wherein the memory includes programmed instructions that when executed by the processor, cause the apparatus to receive a request to join a plurality of entity data structures using a first join order, determine a first performance cost of the first join order, determine a second performance cost of a second join order, determine whether the second performance cost is lower than the first performance cost, in response to determining that the second performance cost is lower than or exceeds the first performance cost, select the second join order or the first join order, respectively, join the plurality of entity data structures using the selected join order, and send the joined plurality of entity data structures.

METHOD AND APPARATUS FOR DATABASE MANAGEMENT SYSTEM QUERY PLANNING

The present disclosure provides methods and apparatus for calibrating cost estimator for trustworthy DBMS performance. An aspect of the disclosure provides for a method, which includes generating a plurality of plans for potential execution by a DBMS, each of the plurality of plans being configured to generate a same response to a same specified database query. The method further includes generating, for each plan, a set of probability-cost value pairs, each indicative of an estimated upper cost for said plan and a probability that a cost for said plan will be equal to or less than said estimated upper cost, if and when said plan is executed. The method further includes selecting one of the plurality of plans based at least in part on an evaluation of the sets of probability-cost value pairs for the plurality of plans, and causing the DBMS to execute the selected plan.

Query scheduling based on a query-resource allocation and resource availability
11341131 · 2022-05-24 · ·

Systems and methods are described for scheduling a query for execution. The system receives and parses a query to identify one or more portions of the query. The system determines a resource allocation for each portion of the query, and determines an availability of compute resources for the different portions of the query. Based on the resource allocation and the availability of compute resources, the system schedules the query.

MASK-AUGMENTED INVERTED INDEX

The embodiments disclosed herein are related to a computing system for generating a mask-augmented inverted index. The mask-augmented inverted index is structured to allow phrase query searching while minimizing the amount of computing system processing and memory resources needed to generate the mask-augmented inverted index. In one embodiment, a first token is mapped to a first listing of documents that include the first token. A first mask is included that comprises a probabilistic representation of a set of integers corresponding to one or more locations of the first token in each of the individual documents of the first listing. A second mask is included that comprises a probabilistic representation of a set of integers that indicate a positional relationship between the first token and one or more other tokens in each of the individual documents of the first listing.

Estimating string intersections for database systems
11734275 · 2023-08-22 · ·

Some embodiments provide a non-transitory machine-readable medium stores a program. The program receives a query for data that includes an intersection operation on a first set of strings and a second set of strings. The program further generates a plurality of candidate query execution plans based on the query. The program also determines a plurality of execution costs associated with the plurality of candidate query execution plans. The program further selects a query execution plan from the plurality of candidate query execution plans based on the plurality of execution costs. The program also executes the query execution plan to generate a set of query results for the query.

Constraint data statistics
11734258 · 2023-08-22 · ·

Disclosed herein are system, method, and computer program product embodiments for using a data statistic as a dynamic data integrity constraint. An embodiment operates by defining a data statistic for a column or a set of columns of a partition of a plurality of partitions of a database table. The embodiment creates a constraint data statistics object based on the data statistic. The embodiment receives a query for the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition. The embodiment derives an implied constraint based on the constraint data statistics object. The embodiment processes the query for the partition based on the implied constraint.

Validation of Measurement Data Sets Using Oracle Consensus
20220147774 · 2022-05-12 ·

A method includes obtaining, at a node, a first measurement dataset indicative of at least one first observables of an event, obtaining, at the node, a second measurement dataset indicative of at least one second observables of the event, triggering a comparison between the first measurement dataset and the second measurement dataset, and selectively triggering at least one validation measure for either the first measurement dataset or the second measurement dataset depending on a result of the comparison, where the first measurement dataset is provided by a first measurement device, the second measurement dataset is provided by a second measurement device, and the at least validation measure is implemented at a distributed database.

Generation of optimized logic from a schema

A method includes accessing a schema that specifies relationships among datasets, computations on the datasets, or transformations of the datasets, selecting a dataset from among the datasets, and identifying, from the schema, other datasets that are related to the selected dataset. Attributes of the datasets are identified, and logical data representing the identified attributes and relationships among the attributes is generated. The logical data is provided to a development environment, which provides access to portions of the logical data representing the identified attributes. A specification that specifies at least one of the identified attributes in performing an operation is received from the development environment. Based on the specification and the relationships among the identified attributes represented by the logical data, a computer program is generated to perform the operation by accessing, from storage, at least one dataset having the at least one of the attributes specified in the specification.