图书介绍

分布式数据库系统原理 英文本【2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载】

分布式数据库系统原理 英文本
  • M.TamerOzsu,PatrickValduriez著 著
  • 出版社: 北京:清华大学出版社
  • ISBN:7302054932
  • 出版时间:2002
  • 标注页数:666页
  • 文件大小:32MB
  • 文件页数:691页
  • 主题词:

PDF下载


点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快]温馨提示:(请使用BT下载软件FDM进行下载)软件下载地址页直链下载[便捷但速度慢]  [在线试读本书]   [在线获取解压码]

下载说明

分布式数据库系统原理 英文本PDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台)。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用!后期资源热门了。安装了迅雷也可以迅雷进行下载!

(文件页数 要大于 标注页数,上中下等多册电子书除外)

注意:本站所有压缩包均有解压码: 点击下载压缩包解压工具

图书目录

1 INTRODUCTION1

1.1 DISTRIBUTED DATA PROCESSING2

1.2 WHAT IS A DISTRIBUTED DATABASE SYSTEM?4

1.3 PROMISES OF DDBSs7

1.3.1 Transparent Management of Distributed and Replicated Data8

1.3.2 Reliability Through Distributed Transactions15

1.3.3 Improved Performance16

1.3.4 Easier System Expansion18

1.4 COMPLICATING FACTORS19

1.5.2 Distributed Query Processing20

1.5 PROBLEM AREAS20

1.5.1 Distributed Database Design20

1.5.3 Distributed Directory Management21

1.5.4 Distributed Concurrency Control21

1.5.5 Distributed Deadlock Management21

1.5.6 Reliability of Distributed DBMS21

1.5.7 Operating System Support22

1.5.8 Heterogeneous Databases22

1.5.9 Relationship among Problems22

1.6 BIBLIOGRAPHIC NOTES24

2 OVERVIEW OF RELATIONAL DBMS25

2.1 RELATIONAL DATABASE CONCEPTS26

2.2 NORMALIZATION27

2.2.1 Dependency Structures29

2.2.2 Normal Forms32

2.3 INTEGRITY RULES34

2.4 RELATIONAL DATA LANGUAGES35

2.4.1 Relational Algebra35

2.4.2 Relational Calculus43

2.4.3 Interface with Programming Languages46

2.5 RELATIONAL DBMS49

2.6 BIBLIOGRAPHIC NOTES51

3 REVIEW OF COMPUTER NETWORKS52

3.1 DATA COMMUNICATION CONCEPTS53

3.2 TYPES OF NETWORKS55

3.2.1 Topology56

3.2.2 Communication Schemes59

3.2.3 Scale61

3.3 PROTOCOL STANDARDS63

3.4 BROADBAND NETWORKS67

3.5 WIRELESS NETWORKS69

3.6 INTERNET70

3.7 CONCLUDING REMARKS71

3.8 BIBLIOGRAPHIC NOTES74

4 DISTRIBUTED DBMS ARCHITECTURE75

4.1 DBMS STANDARDIZATION76

4.2 ARCHITECTURAL MODELS FOR DISTRIBUTED DBMSs82

4.2.1 Autonomy82

4.2.4 Architectural Alternatives84

4.2.3 Heterogeneity84

4.2.2 Distribution84

4.3 DISTRIBUTED DBMS ARCHITECTURE87

4.3.1 Client/Server Systems88

4.3.2 Peer-to-Peer Distributed Systems90

4.3.3 MDBS Architecture94

4.4 GLOBAL DIRECTORY ISSUES97

4.5 CONCLUSION100

4.6 BIBLIOGRAPHIC NOTES100

5 DISTRIBUTED DATABASE DESIGN102

5.1.1 Top-Down Design Process104

5.1 ALTERNATIVE DESIGN STRATEGIES104

5.1.2 Bottom-Up Design Process106

5.2 DISTRIBUTION DESIGN ISSUES107

5.2.1 Reasons for Fragmentation107

5.2.2 Fragmentation Alternatives108

5.2.3 Degree of Fragmentation110

5.2.4 Correctness Rules of Fragmentation110

5.2.5 Allocation Alternatives111

5.2.6 Information Requirements111

5.3.1 Horizontal Fragmentation112

5.3 FRAGMENTATION112

5.3.2 Vertical Fragmentation131

5.3.3 Hybrid Fragmentation146

5.4 ALLOCATION147

5.4.1 Allocation Problem147

5.4.2 Information Requirements150

5.4.3 Allocation Model151

5.4.4 Solution Methods154

5.5 CONCLUSION155

5.6 BIBLIOGRAPHIC NOTES157

5.7 EXERCISES158

6 SEMANTIC DATA CONTROL161

6.1 VIEW MANAGEMENT162

6.1.1 Views in Centralized DBMSs162

6.1.2 Updates through Views164

6.1.3 Views in Distributed DBMSs165

6.2 DATA SECURITY167

6.2.1 Centralized Authorization Control167

6.2.2 Distributed Authorization Control170

6.3 SEMANTIC INTEGRITY CONTROL171

6.3.1 Centralized Semantic Integrity Control173

6.3.2 Distributed Semantic Integrity Control179

6.4 CONCLUSION184

6.5 BIBLIOGRAPHIC NOTES185

6.6 EXERCISES186

7 OVERVIEW OF QUERY PROCESSING188

7.1 QUERY PROCESSING PROBLEM189

7.2 OBJECTIVES OF QUERY PROCESSING192

7.3 COMPLEXITY OF RELATIONAL ALGEBRA OPERATIONS193

7.4 CHARACTERIZATION OF QUERY PROCESSORS194

7.4.2 Types of Optimization195

7.4.1 Languages195

7.4.3 Optimization Timing196

7.4.4 Statistics196

7.4.5 Decision Sites196

7.4.6 Exploitation of the Network Topology197

7.4.7 Exploitation of Replicated Fragments197

7.4.8 Use of Semijoins197

7.5 LAYERS OF QUERY PROCESSING198

7.5.1 Query Decomposition199

7.5.3 Global Query Optimization200

7.5.2 Data Localization200

7.5.4 Local Query Optimization201

7.6 CONCLUSION201

7.7 BIBLIOGRAPHIC NOTES202

8 QUERY DECOMPOSITION AND DATA LOCALIZATION203

8.1 QUERY DECOMPOSITION204

8.1.1 Normalization204

8.1.2 Analysis205

8.1.3 Elimination of Redundancy208

8.1.4 Rewriting210

8.2 LOCALIZATION OF DISTRIBUTED DATA214

8.2.1 Reduction for Primary Horizontal Fragmentation215

8.2.2 Reduction for Vertical Fragmentation218

8.2.3 Reduction for Derived Fragmentation220

8.2.4 Reduction for Hybrid Fragmentation221

8.3 CONCLUSION224

8.4 BIBLIOGRAPHIC NOTES224

8.5 EXERCISES225

9 OPTIMIZATION OF DISTRIBUTED QUERIES228

9.1 QUERY OPTIMIZATION229

9.1.1 Search Space229

9.1.2 Search Strategy232

9.1.3 Distributed Cost Model233

9.2 CENTRALIZED QUERY OPTIMIZATION239

9.2.1 INGRES Algorithm239

9.2.2 System R Algorithm243

9.3 JOIN ORDERING IN FRAGMENT QUERIES247

9.3.1 Join Ordering247

9.3.2 Semijoin Based Algorithms249

9.3.3 Join versus Semijoin252

9.4 DISTRIBUTED QUERY OPTIMIZATION ALGORITHMS254

9.4.1 Distributed INGRES Algorithm254

9.4.2 R* Algorithm259

9.4.3 SDD-1 Algorithm263

9.5 CONCLUSION269

9.6 BIBLIOGRAPHIC NOTES271

9.7 EXERCISES271

10 INTRODUCTION TO TRANSACTION MANAGEMENT274

10.1 DEFINITION OF A TRANSACTION276

10.1.1 Termination Conditions of Transactions278

10.1.2 Characterization of Transactions280

10.1.3 Formalization of the Transaction Concept281

10.2.1 Atomicity283

10.2 PROPERTIES OF TRANSACTIONS283

10.2.2 Consistency284

10.2.3 Isolation285

10.2.4 Durability288

10.3 TYPES OF TRANSACTIONS288

10.3.1 Flat Transactions290

10.3.2 Nested Transactions290

10.3.3 Workflows292

10.4 ARCHITECTURE REVISITED295

10.6 BIBLIOGRAPHIC NOTES297

10.5 CONCLUSION297

11 DISTRIBUTED CONCURRENCY CONTROL299

11.1 SERIALIZABILITY THEORY300

11.2 TAXONOMY OF CONCURRENCY CONTROL MECHANISMS306

11.3 LOCKING-BASED CONCURRENCY CONTROL ALGORITHMS308

11.3.1 Centralized 2PL318

11.3.2 Primary Copy 2PL322

11.3.3 Distributed 2PL322

11.4 TIMESTAMP-BASED CONCURRENCY CONTROL ALGORITHMS324

11.4.1 Basic TO Algorithm325

11.4.2 Conservative TO Algorithm329

11.4.3 Multiversion TO Algorithm331

11.5 OPTIMISTIC CONCURRENCY CONTROL ALGORITHMS332

11.6 DEADLOCK MANAGEMENT335

11.6.1 Deadlock Prevention337

11.6.2 Deadlock Avoidance337

11.6.3 Deadlock Detection and Resolution339

11.7 RELAXED CONCURRENCY CONTROL342

11.7.1 Non-Serializable Schedules342

11.7.2 Nested Distributed Transactions343

11.8 CONCLUSION345

11.9 BIBLIOGRAPHIC NOTES349

11.10 EXERCISES350

12 DISTRIBUTED DBMS RELIABILITY352

12.1 RELIABILITY CONCEPTS AND MEASURES353

12.1.1 System, State, and Failure353

12.1.2 Reliability and Availability356

12.1.3 Mean Time between Failures/Mean Time to Repair357

12.2 FAILURES AND FAULT TOLERANCE IN DISTRIBUTED SYSTEMS358

12.2.1 Reasons for Failures358

12.2.2 Basic Fault Tolerance Approaches and Techniques360

12.3 FAILURES IN DISTRIBUTED DBMS363

12.3.1 Transaction Failures363

12.3.2 Site(System)Failures363

12.3.3 Media Failures364

12.3.4 Communication Failures364

12.4 LOCAL RELIABILITY PROTOCOLS365

12.4.1 Architectural Considerations365

12.4.2 Recovery Information369

12.4.3 Execution of LRM Commands373

12.4.5 Handling Media Failures378

12.4.4 Checkpointing378

12.5 DISTRIBUTED RELIABILITY PROTOCOLS379

12.5.1 Components of Distributed Reliability Protocols380

12.5.2 Two-Phase Commit Protocol381

12.5.3 Variations of 2PC388

12.6 DEALING WITH SITE FAILURES390

12.6.1 Termination and Recovery Protocols for 2PC390

12.6.2 Three-Phase Commit Protocol396

12.7 NETWORK PARTITIONING401

12.7.2 Voting-based Protocols403

12.7.1 Centralized Protocols403

12.7.3 Replication and Replica Control Protocols406

12.7.4 Strict Replica Control Protocols406

12.7.5 Lazy Replication Protocols410

12.8 ARCHITECTURAL CONSIDERATIONS411

12.9 CONCLUSION412

12.10 BIBLIOGRAPHIC NOTES413

12.11 EXERCISES414

13 PARALLEL DATABASE SYSTEMS416

13.1.1 Database Server Approach417

13.1 DATABASE SERVERS417

13.1.2 Database Servers and Distributed Databases419

13.2 PARALLEL ARCHITECTURES420

13.2.1 Objectives420

13.2.2 Functional Aspects422

13.2.3 Parallel System Architectures424

13.3 PARALLEL DBMS TECHNIQUES430

13.3.1 Data Placement430

13.3.2 Query Parallelism435

13.3.3 Parallel Data Processing436

13.3.4 Parallel Query Optimization444

13.4 PARALLEL EXECUTION PROBLEMS449

13.4.1 Initialization449

13.4.2 Interferences and Convoy Effect449

13.4.3 Load Balancing450

13.5 PARALLEL EXECUTION FOR HIERARCHICAL ARCHITECTURE452

13.5.1 Problem Formulation453

13.5.2 Basic Concepts454

13.5.3 Load Balancing Strategy457

13.5.4 Performance Evaluation458

13.6 CONCLUSION458

13.7 BIBLIOGRAPHIC NOTES459

13.8 EXERCISES460

14 DISTRIBUTED OBJECT DATABASE MANAGEMENT SYSTEMS462

14.1 FUNDAMENTAL OBJECY CONCEPTS AND MODELS464

14.1.1 Object464

14.1.2 Abstract Data Types467

14.1.3 Composition(Aggregation)468

14.1.4 Class469

14.1.5 Collection469

14.1.6 Subtyping and Inheritance470

14.2 OBJECT DISTRIBUTION DESIGN471

14.2.1 Horizontal Class Partitioning472

14.2.2 Vertical Class Partitioning474

14.2.3 Path Partitioning474

14.2.4 Class Partitioning Algorithms475

14.2.5 Allocation476

14.2.6 Replication476

14.3 ARCHITECTURAL ISSUES477

14.3.1 Alternative Ciient/Server Architectures477

14.3.2 Cache Consistency482

14.4.1 Object Identifier Management484

14.4 OBJECT MANAGEMENT484

14.4.2 Pointer Swizzling486

14.4.3 Object Migration487

14.5 DISTRIBUTED OBJECT STORAGE488

14.6 OBJECT QUERY PROCESSING491

14.6.1 Object Query Processor Architectures493

14.6.2 Query Processing Issues495

14.6.3 Query Execution500

14.7 TRANSACTION MANAGEMENT504

14.7.1 Correctness Criteria505

14.7.2 Transaction Models and Object Structures510

14.7.3 Transactions Management in Object DBMSs511

14.7.4 Transactions as Objects520

14.8 CONCLUSION522

14.9 BIBLIOGRAPHIC NOTES522

14.10 EXERCISES523

15 DATABASE INTEROPERABILITY525

15.1 DATABASE INTEGRATION525

15.1.1 Schema Translation528

15.1.2 Schema Integration529

15.2 QUERY PROCESSING537

15.2.1 Query Processing Layers in Distributed Multi-DBMSs539

15.2.2 Query Optimization Issues541

15.3 TRANSACTION MANAGEMENT545

15.3.1 Transaction and Computation Model545

15.3.2 Multidatabase Concurrency Control548

15.3.3 Multidatabase Recovery552

15.4 OBJECT ORIENTATION AND INTEROPERABILITY553

15.4.1 Object Management Architecture555

15.4.2 CORBA and Database Interoperability559

15.4.3 Distributed Component Object Model562

15.4.4 COM/OLE and Database Interoperability564

15.5 CONCLUSION565

15.6 BIBLIOGRAPHIC NOTES566

15.7 EXERCISES567

16 CURRENT ISSUES571

16.1 DATA DELIVERY ALTERNATIVES573

16.2 DATA WAREHOUSING575

16.2.1 Architectures575

16.2.2 OLAP Data Model577

16.2.3 OLAP Servers579

16.2.4 Research Issues580

16.3 WORLD WIDE WEB581

16.3.1 Architecture and Protocols581

16.3.2 Database Access582

16.3.3 Semistructured Data583

16.3.4 Architectures for Information Integration585

16.3.5 Research Projects and Open Issues586

16.4 PUSH-BASED TECHNOLOGIES588

16.4.1 Delivery Schedule Generation589

16.4.2 Client Cache Management592

16.4.3 Propagating Updates595

16.5 MOBILE DATABASES596

16.5.1 Directory Management598

16.5.2 Caching599

16.5.3 Broadcast Data600

16.5.4 Query Processing and Optimization600

16.5.5 Transaction Management601

16.6 BIBLIOGRAPHIC NOTES602

BIBLIOGRAPHY605

SUBJECT INDEX658

热门推荐