Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-01-23
2007-01-23
Kindred, Alford W. (Department: 2163)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C717S114000
Reexamination Certificate
active
10137102
ABSTRACT:
Statements having non-commutative connection conditions are optimized by replacing the non-commutative connection conditions with equivalent expressions that allow for consideration of additional connection orders that would otherwise violate the ordering rules of the non-commutative connection condition. Elements on the right-hand side of a non-commutative connection condition are converted into distinct results elements, thereby allowing the elements to be used on the left-hand side of a commutative connection operator, while preserving accuracy of the statement results set. This increased set of connection orders is evaluated and the execution plan for the optimal connection order is selected.
REFERENCES:
patent: 2004/0039736 (2004-02-01), Kilmer et al.
patent: 2004/0103094 (2004-05-01), Levy et al.
Becker, L. and R.H. Güting “Rule-Based Optimization and Query Processing in an Extensible Geometric Database System”ACM Transactions on Database Systems(Jun. 1992) 17(2):247-303.
Fegaras, L. and D. Maier “Optimizing Object Queries Using an Effective Calculus”ACM Transactions on Database Systems(Dec. 2000) 25(4):457-516.
Galindo-Legaria, C. and A. Rosenthal “Outerjoin Simplification and Reordering for Query Optimization”ACM Transactions on Database Systems(Mar. 1997) 22(1):43-74.
Haas, L.M. et al. “Extensible Query Processing in Starburst” ACM SIGMOD Record, Proceedings of the 1989 ACM SIGMOD Int'l Conference on Management of Data (Jun. 1989) 18(2):377-388.
Lieuwen, D.F. and D.J. DeWitt “A Transformation-Based Approach to Optimizing Loops in Database Programming Language” ACM SIGMOD Record, Proceedings of the 1992 ACM SIGMOD Int'l Conference on Management of Data (Jun. 1992) 21(2):91-100.
Mishra, P. and M.H. Eich “Join Processing in Relational Databases”ACM Computing Surveys(Mar. 1992) 24(1):65-113.
Muralikrishna, M. “Improved Unnesting Algorithms for Join Aggregate SQL Queries” Proceedings of the 18thVLDB Conference, Vancouver, British Columbia, Canada (1992) 91-102.
Seshadri, P. et al. “Cost-Based Optimization for Magic: Algebra and Implementation” ACM SIGMOD Record, Proceedings of the 1996 SIGMOD Int'l Conference on Management of Data (Jun. 1996) 25(2):435-446.
Steinbrunn, M. et al. “Heuristic and randomized optimization for the join ordering problem”The VLDB Journal(Aug. 1997) 6(3):191-208.
Ahmed Rafi
Jakobsson Hakan
Bingham & McCutchen LLP
Kindred Alford W.
Oracle International Corporation
LandOfFree
Systems and methods for increasing allowable join orders in... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and methods for increasing allowable join orders in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for increasing allowable join orders in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3722129