Extending the semantics of the outer join operator for un-nestin

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 3642821, 3642834, G06F 1540

Patent

active

054128048

ABSTRACT:
The semantics of the outer join operator are extended to permit the application of different predicates to the join tuples and the anti-join tuples. For un-nesting of nested query blocks, the anti-join tuples, for example, are associated with a count value of zero instead of a count value of null. An inner query block is un-nested from an outer query block by converting the inner query to a first un-nested query generating a temporary relation and converting the outer query block to a second un-nested query receiving the precomputed temporary relation. When the nested inner query has an equi-join predicate joining a relation of the inner query to an outer query and a count aggregate, the query blocks are un-nested by removing the equi-join predicate from the inner query and placing a corresponding conjunctive (left) outerjoin predicate term in the predicate of the outer query, performing the count aggregate for each distinct value of the joining attribute of the relation of the inner query, and in the outer query applying different predicates to the joining and anti-joining tuples such that the predicate of the anti-joining tuples is evaluated assuming a count value of zero.

REFERENCES:
patent: 4506326 (1985-03-01), Shaw et al.
patent: 4648044 (1987-03-01), Hardy et al.
patent: 4829427 (1989-05-01), Green
patent: 4918593 (1990-04-01), Huber
patent: 4956774 (1990-09-01), Shibamiya et al.
patent: 5276870 (1994-01-01), Shan et al.
R. Epstein, "Techniques for Processing of Aggregates in Relational Database Systems," Memorandum No. UCB/ERL M79/8, Electronics Research Lab., UCLA, Berkeley, Calif. 21 Feb. 1979.
Hobbs and England, Rdb/VMS--A Comprehensive Guide, Digital Equipment Corporation, Maynard, Mass. (1991).
Arnon Rosenthal and Cesar Galindo-Legaria, "Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins," Proc. SIGMOD Conf., Association for Computing Machinery, United States (May 1990), pp. 291-299.
M. Muralikrishna, "Optimization and Dataflow Algorithms for Nested Tree Queries," Proc. VLDB Conf. (Aug. 1989), pp. 77-85.
Ganski & Wong, "Optimization of Nested SQL Queries Revisited," Proc. SIGMOD Conf., Association for Computing Machinery, United States (May 1987), pp. 22-23.
Umeshwar Dayal, "Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates and Quantifiers," Proceedings of the 13 VLDB Conference, Brighton, 1987, pp. 197-208.
C. J. Date, A Guide to The SQL Standard, Addison-Wesley Publishing Company, Menlo Park, Calif., 1987, pp. 7-13, 82-107.
Won Kim, "On Optimizing an SQL-like Nested Query," ACM Transactions on Database Systems, vol. 9, No. 3, Association for Computing Machinery, United States, Sep. 1982, pp. 443-469.
Barr & Feigenbau, Eds., The Handbook of Artificial Intelligence, vol. II, William Kaufmann, Inc., Los Altos, Calif., 1982, pp. 163-173.
Astrahan & Chamberlin, "Implementation of a Structured English Query Language," Communications of the ACM, United States, vol. 18, No. 10, Oct. 1975, pp. 580-588.

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

Extending the semantics of the outer join operator for un-nestin does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Extending the semantics of the outer join operator for un-nestin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extending the semantics of the outer join operator for un-nestin will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1145231

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