LEADER 05779nam 2200733Ia 450 001 9910819467403321 005 20200520144314.0 010 $a1-281-83125-5 010 $a9786611831257 010 $a0-470-39136-7 010 $a0-470-39135-9 035 $a(CKB)1000000000549238 035 $a(EBL)362113 035 $a(OCoLC)437224706 035 $a(SSID)ssj0000171065 035 $a(PQKBManifestationID)11164204 035 $a(PQKBTitleCode)TC0000171065 035 $a(PQKBWorkID)10237191 035 $a(PQKB)10521307 035 $a(MiAaPQ)EBC362113 035 $a(Au-PeEL)EBL362113 035 $a(CaPaEBR)ebr10345961 035 $a(CaONFJC)MIL183125 035 $a(EXLCZ)991000000000549238 100 $a20080307d2008 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aHigh-performance parallel database processing and grid databases /$fDavid Taniar, Clement H.C. Leung, Wenny Rahayu, Sushant Goel 205 $a1st ed. 210 $aHoboken, NJ $cJ. Wiley$dc2008 215 $a1 online resource (574 p.) 225 1 $aWiley Series on Parallel and Distributed Computing ;$vv.67 300 $aDescription based upon print version of record. 311 $a0-470-10762-6 320 $aIncludes bibliographical references. 327 $aHigh-Performance Parallel Database Processing and Grid Databases; Contents; Preface; Part I Introduction; 1. Introduction; 1.1. A Brief Overview: Parallel Databases and Grid Databases; 1.2. Parallel Query Processing: Motivations; 1.3. Parallel Query Processing: Objectives; 1.3.1. Speed Up; 1.3.2. Scale Up; 1.3.3. Parallel Obstacles; 1.4. Forms of Parallelism; 1.4.1. Interquery Parallelism; 1.4.2. Intraquery Parallelism; 1.4.3. Intraoperation Parallelism; 1.4.4. Interoperation Parallelism; 1.4.5. Mixed Parallelism-A More Practical Solution; 1.5. Parallel Database Architectures 327 $a1.5.1. Shared-Memory and Shared-Disk Architectures1.5.2. Shared-Nothing Architecture; 1.5.3. Shared-Something Architecture; 1.5.4. Interconnection Networks; 1.6. Grid Database Architecture; 1.7. Structure of this Book; 1.8. Summary; 1.9. Bibliographical Notes; 1.10. Exercises; 2. Analytical Models; 2.1. Cost Models; 2.2. Cost Notations; 2.2.1. Data Parameters; 2.2.2. Systems Parameters; 2.2.3. Query Parameters; 2.2.4. Time Unit Costs; 2.2.5. Communication Costs; 2.3. Skew Model; 2.4. Basic Operations in Parallel Databases; 2.4.1. Disk Operations; 2.4.2. Main Memory Operations 327 $a2.4.3. Data Computation and Data Distribution2.5. Summary; 2.6. Bibliographical Notes; 2.7. Exercises; Part II Basic Query Parallelism; 3. Parallel Search; 3.1. Search Queries; 3.1.1. Exact-Match Search; 3.1.2. Range Search Query; 3.1.3. Multiattribute Search Query; 3.2. Data Partitioning; 3.2.1. Basic Data Partitioning; 3.2.2. Complex Data Partitioning; 3.3. Search Algorithms; 3.3.1. Serial Search Algorithms; 3.3.2. Parallel Search Algorithms; 3.4. Summary; 3.5. Bibliographical Notes; 3.6. Exercises; 4. Parallel Sort and GroupBy; 4.1. Sorting, Duplicate Removal, and Aggregate Queries 327 $a4.1.1. Sorting and Duplicate Removal4.1.2. Scalar Aggregate; 4.1.3. GroupBy; 4.2. Serial External Sorting Method; 4.3. Algorithms for Parallel External Sort; 4.3.1. Parallel Merge-All Sort; 4.3.2. Parallel Binary-Merge Sort; 4.3.3. Parallel Redistribution Binary-Merge Sort; 4.3.4. Parallel Redistribution Merge-All Sort; 4.3.5. Parallel Partitioned Sort; 4.4. Parallel Algorithms for GroupBy Queries; 4.4.1. Traditional Methods (Merge-All and Hierarchical Merging); 4.4.2. Two-Phase Method; 4.4.3. Redistribution Method; 4.5. Cost Models for Parallel Sort 327 $a4.5.1. Cost Models for Serial External Merge-Sort4.5.2. Cost Models for Parallel Merge-All Sort; 4.5.3. Cost Models for Parallel Binary-Merge Sort; 4.5.4. Cost Models for Parallel Redistribution Binary-Merge Sort; 4.5.5. Cost Models for Parallel Redistribution Merge-All Sort; 4.5.6. Cost Models for Parallel Partitioned Sort; 4.6. Cost Models for Parallel GroupBy; 4.6.1. Cost Models for Parallel Two-Phase Method; 4.6.2. Cost Models for Parallel Redistribution Method; 4.7. Summary; 4.8. Bibliographical Notes; 4.9. Exercises; 5. Parallel Join; 5.1. Join Operations; 5.2. Serial Join Algorithms 327 $a5.2.1. Nested-Loop Join Algorithm 330 $aThe latest techniques and principles of parallel and grid database processing The 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- 410 0$aWiley Series on Parallel and Distributed Computing 606 $aHigh performance computing 606 $aParallel processing (Electronic computers) 606 $aComputational grids (Computer systems) 615 0$aHigh performance computing. 615 0$aParallel processing (Electronic computers) 615 0$aComputational grids (Computer systems) 676 $a004.35 700 $aTaniar$b David$0969353 701 $aLeung$b Clement H. C$01705543 701 $aRahayu$b Johanna Wenny$01705544 701 $aGoel$b Sushant$01705545 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910819467403321 996 $aHigh-performance parallel database processing and grid databases$94092302 997 $aUNINA