By Topic

Join sequence optimization in parallel query plans

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Langer, U.J. ; Dept. CS, Rostock Univ., Germany ; Meyer, H.F.

We show an alternative way to optimize join sequences in a shared nothing architecture of the distributed relational DBMS HEAD. The hardware resources are also used for database independent applications in concurrency, for database access. To achieve a better hardware utilization we span a complete search space involving all intermediate shapes between left deep, right deep and bushy trees, but without join sequences including cartesian products. The approach is based on any combinatorial search engine and a complex cost function. The cost function involves the actual load of the processors, the network load, and the memory capacities. The new technique has free access to any join sequence in the whole search space. The approach is not restricted to acyclic join conditions

Published in:

Database and Expert Systems Applications, 1996. Proceedings., Seventh International Workshop on

Date of Conference:

9-10 Sep 1996