Global optimization of correlated subqueries and exists predicat

Data processing: database and file management or data structures – Database design – Data structure types

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

707 2, G06F 700

Patent

active

057616574

ABSTRACT:
A method of optimizing a query and its subqueries together in a global manner regardless of the nesting levels. All joins in different nesting levels are effectively converted into joins in the same level by assigning a nesting level attribute to relations, assigning properties to the predicate, and assigning nesting level attributes and minimum relation set attributes to join predicate operands. The joins and their predicates are then considered as if they were contained in only the main query according to a set of rules based on the attributes of the relations and the join predicates.

REFERENCES:
patent: 5301317 (1994-04-01), Lohman et al.
patent: 5303383 (1994-04-01), Neches et al.
patent: 5345585 (1994-09-01), Iyer et al.
patent: 5367675 (1994-11-01), Cheng et al.
patent: 5412804 (1995-05-01), Krishna
patent: 5423035 (1995-06-01), DePrez
patent: 5469568 (1995-11-01), Schiefer et al.
patent: 5546576 (1996-08-01), Cochrane et al.
patent: 5548754 (1996-08-01), Pirahesh et al.
patent: 5548755 (1996-08-01), Leung et al.
patent: 5548758 (1996-08-01), Pirahesh et al.
patent: 5557791 (1996-09-01), Cheng et al.
patent: 5619692 (1997-04-01), Malkemus et al.
patent: 5659725 (1997-08-01), Levy et al.
patent: 5671403 (1997-09-01), Shekita et al.
A. Swami, "Distributions of Query Plan Costs for Large Join Queries" IBM 1991; pp. 1-17.
Ioanndies et al., "Randomized Algorithms for Optimizing Large Join Queries", Proceedings of the 1990 ACM SIGMOD Int. Conf. on Mangagment of Data, May 1990, pp. 312-321.
A. Swami et al. "Optimization of Large Join Queries", Ass. for Computing Machinery Special Interest Group on Managment of Data, 1988 Annual Conference, pp. 8-17.
Boral et al., "Optimization of Nonrecursive Queries", Twelth International Conference on Very Large Databases, Aug. 1996, pp. 128-137.
Ibaraki et al., "On the Optimal Nesting Order for Computing N-Relational Joins", ACM Transactions on Databases Systems, vol. 9, No. 3, Sep. 1984, pp. 482-502.
Kim, "On Optimizing an SQL-like Nested Query", ACM Transaction on Databases Systems, vol. 7, No. 3, Sep. 1982, pp. 443-469.
Astrahan et al., "Access Path Selection in a Relational Database Management System" IBM Technical Disclosure Bulletin, vol. 22, No. 4, Sep. 1979, pp. 1657-1660.
Lee et al. "Implicit Joins in the Structural Data Model", IEEE, 1991, pp. 357-364.
Soo et al. "Efficient Evaluation of the Valid-Time Natural Join", IEEE, 1994, pp. 282-292.
Deshpande et al. "The Design and Implementation of a Parallel Join Algorithm for Nested Relations on Shared Memory Multiprocessors", IEEE, 1992, pp. 68-77.
Ramakrishnan et al. "Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs", IEEE, 1994, pp. 501-517.
Hanson "The Design and Implementation of the Ariel Active Database Rule System", IEEE Transactions on Knowledge and Data Engineering, vol. 8, No. 1, Feb. 1996, pp. 157-172.
The YNET: An Interconnect Structure for a Highly Concurrent Data Base Computer System, Dr. Philip M. Neches, 1988, Teradata Corp.
DB2 Concepts, Programming, and Design, Ranade et al., 1991, McGraw-Hill, Inc., ch. 9-10.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Global optimization of correlated subqueries and exists predicat does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Global optimization of correlated subqueries and exists predicat, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Global optimization of correlated subqueries and exists predicat will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1474192

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.