{"product_id":"high-performance-parallel-database-processing-and-grid-databases-hardback-9780470107621","title":"High-Performance Parallel Database Processing and Grid Databases (Hardback) 9780470107621","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eHigh-Performance Parallel Database Processing and Grid Databases\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eDavid Taniar (Author), Clement H. C. Leung (Author), Wenny Rahayu (Author), Sushant Goel (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780470107621, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 31 October 2008\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e576 pages, Drawings: 143 B\u0026amp;W, 0 Color\u003cbr\u003e23.9 x 15.8 x 3 cm, 0.907 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cb\u003eThe latest techniques and principles of parallel and grid database processing\u003c\/b\u003e  \u003cp\u003eThe growth in grid databases, coupled with the utility of parallel query processing, presents an important opportunity to understand and utilize high-performance parallel database processing within a major database management system (DBMS). This important new book provides readers with a fundamental understanding of parallelism in data-intensive applications, and demonstrates how to develop faster capabilities to support them. It presents a balanced treatment of the theoretical and practical aspects of high-performance databases to demonstrate how parallel query is executed in a DBMS, including concepts, algorithms, analytical models, and grid transactions.\u003c\/p\u003e \u003cp\u003e\u003ci\u003eHigh-Performance Parallel Database Processing and Grid Databases\u003c\/i\u003e serves as a valuable resource for researchers working in parallel databases and for practitioners interested in building a high-performance database. It is also a much-needed, self-contained textbook for database courses at the advanced undergraduate and graduate levels.\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003ePreface xv\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart I Introduction\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1. Introduction 3\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1. A Brief Overview: Parallel Databases and Grid Databases 4\u003c\/p\u003e \u003cp\u003e1.2. Parallel Query Processing: Motivations 5\u003c\/p\u003e \u003cp\u003e1.3. Parallel Query Processing: Objectives 7\u003c\/p\u003e \u003cp\u003e1.3.1. Speed Up 7\u003c\/p\u003e \u003cp\u003e1.3.2. Scale Up 8\u003c\/p\u003e \u003cp\u003e1.3.3. Parallel Obstacles 10\u003c\/p\u003e \u003cp\u003e1.4. Forms of Parallelism 12\u003c\/p\u003e \u003cp\u003e1.4.1. Interquery Parallelism 13\u003c\/p\u003e \u003cp\u003e1.4.2. Intraquery Parallelism 14\u003c\/p\u003e \u003cp\u003e1.4.3. Intraoperation Parallelism 15\u003c\/p\u003e \u003cp\u003e1.4.4. Interoperation Parallelism 15\u003c\/p\u003e \u003cp\u003e1.4.5. Mixed Parallelism—A More Practical Solution 18\u003c\/p\u003e \u003cp\u003e1.5. Parallel Database Architectures 19\u003c\/p\u003e \u003cp\u003e1.5.1. Shared-Memory and Shared-Disk Architectures 20\u003c\/p\u003e \u003cp\u003e1.5.2. Shared-Nothing Architecture 22\u003c\/p\u003e \u003cp\u003e1.5.3. Shared-Something Architecture 23\u003c\/p\u003e \u003cp\u003e1.5.4. Interconnection Networks 24\u003c\/p\u003e \u003cp\u003e1.6. Grid Database Architecture 26\u003c\/p\u003e \u003cp\u003e1.7. Structure of this Book 29\u003c\/p\u003e \u003cp\u003e1.8. Summary 30\u003c\/p\u003e \u003cp\u003e1.9. Bibliographical Notes 30\u003c\/p\u003e \u003cp\u003e1.10. Exercises 31\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2. Analytical Models 33\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1. Cost Models 33\u003c\/p\u003e \u003cp\u003e2.2. Cost Notations 34\u003c\/p\u003e \u003cp\u003e2.2.1. Data Parameters 34\u003c\/p\u003e \u003cp\u003e2.2.2. Systems Parameters 36\u003c\/p\u003e \u003cp\u003e2.2.3. Query Parameters 37\u003c\/p\u003e \u003cp\u003e2.2.4. Time Unit Costs 37\u003c\/p\u003e \u003cp\u003e2.2.5. Communication Costs 38\u003c\/p\u003e \u003cp\u003e2.3. Skew Model 39\u003c\/p\u003e \u003cp\u003e2.4. Basic Operations in Parallel Databases 43\u003c\/p\u003e \u003cp\u003e2.4.1. Disk Operations 44\u003c\/p\u003e \u003cp\u003e2.4.2. Main Memory Operations 45\u003c\/p\u003e \u003cp\u003e2.4.3. Data Computation and Data Distribution 45\u003c\/p\u003e \u003cp\u003e2.5. Summary 47\u003c\/p\u003e \u003cp\u003e2.6. Bibliographical Notes 47\u003c\/p\u003e \u003cp\u003e2.7. Exercises 47\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart II Basic Query Parallelism\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3. Parallel Search 51\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1. Search Queries 51\u003c\/p\u003e \u003cp\u003e3.1.1. Exact-Match Search 52\u003c\/p\u003e \u003cp\u003e3.1.2. Range Search Query 53\u003c\/p\u003e \u003cp\u003e3.1.3. Multiattribute Search Query 54\u003c\/p\u003e \u003cp\u003e3.2. Data Partitioning 54\u003c\/p\u003e \u003cp\u003e3.2.1. Basic Data Partitioning 55\u003c\/p\u003e \u003cp\u003e3.2.2. Complex Data Partitioning 60\u003c\/p\u003e \u003cp\u003e3.3. Search Algorithms 69\u003c\/p\u003e \u003cp\u003e3.3.1. Serial Search Algorithms 69\u003c\/p\u003e \u003cp\u003e3.3.2. Parallel Search Algorithms 73\u003c\/p\u003e \u003cp\u003e3.4. Summary 74\u003c\/p\u003e \u003cp\u003e3.5. Bibliographical Notes 75\u003c\/p\u003e \u003cp\u003e3.6. Exercises 75\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4. Parallel Sort and GroupBy 77\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1. Sorting, Duplicate Removal, and Aggregate Queries 78\u003c\/p\u003e \u003cp\u003e4.1.1. Sorting and Duplicate Removal 78\u003c\/p\u003e \u003cp\u003e4.1.2. Scalar Aggregate 79\u003c\/p\u003e \u003cp\u003e4.1.3. GroupBy 80\u003c\/p\u003e \u003cp\u003e4.2. Serial External Sorting Method 80\u003c\/p\u003e \u003cp\u003e4.3. Algorithms for Parallel External Sort 83\u003c\/p\u003e \u003cp\u003e4.3.1. Parallel Merge-All Sort 83\u003c\/p\u003e \u003cp\u003e4.3.2. Parallel Binary-Merge Sort 85\u003c\/p\u003e \u003cp\u003e4.3.3. Parallel Redistribution Binary-Merge Sort 86\u003c\/p\u003e \u003cp\u003e4.3.4. Parallel Redistribution Merge-All Sort 88\u003c\/p\u003e \u003cp\u003e4.3.5. Parallel Partitioned Sort 90\u003c\/p\u003e \u003cp\u003e4.4. Parallel Algorithms for GroupBy Queries 92\u003c\/p\u003e \u003cp\u003e4.4.1. Traditional Methods (Merge-All and Hierarchical Merging) 92\u003c\/p\u003e \u003cp\u003e4.4.2. Two-Phase Method 93\u003c\/p\u003e \u003cp\u003e4.4.3. Redistribution Method 94\u003c\/p\u003e \u003cp\u003e4.5. Cost Models for Parallel Sort 96\u003c\/p\u003e \u003cp\u003e4.5.1. Cost Models for Serial External Merge-Sort 96\u003c\/p\u003e \u003cp\u003e4.5.2. Cost Models for Parallel Merge-All Sort 98\u003c\/p\u003e \u003cp\u003e4.5.3. Cost Models for Parallel Binary-Merge Sort 100\u003c\/p\u003e \u003cp\u003e4.5.4. Cost Models for Parallel Redistribution Binary-Merge Sort 101\u003c\/p\u003e \u003cp\u003e4.5.5. Cost Models for Parallel Redistribution Merge-All Sort 102\u003c\/p\u003e \u003cp\u003e4.5.6. Cost Models for Parallel Partitioned Sort 103\u003c\/p\u003e \u003cp\u003e4.6. Cost Models for Parallel GroupBy 104\u003c\/p\u003e \u003cp\u003e4.6.1. Cost Models for Parallel Two-Phase Method 104\u003c\/p\u003e \u003cp\u003e4.6.2. Cost Models for Parallel Redistribution Method 107\u003c\/p\u003e \u003cp\u003e4.7. Summary 109\u003c\/p\u003e \u003cp\u003e4.8. Bibliographical Notes 110\u003c\/p\u003e \u003cp\u003e4.9. Exercises 110\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5. Parallel Join 112\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1. Join Operations 112\u003c\/p\u003e \u003cp\u003e5.2. Serial Join Algorithms 114\u003c\/p\u003e \u003cp\u003e5.2.1. Nested-Loop Join Algorithm 114\u003c\/p\u003e \u003cp\u003e5.2.2. Sort-Merge Join Algorithm 116\u003c\/p\u003e \u003cp\u003e5.2.3. Hash-Based Join Algorithm 117\u003c\/p\u003e \u003cp\u003e5.2.4. Comparison 120\u003c\/p\u003e \u003cp\u003e5.3. Parallel Join Algorithms 120\u003c\/p\u003e \u003cp\u003e5.3.1. Divide and Broadcast-Based Parallel Join Algorithms 121\u003c\/p\u003e \u003cp\u003e5.3.2. Disjoint Partitioning-Based Parallel Join Algorithms 124\u003c\/p\u003e \u003cp\u003e5.4. Cost Models 128\u003c\/p\u003e \u003cp\u003e5.4.1. Cost Models for Divide and Broadcast 128\u003c\/p\u003e \u003cp\u003e5.4.2. Cost Models for Disjoint Partitioning 129\u003c\/p\u003e \u003cp\u003e5.4.3. Cost Models for Local Join 130\u003c\/p\u003e \u003cp\u003e5.5. Parallel Join Optimization 132\u003c\/p\u003e \u003cp\u003e5.5.1. Optimizing Main Memory 132\u003c\/p\u003e \u003cp\u003e5.5.2. Load Balancing 133\u003c\/p\u003e \u003cp\u003e5.6. Summary 134\u003c\/p\u003e \u003cp\u003e5.7. Bibliographical Notes 135\u003c\/p\u003e \u003cp\u003e5.8. Exercises 136\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart III Advanced Parallel Query Processing\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6. Parallel GroupBy-Join 141\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1. Groupby-Join Queries 141\u003c\/p\u003e \u003cp\u003e6.1.1. Groupby Before Join 142\u003c\/p\u003e \u003cp\u003e6.1.2. Groupby After Join 142\u003c\/p\u003e \u003cp\u003e6.2. Parallel Algorithms for Groupby-Before-Join Query Processing 143\u003c\/p\u003e \u003cp\u003e6.2.1. Early Distribution Scheme 143\u003c\/p\u003e \u003cp\u003e6.2.2. Early GroupBy with Partitioning Scheme 145\u003c\/p\u003e \u003cp\u003e6.2.3. Early GroupBy with Replication Scheme 146\u003c\/p\u003e \u003cp\u003e6.3. Parallel Algorithms for Groupby-After-Join Query Processing 148\u003c\/p\u003e \u003cp\u003e6.3.1. Join Partitioning Scheme 148\u003c\/p\u003e \u003cp\u003e6.3.2. GroupBy Partitioning Scheme 150\u003c\/p\u003e \u003cp\u003e6.4. Cost Model Notations 151\u003c\/p\u003e \u003cp\u003e6.5. Cost Model for Groupby-Before-Join Query Processing 153\u003c\/p\u003e \u003cp\u003e6.5.1. Cost Models for the Early Distribution Scheme 153\u003c\/p\u003e \u003cp\u003e6.5.2. Cost Models for the Early GroupBy with Partitioning Scheme 156\u003c\/p\u003e \u003cp\u003e6.5.3. Cost Models for the Early GroupBy with Replication Scheme 158\u003c\/p\u003e \u003cp\u003e6.6. Cost Model for “Groupby-After-Join” Query Processing 159\u003c\/p\u003e \u003cp\u003e6.6.1. Cost Models for the Join Partitioning Scheme 159\u003c\/p\u003e \u003cp\u003e6.6.2. Cost Models for the GroupBy Partitioning Scheme 161\u003c\/p\u003e \u003cp\u003e6.7. Summary 163\u003c\/p\u003e \u003cp\u003e6.8. Bibliographical Notes 164\u003c\/p\u003e \u003cp\u003e6.9. Exercises 164\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7. Parallel Indexing 167\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1. Parallel Indexing–an Internal Perspective on Parallel Indexing Structures 168\u003c\/p\u003e \u003cp\u003e7.2. Parallel Indexing Structures 169\u003c\/p\u003e \u003cp\u003e7.2.1. Nonreplicated Indexing (NRI) Structures 169\u003c\/p\u003e \u003cp\u003e7.2.2. Partially Replicated Indexing (PRI) Structures 171\u003c\/p\u003e \u003cp\u003e7.2.3. Fully Replicated Indexing (FRI) Structures 178\u003c\/p\u003e \u003cp\u003e7.3. Index Maintenance 180\u003c\/p\u003e \u003cp\u003e7.3.1. Maintaining a Parallel Nonreplicated Index 182\u003c\/p\u003e \u003cp\u003e7.3.2. Maintaining a Parallel Partially Replicated Index 182\u003c\/p\u003e \u003cp\u003e7.3.3. Maintaining a Parallel Fully Replicated Index 188\u003c\/p\u003e \u003cp\u003e7.3.4. Complexity Degree of Index Maintenance 188\u003c\/p\u003e \u003cp\u003e7.4. Index Storage Analysis 188\u003c\/p\u003e \u003cp\u003e7.4.1. Storage Cost Models for Uniprocessors 189\u003c\/p\u003e \u003cp\u003e7.4.2. Storage Cost Models for Parallel Processors 191\u003c\/p\u003e \u003cp\u003e7.5. Parallel Processing of Search Queries using Index 192\u003c\/p\u003e \u003cp\u003e7.5.1. Parallel One-Index Search Query Processing 192\u003c\/p\u003e \u003cp\u003e7.5.2. Parallel Multi-Index Search Query Processing 195\u003c\/p\u003e \u003cp\u003e7.6. Parallel Index Join Algorithms 200\u003c\/p\u003e \u003cp\u003e7.6.1. Parallel One-Index Join 200\u003c\/p\u003e \u003cp\u003e7.6.2. Parallel Two-Index Join 203\u003c\/p\u003e \u003cp\u003e7.7. Comparative Analysis 207\u003c\/p\u003e \u003cp\u003e7.7.1. Comparative Analysis of Parallel Search Index 207\u003c\/p\u003e \u003cp\u003e7.7.2. Comparative Analysis of Parallel Index Join 213\u003c\/p\u003e \u003cp\u003e7.8. Summary 216\u003c\/p\u003e \u003cp\u003e7.9. Bibliographical Notes 217\u003c\/p\u003e \u003cp\u003e7.10. Exercises 217\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8. Parallel Universal Qualification—Collection Join Queries 219\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1. Universal Quantification and Collection Join 220\u003c\/p\u003e \u003cp\u003e8.2. Collection Types and Collection Join Queries 222\u003c\/p\u003e \u003cp\u003e8.2.1. Collection-Equi Join Queries 222\u003c\/p\u003e \u003cp\u003e8.2.2. Collection–Intersect Join Queries 223\u003c\/p\u003e \u003cp\u003e8.2.3. Subcollection Join Queries 224\u003c\/p\u003e \u003cp\u003e8.3. Parallel Algorithms for Collection Join Queries 225\u003c\/p\u003e \u003cp\u003e8.4. Parallel Collection-Equi Join Algorithms 225\u003c\/p\u003e \u003cp\u003e8.4.1. Disjoint Data Partitioning 226\u003c\/p\u003e \u003cp\u003e8.4.2. Parallel Double Sort-Merge Collection-Equi Join Algorithm 227\u003c\/p\u003e \u003cp\u003e8.4.3. Parallel Sort-Hash Collection-Equi Join Algorithm 228\u003c\/p\u003e \u003cp\u003e8.4.4. Parallel Hash Collection-Equi Join Algorithm 232\u003c\/p\u003e \u003cp\u003e8.5. Parallel Collection-Intersect Join Algorithms 233\u003c\/p\u003e \u003cp\u003e8.5.1. Non-Disjoint Data Partitioning 234\u003c\/p\u003e \u003cp\u003e8.5.2. Parallel Sort-Merge Nested-Loop Collection-Intersect Join Algorithm 244\u003c\/p\u003e \u003cp\u003e8.5.3. Parallel Sort-Hash Collection-Intersect Join Algorithm 245\u003c\/p\u003e \u003cp\u003e8.5.4. Parallel Hash Collection-Intersect Join Algorithm 246\u003c\/p\u003e \u003cp\u003e8.6. Parallel Subcollection Join Algorithms 246\u003c\/p\u003e \u003cp\u003e8.6.1. Data Partitioning 247\u003c\/p\u003e \u003cp\u003e8.6.2. Parallel Sort-Merge Nested-Loop Subcollection Join Algorithm 248\u003c\/p\u003e \u003cp\u003e8.6.3. Parallel Sort-Hash Subcollection Join Algorithm 249\u003c\/p\u003e \u003cp\u003e8.6.4. Parallel Hash Subcollection Join Algorithm 251\u003c\/p\u003e \u003cp\u003e8.7. Summary 252\u003c\/p\u003e \u003cp\u003e8.8. Bibliographical Notes 252\u003c\/p\u003e \u003cp\u003e8.9. Exercises 254\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9. Parallel Query Scheduling and Optimization 256\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1. Query Execution Plan 257\u003c\/p\u003e \u003cp\u003e9.2. Subqueries Execution Scheduling Strategies 259\u003c\/p\u003e \u003cp\u003e9.2.1. Serial Execution Among Subqueries 259\u003c\/p\u003e \u003cp\u003e9.2.2. Parallel Execution Among Subqueries 261\u003c\/p\u003e \u003cp\u003e9.3. Serial vs. Parallel Execution Scheduling 264\u003c\/p\u003e \u003cp\u003e9.3.1. Nonskewed Subqueries 264\u003c\/p\u003e \u003cp\u003e9.3.2. Skewed Subqueries 265\u003c\/p\u003e \u003cp\u003e9.3.3. Skewed and Nonskewed Subqueries 267\u003c\/p\u003e \u003cp\u003e9.4. Scheduling Rules 269\u003c\/p\u003e \u003cp\u003e9.5. Cluster Query Processing Model 270\u003c\/p\u003e \u003cp\u003e9.5.1. Overview of Dynamic Query Processing 271\u003c\/p\u003e \u003cp\u003e9.5.2. A Cluster Query Processing Architecture 272\u003c\/p\u003e \u003cp\u003e9.5.3. Load Information Exchange 273\u003c\/p\u003e \u003cp\u003e9.6. Dynamic Cluster Query Optimization 275\u003c\/p\u003e \u003cp\u003e9.6.1. Correction 276\u003c\/p\u003e \u003cp\u003e9.6.2. Migration 280\u003c\/p\u003e \u003cp\u003e9.6.3. Partition 281\u003c\/p\u003e \u003cp\u003e9.7. Other Approaches to Dynamic Query Optimization 284\u003c\/p\u003e \u003cp\u003e9.8. Summary 285\u003c\/p\u003e \u003cp\u003e9.9. Bibliographical Notes 286\u003c\/p\u003e \u003cp\u003e9.10. Exercises 286\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart IV Grid Databases\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10. Transactions in Distributed and Grid Databases 291\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1. Grid Database Challenges 292\u003c\/p\u003e \u003cp\u003e10.2. Distributed Database Systems and Multidatabase Systems 293\u003c\/p\u003e \u003cp\u003e10.2.1. Distributed Database Systems 293\u003c\/p\u003e \u003cp\u003e10.2.2. Multidatabase Systems 297\u003c\/p\u003e \u003cp\u003e10.3. Basic Definitions on Transaction Management 299\u003c\/p\u003e \u003cp\u003e10.4. Acid Properties of Transactions 301\u003c\/p\u003e \u003cp\u003e10.5. Transaction Management in Various Database Systems 303\u003c\/p\u003e \u003cp\u003e10.5.1. Transaction Management in Centralized and Homogeneous Distributed Database Systems 303\u003c\/p\u003e \u003cp\u003e10.5.2. Transaction Management in Heterogeneous Distributed Database Systems 305\u003c\/p\u003e \u003cp\u003e10.6. Requirements in Grid Database Systems 307\u003c\/p\u003e \u003cp\u003e10.7. Concurrency Control Protocols 309\u003c\/p\u003e \u003cp\u003e10.8. Atomic Commit Protocols 310\u003c\/p\u003e \u003cp\u003e10.8.1. Homogeneous Distributed Database Systems 310\u003c\/p\u003e \u003cp\u003e10.8.2. Heterogeneous Distributed Database Systems 313\u003c\/p\u003e \u003cp\u003e10.9. Replica Synchronization Protocols 314\u003c\/p\u003e \u003cp\u003e10.9.1. Network Partitioning 315\u003c\/p\u003e \u003cp\u003e10.9.2. Replica Synchronization Protocols 316\u003c\/p\u003e \u003cp\u003e10.10. Summary 318\u003c\/p\u003e \u003cp\u003e10.11. Bibliographical Notes 318\u003c\/p\u003e \u003cp\u003e10.12. Exercises 319\u003c\/p\u003e \u003cp\u003e\u003cb\u003e11. Grid Concurrency Control 321\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e11.1. A Grid Database Environment 321\u003c\/p\u003e \u003cp\u003e11.2. An Example 322\u003c\/p\u003e \u003cp\u003e11.3. Grid Concurrency Control 324\u003c\/p\u003e \u003cp\u003e11.3.1. Basic Functions Required by GCC 324\u003c\/p\u003e \u003cp\u003e11.3.2. Grid Serializability Theorem 325\u003c\/p\u003e \u003cp\u003e11.3.3. Grid Concurrency Control Protocol 329\u003c\/p\u003e \u003cp\u003e11.3.4. Revisiting the Earlier Example 333\u003c\/p\u003e \u003cp\u003e11.3.5. Comparison with Traditional Concurrency Control Protocols 334\u003c\/p\u003e \u003cp\u003e11.4. Correctness of GCC Protocol 336\u003c\/p\u003e \u003cp\u003e11.5. Features of GCC Protocol 338\u003c\/p\u003e \u003cp\u003e11.6. Summary 339\u003c\/p\u003e \u003cp\u003e11.7. Bibliographical Notes 339\u003c\/p\u003e \u003cp\u003e11.8. Exercises 339\u003c\/p\u003e \u003cp\u003e\u003cb\u003e12. Grid Transaction Atomicity and Durability 341\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e12.1. Motivation 342\u003c\/p\u003e \u003cp\u003e12.2. Grid Atomic Commit Protocol (Grid-ACP) 343\u003c\/p\u003e \u003cp\u003e12.2.1. State Diagram of Grid-ACP 343\u003c\/p\u003e \u003cp\u003e12.2.2. Grid-ACP Algorithm 344\u003c\/p\u003e \u003cp\u003e12.2.3. Early-Abort Grid-ACP 346\u003c\/p\u003e \u003cp\u003e12.2.4. Discussion 348\u003c\/p\u003e \u003cp\u003e12.2.5. Message and Time Complexity Comparison Analysis 349\u003c\/p\u003e \u003cp\u003e12.2.6. Correctness of Grid-ACP 350\u003c\/p\u003e \u003cp\u003e12.3. Handling Failure of Sites with Grid-ACP 351\u003c\/p\u003e \u003cp\u003e12.3.1. Model for Storing Log Files at the Originator and Participating Sites 351\u003c\/p\u003e \u003cp\u003e12.3.2. Logs Required at the Originator Site 352\u003c\/p\u003e \u003cp\u003e12.3.3. Logs Required at the Participant Site 353\u003c\/p\u003e \u003cp\u003e12.3.4. Failure Recovery Algorithm for Grid-ACP 353\u003c\/p\u003e \u003cp\u003e12.3.5. Comparison of Recovery Protocols 359\u003c\/p\u003e \u003cp\u003e12.3.6. Correctness of Recovery Algorithm 361\u003c\/p\u003e \u003cp\u003e12.4. Summary 365\u003c\/p\u003e \u003cp\u003e12.5. Bibliographical Notes 366\u003c\/p\u003e \u003cp\u003e12.6. Exercises 366\u003c\/p\u003e \u003cp\u003e\u003cb\u003e13. Replica Management in Grids 367\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e13.1. Motivation 367\u003c\/p\u003e \u003cp\u003e13.2. Replica Architecture 368\u003c\/p\u003e \u003cp\u003e13.2.1. High-Level Replica Management Architecture 368\u003c\/p\u003e \u003cp\u003e13.2.2. Some Problems 369\u003c\/p\u003e \u003cp\u003e13.3. Grid Replica Access Protocol (GRAP) 371\u003c\/p\u003e \u003cp\u003e13.3.1. Read Transaction Operation for GRAP 371\u003c\/p\u003e \u003cp\u003e13.3.2. Write Transaction Operation for GRAP 372\u003c\/p\u003e \u003cp\u003e13.3.3. Revisiting the Example Problem 375\u003c\/p\u003e \u003cp\u003e13.3.4. Correctness of GRAP 377\u003c\/p\u003e \u003cp\u003e13.4. Handling Multiple Partitioning 378\u003c\/p\u003e \u003cp\u003e13.4.1. Contingency GRAP 378\u003c\/p\u003e \u003cp\u003e13.4.2. Comparison of Replica Management Protocols 381\u003c\/p\u003e \u003cp\u003e13.4.3. Correctness of Contingency GRAP 383\u003c\/p\u003e \u003cp\u003e13.5. Summary 384\u003c\/p\u003e \u003cp\u003e13.6. Bibliographical Notes 385\u003c\/p\u003e \u003cp\u003e13.7. Exercises 385\u003c\/p\u003e \u003cp\u003e\u003cb\u003e14. Grid Atomic Commitment in Replicated Data 387\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e14.1. Motivation 388\u003c\/p\u003e \u003cp\u003e14.1.1. Architectural Reasons 388\u003c\/p\u003e \u003cp\u003e14.1.2. Motivating Example 388\u003c\/p\u003e \u003cp\u003e14.2. Modified Grid Atomic Commitment Protocol 390\u003c\/p\u003e \u003cp\u003e14.2.1. Modified Grid-ACP 390\u003c\/p\u003e \u003cp\u003e14.2.2. Correctness of Modified Grid-ACP 393\u003c\/p\u003e \u003cp\u003e14.3. Transaction Properties in Replicated Environment 395\u003c\/p\u003e \u003cp\u003e14.4. Summary 397\u003c\/p\u003e \u003cp\u003e14.5. Bibliographical Notes 397\u003c\/p\u003e \u003cp\u003e14.6. Exercises 398\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart V Other Data-Intensive Applications\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e15. Parallel Online Analytic Processing (OLAP) and Business Intelligence 401\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e15.1. Parallel Multidimensional Analysis 402\u003c\/p\u003e \u003cp\u003e15.2. Parallelization of ROLLUP Queries 405\u003c\/p\u003e \u003cp\u003e15.2.1. Analysis of Basic Single ROLLUP Queries 405\u003c\/p\u003e \u003cp\u003e15.2.2. Analysis of Multiple ROLLUP Queries 409\u003c\/p\u003e \u003cp\u003e15.2.3. Analysis of Partial ROLLUP Queries 411\u003c\/p\u003e \u003cp\u003e15.2.4. Parallelization Without Using ROLLUP 412\u003c\/p\u003e \u003cp\u003e15.3. Parallelization of CUBE Queries 412\u003c\/p\u003e \u003cp\u003e15.3.1. Analysis of Basic CUBE Queries 413\u003c\/p\u003e \u003cp\u003e15.3.2. Analysis of Partial CUBE Queries 416\u003c\/p\u003e \u003cp\u003e15.3.3. Parallelization Without Using CUBE 417\u003c\/p\u003e \u003cp\u003e15.4. Parallelization of Top-\u003ci\u003eN \u003c\/i\u003eand Ranking Queries 418\u003c\/p\u003e \u003cp\u003e15.5. Parallelization of Cume_Dist Queries 419\u003c\/p\u003e \u003cp\u003e15.6. Parallelization of NTILE and Histogram Queries 420\u003c\/p\u003e \u003cp\u003e15.7. Parallelization of Moving Average and Windowing Queries 422\u003c\/p\u003e \u003cp\u003e15.8. Summary 424\u003c\/p\u003e \u003cp\u003e15.9. Bibliographical Notes 424\u003c\/p\u003e \u003cp\u003e15.10. Exercises 425\u003c\/p\u003e \u003cp\u003e\u003cb\u003e16. Parallel Data Mining—Association Rules and Sequential Patterns 427\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e16.1. From Databases To Data Warehousing To Data Mining: A Journey 428\u003c\/p\u003e \u003cp\u003e16.2. Data Mining: A Brief Overview 431\u003c\/p\u003e \u003cp\u003e16.2.1. Data Mining Tasks 431\u003c\/p\u003e \u003cp\u003e16.2.2. Querying vs. Mining 433\u003c\/p\u003e \u003cp\u003e16.2.3. Parallelism in Data Mining 436\u003c\/p\u003e \u003cp\u003e16.3. Parallel Association Rules 440\u003c\/p\u003e \u003cp\u003e16.3.1. Association Rules: Concepts 441\u003c\/p\u003e \u003cp\u003e16.3.2. Association Rules: Processes 444\u003c\/p\u003e \u003cp\u003e16.3.3. Association Rules: Parallel Processing 448\u003c\/p\u003e \u003cp\u003e16.4. Parallel Sequential Patterns 450\u003c\/p\u003e \u003cp\u003e16.4.1. Sequential Patterns: Concepts 452\u003c\/p\u003e \u003cp\u003e16.4.2. Sequential Patterns: Processes 456\u003c\/p\u003e \u003cp\u003e16.4.3. Sequential Patterns: Parallel Processing 459\u003c\/p\u003e \u003cp\u003e16.5. Summary 461\u003c\/p\u003e \u003cp\u003e16.6. Bibliographical Notes 461\u003c\/p\u003e \u003cp\u003e16.7. Exercises 462\u003c\/p\u003e \u003cp\u003e\u003cb\u003e17. Parallel Clustering and Classification 464\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e17.1. Clustering and Classification 464\u003c\/p\u003e \u003cp\u003e17.1.1. Clustering 464\u003c\/p\u003e \u003cp\u003e17.1.2. Classification 465\u003c\/p\u003e \u003cp\u003e17.2. Parallel Clustering 467\u003c\/p\u003e \u003cp\u003e17.2.1. Clustering: Concepts 467\u003c\/p\u003e \u003cp\u003e17.2.2. k-Means Algorithm 468\u003c\/p\u003e \u003cp\u003e17.2.3. Parallel\u003ci\u003e k\u003c\/i\u003e-Means Clustering 471\u003c\/p\u003e \u003cp\u003e17.3. Parallel Classification 477\u003c\/p\u003e \u003cp\u003e17.3.1. Decision Tree Classification: Structures 477\u003c\/p\u003e \u003cp\u003e17.3.2. Decision Tree Classification: Processes 480\u003c\/p\u003e \u003cp\u003e17.3.3. Decision Tree Classification: Parallel Processing 488\u003c\/p\u003e \u003cp\u003e17.4. Summary 495\u003c\/p\u003e \u003cp\u003e17.5. Bibliographical Notes 498\u003c\/p\u003e \u003cp\u003e17.6. Exercises 498\u003c\/p\u003e \u003cp\u003ePermissions 501\u003c\/p\u003e \u003cp\u003eList of Conferences and Journals 507\u003c\/p\u003e \u003cp\u003eBibliography 511\u003c\/p\u003e \u003cp\u003eIndex 541\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Computer networking \u0026amp; communications [\u003ca title=\"See our other books on Computer networking \u0026amp; communications\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20networking%20\u0026amp;%20communications%20%5BUT%5D%22\"\u003eUT\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley","offers":[{"title":"Brand New","offer_id":52257071399192,"sku":"9780470107621","price":132.59,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9780470107621.jpg?v=1781276281","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/high-performance-parallel-database-processing-and-grid-databases-hardback-9780470107621","provider":"Freshly Printed Books","version":"1.0","type":"link"}