Efficient Memoization Algorithms for Query Optimization

Name: Efficient Memoization Algorithms for Query Optimization
Brand: Anchor Academic Publishing
SKU: 9783954893362
Price: 15200 HUF
Availability: InStock

Top-Down Join Enumeration through Memoization on the Basis of Hypergraphs

Szerző: Pit Fender

Nyelv:

Kötés: Puha kötésű

Kiadó: Anchor Academic Publishing

Elérhetőség: Beszállítói készleten

Küldés 8-11 napon belül

15 200 Ft

For a DBMS that provides support for a declarative query language like SQL, the query optimizer is a...

Információk a könyvről

Szerző

Pit Fender

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2014

oldal

204

EAN

9783954893362

ISBN

3954893363

Enbook ID

09145854

Kiadó

Anchor Academic Publishing

Súly

272

Méretek

148 x 210 x 12

Teljes leírás

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 book focuses on the top-down join enumeration. In the first part, we present two efficient graph-partitioning algorithms suitable for top-down join enumer- ation. However, as we will see, there are two severe limitations: The proposed algo- rithms can handle only (1) simple (binary) join predicates and (2) inner joins. There- fore, 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 book 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 evalu- ate our joined contributions. As we show, the average compile time improvement in those settings is 100% when compared with the state of the art in bottom-up join enu- meration. Our synthetic workloads show even higher improvement factors.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Efficient Memoization Algorithms for Query Optimization

Top-Down Join Enumeration through Memoization on the Basis of Hypergraphs

Információk a könyvről

Teljes leírás

Érdekelheti

Ordinary Mind as the Way

Eastern European Immigrant Families

Rampolli

Politics of Water

Letters of St Cyprian

Nature Inspired Contraptions

Spellbinder

Position of the Catholic Church in England and Wales

Liquid Crystalline Polymers

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Jak se Vojta ztratil - První čtení

Escolma de poesia galega i-ii (facsimil)

Serbest Zaman - Rekreasyon ve Serbest Zaman Egitimi

Un secret du Docteur Freud

Mit der Flut

Die Nürnberger Lebkuchen

1 - 198 Gvg; Eggvg; Gvgvo

Prozessorientierte qualitative Dienstleistungsforschung