Galindo-Legaria
Cesar Galindo-Legaria, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20140280035 | DISTANCE-BASED LOGICAL EXPLORATION IN A RELATIONAL DATABASE QUERY OPTIMIZER - Systems and methods are described that generate an execution plan for a query in a relational database system. The systems and methods generate the execution plan by generating one or more initial logical representations of the query, performing an exploration process around each of the one or more initial logical representations of the query, the performing of the exploration process around a particular initial logical representation of the query comprising applying transformation rules to generate one or more additional logical representations of the query that are logically equivalent to the particular initial logical representation of the query and that are within a maximum allowable transformation distance of the particular initial logical representation of the query, generating one or more execution plans for each initial logical representation of the query and each additional logical representation of the query, and selecting an execution plan from among the generated execution plans. | 09-18-2014 |
Cesar A. Galindo-Legaria, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20080313131 | PARAMETER-SENSITIVE PLANS FOR STRUCTURAL SCENARIOS - Systems and methods that generate specialized plans for compiling SQL queries. A plan generator component scans the query representation for parameter sensitive predicates and evaluates each predicate individually based on the parameter values. Accordingly, queries can be identified not only based on their structures, but also based on their parameter conditions. The specialized plans are more efficient for particular values, wherein queries that employ such values are optimally executed. | 12-18-2008 |
20090327214 | Query Execution Plans by Compilation-Time Execution - Described is a query optimizer comprising a query tuner that performs actual execution of query fragments to obtain actual results during compilation time, and uses those actual results to select a query plan. The actual results may be combined with estimates for fragments that were not executed. The tree may be traversed in a top-down traversal, processing every node. Alternatively, the tree may be traversed in a bottom-up traversal, re-deriving data for higher nodes as each lower level is completed. A limit, such as a time limit or level limit, may be used to control how much time is taken to determine the execution plan. | 12-31-2009 |
20110167056 | PARAMETER-SENSITIVE PLANS - A query configured according to a query template is received. The query includes values for a plurality of parameters. A key is generated for the query that indicates a selectivity region in a selectivity space determined for the included parameter values. Whether the generated key matches any key of a plurality of keys is determined. Each key of the plurality of keys is associated with a corresponding query plan. If the generated key is determined to not match any of the keys, the query is compiled to generate a new query plan, and the generated query plan is executed with respect to the query. If the key is determined to match any key of the plurality of keys, a query plan associated with the matched key is selected, and the query plan associated with the matched key is executed with respect to the query. | 07-07-2011 |
20150032723 | DATABASE SYSTEM FOR EXECUTING PARAMETER-SENSITIVE QUERY - A query is received. The query comprises a plural number of efficiency expressions. A key is generated for the query indicating a first selectivity region in multi-dimensional selectivity space comprising an array of selectivity regions arranged according to a grid with a number of dimensions equal to the plural number. The generated key is used to look up a stored query plan among a plurality of stored query plans. A stored query plan is executed for the query that is associated with a stored key determined to match the generated key. | 01-29-2015 |
César Alejandro Galindo-Legaria, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20080215544 | Systems and Methods for Modeling Partitioned Tables as Logical Indexes - Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions. | 09-04-2008 |
20100274780 | SYSTEMS AND METHODS FOR MODELING PARTITIONED TABLES AS LOGICAL INDEXES - Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions. | 10-28-2010 |
César Alejandro Galindo-Legaria, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20100274780 | SYSTEMS AND METHODS FOR MODELING PARTITIONED TABLES AS LOGICAL INDEXES - Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions. | 10-28-2010 |