Efficient Memoization Algorithms for Query Optimization: Top-Down Join Enumeration through Memoization on the Basis of Hypergraphs formatIsbn:Softcover - 9783954893362 Dynamic complexity results from hidden

Dynamic complexity results from hidden

000 Jahren

Testez vos connaissances sur Dix Petits Nègres d'Agatha Christie

wie die grundlegenden Einstellungen auf der Ebene des Bildungsmanagements

Einleitung und Überblick13

Efficient Memoization Algorithms for Query Optimization: Top-Down Join Enumeration through Memoization on the Basis of Hypergraphs formatIsbn:Softcover - 9783954893362 Dynamic complexity results from hiddenFor 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