Load balancing for complex database query plans

Data processing: database and file management or data structures – Database and file access – Query optimization

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S714000, C707S718000

Reexamination Certificate

active

07849073

ABSTRACT:
Methods, systems, and apparatuses for improving performance of parallel database query plans are described. An exchange operator is positioned in a query tree. A child operator of the exchange operator is parallelized into a plurality of parallel child operators, each of the parallel child operators coupled to the exchange operator in a respective branch of a plurality of parallel branches of the query tree. An output of each of the plurality of parallel child operators may be buffered at the exchange operator. Furthermore, child operators of the plurality of parallel child operators may also be parallelized. Query plans of any form and containing any number of operators may be parallelized in this manner. Any number of parallel branches may be used, independent of the number of operators in the original plan. The parallelized query plans achieve effective load balancing across all branches.

REFERENCES:
patent: 5241648 (1993-08-01), Cheng et al.
patent: 5692174 (1997-11-01), Bireley et al.
patent: 6311265 (2001-10-01), Beckerle et al.
patent: 6392497 (2002-05-01), Takikawa
patent: 6430550 (2002-08-01), Leo et al.
patent: 6516310 (2003-02-01), Paulley
patent: 6694310 (2004-02-01), Yu et al.
patent: 6704724 (2004-03-01), Ellmann et al.
patent: 6807546 (2004-10-01), Young-Lai
patent: 2003/0229640 (2003-12-01), Carlson et al.
patent: 2006/0080285 (2006-04-01), Chowdhuri
“Topaz: a Cost-based, Rule-Driven, Multi-phase Parallelizer,” by Nippl and Mitschang. IN: Proceedings of the 24th VLDB Conference (1998). Available at: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.38.4657&rep=rep1&type=pdf Last visited: Apr. 28, 2010.
“Organization of Parallel Query Processing in Multiprocessor Database Machines with Hierarchical Architecture,” by Sokolinsky. IN: Journal of Programming and Computer Software (2001). Available at SpringerLink.
“Loading Databases Using Dataflow Parallelism,” by Barclay et al. IN: ACM SIGMOD (1994). Available at: ACM.
“Optimization of Parallel Query Execution Plans in XPRS,” by Hong and Stonebraker. IN: Distributed and Parallel Databases, vol. 1, No. 1, pp. 9-32 (1993). Available at: SpringerLink.
DeWitt, David J. and Gray, Jim, “Parallel Database Systems: The Future of High Performance Database Processing,” Jan. 1992, (appeared in Communication of the ACM, vol. 36, No. 6, Jun. 1992) pp. 1-26.
Graefe, Goetz, “acm computing surveys: Query Evaluation Techniques for Large Databases”, acm Press, vol. 25, No. 2, Jun. 1993, pp. 73-170.
Graefe, Goetz, “Volcano—An Extensible and Parallel Query Evaluation System”, IEEE Transactions on Knowledge and Data Engineering, vol. 6, No. 1, Feb. 1994, pp. 120-135.
Graefe, Goetz, “Encapsulation of Parallelism in the Volcano Query Processing System”, Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, May 23-25, 1990; pp. 102-111.
Graefe, Goetz and Davison, Diane L., “Encapsulation of Parallelism and Architecture-Independence in Extensible Database Query Execution”, IEEE Transactions on Software Engineering, vol. 19, No. 8, Aug. 1993, pp. 749-764.

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

Load balancing for complex database query plans does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Load balancing for complex database query plans, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Load balancing for complex database query plans will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4217344

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