Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
US$ 20.78
Convert currencyQuantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Seller: Forgotten Books, London, United Kingdom
US$ 17.25
Convert currencyQuantity: Over 20 available
Add to basketPaperback. Condition: 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.