Stock Image

Algorithms for Efficient Top-Down Join Enumeration

Pit Fender

0 ratings by Goodreads
ISBN 10: 3656663424 / ISBN 13: 9783656663423
Published by GRIN Verlag Gmbh Jun 2014, 2014
New Condition: Neu Soft cover
From Agrios-Buch (Bergisch Gladbach, Germany)

AbeBooks Seller Since 11 January 2012

Quantity Available: 1
Buy New
Price: £ 42.49 Convert Currency
Shipping: £ 8.88 From Germany to United Kingdom Destination, Rates & Speeds
Add to basket

About this Item

Neuware - Doctoral Thesis / Dissertation from the year 2014 in the subject Computer Science - Applied, grade: summa cum laude, University of Mannheim (School of Business Informatics and Mathematics), course: Databases, language: English, abstract: For a DBMS that provides support for a declarative query language like SQL, the query optimizer is a crucial piece of software. The declarative nature of a query allows it to be translated into many equivalent evaluation plans. The process of choosing a suitable plan from all alternatives is known as query optimization. The basis of this choice are a cost model and statistics over the data. Essential for the costs of a plan is the execution order of join operations in its operator tree, since the runtime of plans with different join orders can vary by several orders of magnitude. An exhaustive search for an optimal solution over all possible operator trees is computationally infeasible. To decrease complexity, the search space must be restricted. Therefore, a well-accepted heuristic is applied: All possible bushy join trees are considered, while cross products are excluded from the search. There are two efficient approaches to identify the best plan: bottom-up and top-down join enumeration. But only the top-down approach allows for branch-and-bound pruning, which can improve compile time by several orders of magnitude, while still preserving optimality. Hence, this thesis focuses on the top-down join enumeration. In the first part, we present two efficient graph-partitioning algorithms suitable for top-down join enumeration. However, as we will see, there are two severe limitations: The proposed algorithms can handle only (1) simple (binary) join predicates and (2) inner joins. Therefore, the second part adopts one of the proposed partitioning strategies to overcome those limitations. Furthermore, we propose a more generic partitioning framework that enables every graph-partitioning algorithm to handle join predicates involving more than two relations, and outer joins as well as other non-inner joins. As we will see, our framework is more efficient than the adopted graph-partitioning algorithm. The third part of this thesis discusses the two branch-and-bound pruning strategies that can be found in the literature. We present seven advancements to the combined strategy that improve pruning (1) in terms of effectiveness, (2) in terms of robustness and (3), most importantly, avoid the worst-case behavior otherwise observed. Different experiments evaluate the performance improvements of our proposed methods. We use the TPC-H, TPC-DS and SQLite test suite benchmarks to evaluate our joined contributions. 208 pp. Englisch. Bookseller Inventory # 9783656663423

Ask Seller a Question

Bibliographic Details

Title: Algorithms for Efficient Top-Down Join ...

Publisher: GRIN Verlag Gmbh Jun 2014

Publication Date: 2014

Binding: Taschenbuch

Book Condition:Neu

About this title

Synopsis:

Doctoral Thesis / Dissertation from the year 2014 in the subject Computer Science - Applied, grade: summa cum laude, University of Mannheim (School of Business Informatics and Mathematics), course: Databases, language: English, abstract: For a DBMS that provides support for a declarative query language like SQL, the query optimizer is a crucial piece of software. The declarative nature of a query allows it to be translated into many equivalent evaluation plans. The process of choosing a suitable plan from all alternatives is known as query optimization. The basis of this choice are a cost model and statistics over the data. Essential for the costs of a plan is the execution order of join operations in its operator tree, since the runtime of plans with different join orders can vary by several orders of magnitude. An exhaustive search for an optimal solution over all possible operator trees is computationally infeasible. To decrease complexity, the search space must be restricted. Therefore, a well-accepted heuristic is applied: All possible bushy join trees are considered, while cross products are excluded from the search. There are two efficient approaches to identify the best plan: bottom-up and top-down join enumeration. But only the top-down approach allows for branch-and-bound pruning, which can improve compile time by several orders of magnitude, while still preserving optimality. Hence, this thesis focuses on the top-down join enumeration. In the first part, we present two efficient graph-partitioning algorithms suitable for top-down join enumeration. However, as we will see, there are two severe limitations: The proposed algorithms can handle only (1) simple (binary) join predicates and (2) inner joins. Therefore, the second part adopts one of the proposed partitioning strategies to overcome those limitations. Furthermore, we propose a more generic partitioning framework that enables every graph-partitioning algorithm to handle join predicates involving more

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Terms of Sale:

Allgemeine Geschäftsbedingungen (abebooks.de)

der Firma Agrios Buch- und Medienversand UG e.K. ,Geschäftsführer Ludwig Meier, De-Gasperi-Str. 8, 51469 Bergisch Gladbach nachstehend als Verkäufer bezeichnet.

§ 1 Allgemeines, Begriffsbestimmungen

(1) Der Verkäufer bietet unter dem Nutzernamen Agrios Buch unter der Plattform abebooks.de insbesondere Bücher an. Die folgenden Allgemeinen Geschäftsbedingungen (AGB) gelten für die Geschäftsbeziehung zwischen dem Verkäufer und dem Kunden in ihrer zum Ze...

More Information
Shipping Terms:

Der Versand ins Ausland findet IMMER mit DHL statt. Auch nach Österreich verschicken wir nur mit DHL! Daher Standardversand == Luftpost!


Detailed Seller Information

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express

Check PayPal Invoice Bank/Wire Transfer