Patent application number | Description | Published |
20120047117 | Incremental Maintenance of Immediate Materialized Views with Outerjoins - Methods and systems for using algorithms in relational database management systems (RDBMSs) for incremental maintenance of materialized views with outerjoins are disclosed. The algorithms achieve the following goals with respect to a class of materialized outerjoin views and the performance of update operations: relax the requirement for the existence of the primary key attributes in a select list of the view to only some of the relations (i.e., the relations referenced as a preserved side in an outerjoin); relax null-intolerant property requirements for some predicates used in the view definition (i.e., predicates referencing relations which can be null-supplied by more than one outerjoin); and implement maintenance of outerjoin views by using one update statement (e.g., MERGE, UPDATE, INSERT, or DELETE) per view for each relation referenced in the view. The algorithms allow design and implementation of the incremental maintenance of materialized views with outerjoins to be integrated into an RDBMS. | 02-23-2012 |
20120130988 | Highly Adaptable Query Optimizer Search Space Generation Process - Systems, methods and articles of manufacture for determining at least one algorithm from a pool of algorithms to optimize a query. An embodiment includes building optimization blocks for the subplan, determining the complexity of the subplan based on the optimization blocks and selecting an algorithm from a pool of search space generation algorithms based on complexity of the subplan and characteristics of the selected algorithm, and optimizing the subplan with the selected algorithm. | 05-24-2012 |
20120259840 | SYSTEM AND METHOD FOR ENHANCED QUERY OPTIMIZER SEARCH SPACE ORDERING - In an optimizer within a Relational Database Management System improved ways in which a search space (the universe of possible join combinations) is generated and managed and improved ways in which the elements of a search space are evaluated so that among other things unpromising elements are efficiently dropped (pruned). | 10-11-2012 |
20130138626 | Table Parameterized Functions in Database - Systems, methods and computer program product embodiments for providing table parameterized function (TPF) functionality in a database are disclosed herein. An embodiment includes defining a TPF in a database, wherein the definition of the TPF defines one or more parameters of the TPF, at least one of the parameters being a table parameter. A query is received that operates to call the TPF, wherein the query defines one or more input parameters, the input parameters comprising at least one table input parameter to be used as input for calling the TPF. The query is processed to produce a result, and the result of the query is returned. | 05-30-2013 |
20130212085 | Parallelizing Query Optimization - A system, computer-implemented method, and computer-program product embodiments for generating an access plan. A query optimizer includes an enumeration method which enumerates a plurality of subsets of a query. Each subset in the query has a plurality of partitions. The partitions of each subset are enumerated into enumerated partitions using at least one thread. For each partition, physical access plans are generated, using at least one thread. Physical access plans are generated in parallel with other physical access plans of different partitions and with other enumerating partitions. The number of threads that perform the enumeration and the generation is dynamically adapted according to a pool of threads available during the enumeration of the partitions and the generation of physical access plans, and a complexity of the query. From the generated physical access plans, a final access plan for the query is determined by choosing the most efficient access plan. | 08-15-2013 |
20140214798 | Resource Estimation For A Query Optimization Process - Disclosed herein are system, method, and computer program product embodiments for performing resource estimation for query optimization. An embodiment operates by generating a subplan for which an optimization process may be invoked, predicting performance and resource consumption for optimizing the subplan by measuring similarity between a hypergraph of the subplan and one or more etalon queries having known performance and resource consumption properties, selecting an algorithm for optimizing the subplan from a plurality of optimization algorithms based on the performance and resource consumption properties, and generating an optimized access plan using the selected algorithm. | 07-31-2014 |
20150149441 | Data Statistics in Data Management Systems - A system, computer-implemented method, and a computer-readable storage medium for determining estimations to statistical questions. Data statistics used in evaluating estimations to statistical questions are gathered from multiple sources in a database management system. A statistical question comprising, for example, cardinality estimations is received, wherein the question is posed by different database components, such as query optimizer, or execution engine. Estimation for the statistical question is computed, where the estimation is based on multiple data statistics and without using the data referred to in the question. | 05-28-2015 |
20150370857 | MULTI-DIMENSIONAL DATA STATISTICS - A system, computer-implemented method, and computer-program product embodiments for generating a multi-dimensional histogram. A data statistic object generator creates an initial histogram, determines a cost associated with each bucket of the histogram, sorts the buckets into a queue based on the determined cost and selects one of the buckets to be decomposed based on the determined cost. The cost of the decomposed buckets are then calculated, and the decomposed are buckets are then put back into the queue of histogram buckets for possible further decomposition. | 12-24-2015 |