Articoli correlati a Query Processing in a Symmetric Parallel Environment...
Sinossi
Excerpt from Query Processing in a Symmetric Parallel Environment
Assume each relation partitioned on A attribute using hash function. Joining S with T first and then R wi requires three repartitionings, since 5 is already partit on A.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 18,78
EUR 1,92 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costi
Risultati della ricerca per Query Processing in a Symmetric Parallel Environment...
Foto dell'editore
Query Processing in a Symmetric Parallel Environment Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332092970
Quantità: 15 disponibili
Foto dell'editore
Query Processing in a Symmetric Parallel Environment Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332092970
Quantità: 15 disponibili
Immagini fornite dal venditore
Query Processing in a Symmetric Parallel Environment (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. Print on Demand. This book addresses query processing in a database machine consisting of 11 nodes connected by high-bandwidth networks, theorizing that symmetric parallel architecture is ideal for high-speed relational query processing. Each node comprises a processor, random access memory, and a slower but much larger memory. To approach optimal speedup on this hardware architecture, relations are partitioned roughly evenly among the processors. The author explores optimizing multi-join queries under this data distribution strategy, where optimization entails minimizing the number of times relations are redistributed during a query. They find that this optimization problem, while NP-complete for general queries, is linear for a subclass of tree queries. This book will intrigue database engineers seeking to accelerate relational query processing, and computer scientists engaged in database theory and algorithm design. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Codice articolo 9781332092970_0
Quantità: Più di 20 disponibili