Simplification of SQL queries using generalized inference propag

Details Simplification of SQL queries using generalized inference propag Simplification of SQL queries using generalized inference propag

1997-07-31

1998-12-29

Amsbury, Wayne

Data processing: database and file management or data structures

Database design

Data structure types

G06F 1730

Patent

active

058550127

ABSTRACT:
A method and apparatus for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations.

REFERENCES:
patent: 4769772 (1988-09-01), Dwyer
patent: 4829427 (1989-05-01), Green
patent: 5091852 (1992-02-01), Tsunchida et al.
patent: 5367675 (1994-11-01), Cheng et al.
Date, C.J., "The Outer Join", Proceedings of the Second International Conference on Databases, Cambridge, England, Sep. 1983, pp. 76-106.
Dayal, U., et al., "An Extended Relational Algebra With Control Over Duplicate Elimination", Proc. ACM Podds, pp. 117-123, 1982.
Dayal, Umeshwar, "Processing Queries with Quantifiers: A Horticultural Aproach", Proc. ACM Pods, pp. 125-136, 1983.
Dayal, Umeshwar, "Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers", VLDB, pp. 197-208, 1987.
Galindo-Legaria, C., and Rosenthal, A., "How to Extend a Conventional Optimizer to Handle One and Two-Sided Outerjoin", IEEE Proceedings of Data Engineering, pp. 402-409, 1992.
Galindo, Legaria, C.A., "Algebraic Optimization of Outerjoin Queries", Ph.D. Dissertation, Center for Research in Computing Technology, Harvard University, Cambridge, MA, 1992.
Pirahesh, H., et al., "Extensible/Rule Based Query Rewrite Optimization in Starburst", ACM SIGMOD, pp. 39-48, San Diego, CA, Jun. 1992.
Rosenthal, A. and Galindo-Legaria, C., "Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins", ACM SIGMOD, pp. 291-299, 1990.
Apers, P.M.G., et al., "Optimization Algorithms for Distributed Queries", IEEE Transactions on Software Engineering, SE-9, pp. 57-68, Jan. 1983.
Alon Levy, et al., "Query Optimization by Predicate Move-Around", Proceedings of the 20th VLDB Conference, Santiago, Chile, Sep. 1994.
Paulley, G.N. and Per-Ake Larson, "Exploiting Uniqueness in Query Optimization", CASCON, pp. 804-822, vol. II, Oct. 1993.
Lafortune, S. and Wong, E., "A State Transition Model for Distributed Query Processing", ACM Transactions on Database Systems, vol. II No. 3, pp. 294-322, Sep. 1986.
Lohman, G.M., et al., Research Report, "Query Processing in R*", Res. Rep. RJ 4272, IBM Research Laboratory, San Jose, California, Apr. 1984.
Selinger, P.G., et al., "Access Path Selection in a Relational Database Management System", IBM Research Division, San Jose, California, ACM SIGMOD, pp. 23-34, 1979.
Kim, Won, IBM Research "On Optimizing an SQL-Like Nested Query", ACM Transactions on Database Systems, vol. 7, No. 3, Sep. 1982, pp. 443-469.
Ganski et al., "Optimization of Nested SQL Queries Revisted", ACM, 1987, pp. 23-33.
Haas et al., "Extensible Query Processing in Starburst", IBM Almaden Research Center, San Jose, California (US), ACM 1989, pp. 377-388.
Date, C.J. and Darwen, Hugh, "Relational Database Management", Relational Database Writings 1989-1991, Part II, pp. 133-154.

Affiliated with

Also associated with

Rating

Simplification of SQL queries using generalized inference propag does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Simplification of SQL queries using generalized inference propag, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplification of SQL queries using generalized inference propag will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1430772