Optimization of queries using relational algebraic theta-semijoin operator
AssigneeLucent Technologies Inc.
InventorsDivesh Srivastava, Peter J. Stuckey, Sundararajarao Sudarshan
Life of this patent
Estimating the term…
Loading patent…
AssigneeLucent Technologies Inc.
InventorsDivesh Srivastava, Peter J. Stuckey, Sundararajarao Sudarshan
Estimating the term…
A collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator is used to generate relational algebraic expressions equivalent to a computer programming language query. These expressions may be employed as a search space which is utilized by, for example, optimizing software or software that determines the equivalency of queries. Cost formulas for the multiset version of the theta-semijoin operator may be used in computing cost estimates for the generated expressions. Based on these computed cost estimates, the least costly implementation of a complex query is determined. Thus, queries are cost-based optimized on both a local and global basis by use of the relational algebraic theta-semijoin operator.
A method comprising the steps of
The method of claim I wherein said query is a decision support query.
A computer programming language query optimizer comprising
A computer processor programmed to perform method steps for optimizing an SQL query, said method steps comprising
A program storage device embodying a computer program to perform method steps comprising:
A storage device embodying a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator, said rules input to software employing relational algebraic expressions, said expressions responsive to a computer language database query.
A method of optimizing a computer programming language query, the improvement comprising the steps of
A method of retrieving information from a computer database comprising the steps of
A method comprising the steps of
An apparatus for determining equivalence of SQL queries, comprising
A method comprising the steps of
A storage device embodying a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator, said rules input to software employing relational algebraic expressions, said expressions responsive to a computer language database query, said multiset version defined as ##EQU56## where R1 and R2 denote relations, .theta.(t.sub.2) denotes the predicate .theta. with attributes of R.sub.2 replaced by their values from tuple t.sub.2.
A storage device embodying a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator, said rules input to software employing relational algebraic expressions, said expressions responsive to a computer language database query, said rules including rule ##EQU57## where E (with or without subscripts) denotes relational expressions, .theta. (with or without subscripts) denotes predicates, .sub..theta. denotes the .theta.-join operator, and .sub..theta. denotes the .theta.-semijoin operator.
Dependencies are inferred from the claim text.