Verwandte Artikel zu Query Processing in a Symmetric Parallel Environment...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 18,55
EUR 0,83 für den Versand von USA nach Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Query Processing in a Symmetric Parallel Environment...
Beispielbild für diese ISBN
Query Processing in a Symmetric Parallel Environment Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332092970
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Query Processing in a Symmetric Parallel Environment Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332092970
Anzahl: 15 verfügbar
Foto des Verkäufers
Query Processing in a Symmetric Parallel Environment (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781332092970_0
Anzahl: Mehr als 20 verfügbar