As the amount of stored data grows, the relational schemas needed to organize all these data get more complex, increasing the number of relations in the database. As a consequence, it becomes necessary to write SQL queries that involve a large number of relations. Once a SQL query is introduced into the DBMS, the query optimizer must find the most efficient query execution plan to solve it. State-of-the-art query optimizers, which typically employ dynamic programming techniques, are limited in the number of joins they can handle. In these situations, optimizers either resort to heuristics or fall back to greedy algorithms. However, greedy algorithms do not consider the entire search space and thus may overlook the optimal plan, resulting in bad query performance. In this book, we present a query optimizer based on genetic programming algorithms. We compare the results yielded by our optimizer with those yielded by the UDB DB2 optimizer, as well as some of the most efficient randomized algorithms proposed in the literature. Our studies show that the larger the number of relations involved in the query, the larger the benefit obtained by this type of optimizers.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Victor Muntés Mulero is an associate professor at the Universitat Politècnica de Catalunya. He obtained his PhD in 2007. Through his collaboration with the IBM Center for Advanced Studies in Toronto, he designed a query optimizer based on genetic algorithms. He is the author of more than 30 papers and patents related to efficient data management.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -As the amount of stored data grows, the relational schemas needed to organize all these data get more complex, increasing the number of relations in the database. As a consequence, it becomes necessary to write SQL queries that involve a large number of relations. Once a SQL query is introduced into the DBMS, the query optimizer must find the most efficient query execution plan to solve it. State-of-the-art query optimizers, which typically employ dynamic programming techniques, are limited in the number of joins they can handle. In these situations, optimizers either resort to heuristics or fall back to greedy algorithms. However, greedy algorithms do not consider the entire search space and thus may overlook the optimal plan, resulting in bad query performance. In this book, we present a query optimizer based on genetic programming algorithms. We compare the results yielded by our optimizer with those yielded by the UDB DB2 optimizer, as well as some of the most efficient randomized algorithms proposed in the literature. Our studies show that the larger the number of relations involved in the query, the larger the benefit obtained by this type of optimizers. 236 pp. Englisch. Codice articolo 9783843391757
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: New. Codice articolo 5468994
Quantità: Più di 20 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Genetic Query Optimization for Large Databases | On the Use of Evolutionary Strategies for Very Large Join Queries | Victor Muntés-Mulero | Taschenbuch | 236 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783843391757 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Codice articolo 107140342
Quantità: 5 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -As the amount of stored data grows, the relational schemas needed to organize all these data get more complex, increasing the number of relations in the database. As a consequence, it becomes necessary to write SQL queries that involve a large number of relations. Once a SQL query is introduced into the DBMS, the query optimizer must find the most efficient query execution plan to solve it. State-of-the-art query optimizers, which typically employ dynamic programming techniques, are limited in the number of joins they can handle. In these situations, optimizers either resort to heuristics or fall back to greedy algorithms. However, greedy algorithms do not consider the entire search space and thus may overlook the optimal plan, resulting in bad query performance. In this book, we present a query optimizer based on genetic programming algorithms. We compare the results yielded by our optimizer with those yielded by the UDB DB2 optimizer, as well as some of the most efficient randomized algorithms proposed in the literature. Our studies show that the larger the number of relations involved in the query, the larger the benefit obtained by this type of optimizers.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 236 pp. Englisch. Codice articolo 9783843391757
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - As the amount of stored data grows, the relational schemas needed to organize all these data get more complex, increasing the number of relations in the database. As a consequence, it becomes necessary to write SQL queries that involve a large number of relations. Once a SQL query is introduced into the DBMS, the query optimizer must find the most efficient query execution plan to solve it. State-of-the-art query optimizers, which typically employ dynamic programming techniques, are limited in the number of joins they can handle. In these situations, optimizers either resort to heuristics or fall back to greedy algorithms. However, greedy algorithms do not consider the entire search space and thus may overlook the optimal plan, resulting in bad query performance. In this book, we present a query optimizer based on genetic programming algorithms. We compare the results yielded by our optimizer with those yielded by the UDB DB2 optimizer, as well as some of the most efficient randomized algorithms proposed in the literature. Our studies show that the larger the number of relations involved in the query, the larger the benefit obtained by this type of optimizers. Codice articolo 9783843391757
Quantità: 1 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Codice articolo ERICA79038433917506
Quantità: 1 disponibili