你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Efficient Memoization Algorithms for Query Optimization: Top-Down Join Enumeration Through Memoization on the Basis of Hypergraphs
Type
Physical Book
Publisher
Author
Language
English
Pages
204
Format
Paperback
ISBN13
9783954893362

Efficient Memoization Algorithms for Query Optimization: Top-Down Join Enumeration Through Memoization on the Basis of Hypergraphs

Pit Fender (Author) · Anchor Academic Publishing · Paperback

Efficient Memoization Algorithms for Query Optimization: Top-Down Join Enumeration Through Memoization on the Basis of Hypergraphs - Pit Fender

Cheaper New Book Imported to Taiwan
Delivery: 24 Sep - 02 Oct Shipping: 13 to 14 business days.
NT$ 1,732
Faster New Book Imported to Taiwan
Delivery: 11 Sep - 21 Sep Shipping: 4 to 5 business days.
NT$ 4,942
NT$ 1,732

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Efficient Memoization Algorithms for Query Optimization: Top-Down Join Enumeration Through Memoization on the Basis of Hypergraphs"

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 ist 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. 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 book discusses the two branch-and-bound prunin

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews