数据库管理系统原理与设计 第3版【2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载】

数据库管理系统原理与设计 第3版PDF格式电子书版下载

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

Part ⅠFOUNDATIONS1

1 OVERVIEW OF DATABASE SYSTEMS3

1.1 Managing Data4

1.2 A Historical Perspective6

1.3 File Systems versus a DBMS8

1.4 Advantages of a DBMS9

1.5 Describing and Storing Data in a DBMS10

1.5.1The Relational Model11

1.5.2Levels of Abstraction in a DBMS12

1.5.3Data Independence15

1.6 Queries in a DBMS16

1.7 Transaction Management17

1.7.1Concurrent Execution of Transactions17

1.7.2Incomplete Transactions and System Crashes18

1.7.3Points to Note19

1.8 Structure of a DBMS19

1.9 People Who Work with Databases21

1.10 Review Questions22

2 INTRODUCTION TO DATABASE DESIGN25

2.1 Database Design and ER Diagrams26

2.1.1Beyond ER Design27

2.2 Entities，Attributes，and Entity Sets28

2.3 Relationships and Relationship Sets29

2.4 Additional Features of the ER Model32

2.4.1Key Constraints32

2.4.2Participation Constraints34

2.4.3Weak Entities35

2.4.4Class Hierarchies37

2.4.5Aggregation39

2.5 Conceptual Design With the ER Model40

2.5.1Entity versus Attribute41

2.5.2Entity versus Relationship42

2.5.3Binary versus Ternary Relationships43

2.5.4Aggregation versus Ternary Relationships45

2.6 Conceptual Design for Large Enterprises46

2.7 The Unified Modeling Language47

2.8 Case Study：The Internet Shop49

2.8.1Requirements Analysis49

2.8.2Conceptual Design50

2.9 Review Questions51

3 THE RELATIONAL MODEL57

3.1 Introduction to the Relational Model59

3.1.1Creating and Modifying Relations Using SQL62

3.2 Integrity Constraints over Relations63

3.2.1Key Constraints64

3.2.2Foreign Key Constraints66

3.2.3General Constraints68

3.3 Enforcing Integrity Constraints69

3.3.1Transactions and Constraints72

3.4 Querying Relational Data73

3.5 Logical Database Design：ER to Relational74

3.5.1Entity Sets to Tables75

3.5.2Relationship Sets （without Constraints） to Tables76

3.5.3Translating Relationship Sets with Key Constraints78

3.5.4Translating Relationship Sets with Participation Constraints79

3.5.5Translating Weak Entity Sets82

3.5.6Translating Class Hierarchies83

3.5.7Translating ER Diagrams with Aggregation84

3.5.8ER to Relational： Additional Examples85

3.6 Introduction to Views86

3.6.1Views，Data Independence，Security87

3.6.2Updates on Views88

3.7 Destroying/Altering Tables and Views91

3.8 Case Study：The Internet Store92

3.9 Review Questions94

4 RELATIONAL ALGEBRA AND CALCULUS100

4.1 Preliminaries101

4.2 Relational Algebra102

4.2.1Selection and Projection103

4.2.2Set Operations104

4.2.3Renaming106

4.2.4Joins107

4.2.5Division109

4.2.6More Examples of Algebra Queries110

4.3 Relational Calculus116

4.3.1Tuple Relational Calculus117

4.3.2Domain Relational Calculus122

4.4 Expressive Power of Algebra and Calculus124

4.5 Review Questions126

5 SQL：QUERIES，CONSTRAINTS，TRIGGERS130

5.1 Overview131

5.1.1Chapter Organization132

5.2 The Form of a Basic SQL Query133

5.2.1Examples of Basic SQL Queries138

5.2.2Expressions and Strings in the SELECT Command139

5.3 UNION， INTERSECT，and EXCEPT141

5.4 Nested Queries144

5.4.1Introduction to Nested Queries145

5.4.2Correlated Nested Queries147

5.4.3Set-Comparison Operators148

5.4.4More Examples of Nested Queries149

5.5 Aggregate Operators151

5.5.1The GROUP BY and HAVING Clauses154

5.5.2More Examples of Aggregate Queries158

5.6 Null Values162

5.6.1Comparisons Using Null Values163

5.6.2Logical Connectives AND，OR，and NOT163

5.6.3Impact on SQL Constructs163

5.6.4Outer Joins164

5.6.5Disallowing Null Values165

5.7 Complex Integrity Constraints in SQL165

5.7.1Constraints over a Single Table165

5.7.2Domain Constraints and Distinct Types166

5.7.3Assertions： ICs over Several Tables167

5.8 Triggers and Active Databases168

5.8.1Examples of Triggers in SQL169

5.9 Designing Active Databases171

5.9.1Why Triggers Can Be Hard to Understand171

5.9.2Constraints versus Triggers172

5.9.3Other Uses of Triggers172

5.10 Review Questions173

Part ⅡAPPLICATION DEVELOPMENT183

6DATABASE APPLICATION DEVELOPMENT185

6.1 Accessing Databases from Applications187

6.1.1Embedded SQL187

6.1.2Cursors189

6.1.3Dynamic SQL194

6.2 An Introduction to JDBC194

6.2.1Architecture196

6.3 JDBC Classes and Interfaces197

6.3.1JDBC Driver Management197

6.3.2Connections198

6.3.3Executing SQL Statements200

6.3.4ResultSets201

6.3.5Exceptions and Warnings203

6.3.6Examining Database Metadata204

6.4 SQLJ206

6.4.1Writing SQLJ Code207

6.5 Stored Procedures209

6.5.1Creating a Simple Stored Procedure209

6.5.2Calling Stored Procedures210

6.5.3SQL/PSM212

6.6 Case Study：The Internet Book Shop214

6.7 Review Questions216

7 INTERNET APPLICATIONS220

7.1 Introduction220

7.2 Internet Concepts221

7.2.1Uniform Resource Identifiers221

7.2.2The Hypertext Transfer Protocol（HTTP）223

7.3 HTML Documents226

7.4 XML Documents227

7.4.1Introduction to XML228

7.4.2XML DTDs231

7.4.3Domain-Specific DTDs234

7.5 The Three-Tier Application Architecture236

7.5.1Single-Tier and Client-Server Architectures236

7.5.2Three-Tier Architectures239

7.5.3Advantages of the Three-Tier Architecture241

7.6 The Presentation Layer242

7.6.1HTML Forms242

7.6.2JavaScript245

7.6.3Style Sheets247

7.7 The Middle Tier251

7.7.1CGI：The Common Gateway Interface251

7.7.2Application Servers252

7.7.3Servlets254

7.7.4JavaServer Pages256

7.7.5Maintaining State258

7.8 Case Study：The Internet Book Shop261

7.9 Review Questions264

Part Ⅲ STORAGE AND INDEXING271

8 OVERVIEW OF STORAGE AND INDEXING273

8.1 Data on External Storage274

8.2 File Organizations and Indexing275

8.2.1Clustered Indexes277

8.2.2Primary and Secondary Indexes277

8.3 Index Data Structures278

8.3.1Hash-Based Indexing279

8.3.2Tree-Based Indexing280

8.4 Comparison of File Organizations282

8.4.1Cost Model283

8.4.2Heap Files284

8.4.3Sorted Files285

8.4.4Clustered Files287

8.4.5Heap File with Unclustered Tree Index288

8.4.6Heap File With Unclustered Hash Index289

8.4.7Comparison of I/O Costs290

8.5 Indexes and Performance Tuning291

8.5.1Impact of the Workload292

8.5.2Clustered Index Organization292

8.5.3Composite Search Keys295

8.5.4Index Specification in SQL：1999299

8.6 Review Questions299

9 STORING DATA：DISKS AND FILES304

9.1 The Memory Hierarchy305

9.1.1Magnetic Disks306

9.1.2Performance Implications of Disk Structure308

9.2 Redundant Arrays of Independent Disks309

9.2.1Data Striping310

9.2.2Redundancy311

9.2.3Levels of Redundancy312

9.2.4Choice of RAID Levels316

9.3 Disk Space Management316

9.3.1Keeping Track of Free Blocks317

9.3.2Using OS File Systems to Manage Disk Space317

9.4 Buffer Manager318

9.4.1Buffer Replacement Policies320

9.4.2Buffer Management in DBMS versus OS322

9.5 Files of Records324

9.5.1Implementing Heap Files324

9.6 Page Formats326

9.6.1Fixed-Length Records327

9.6.2Variable-Length Records328

9.7 Record Formats330

9.7.1Fixed-Length Records331

9.7.2Variable-Length Records331

9.8 Review Questions333

10 TREE-STRUCTURED INDEXING338

10.1 Intuition For Tree Indexes339

10.2 Indexed Sequential Access Method（ISAM）341

10.2.1Overflow Pages， Locking Considerations344

10.3 B+Trees： A Dynamic Index Structure344

10.3.1Format of a Node346

10.4 Search347

10.5 Insert348

10.6 Delete352

10.7 Duplicates356

10.8 B+Trees in Practice358

10.8.1 Key Compression358

10.8.2 Bulk-Loading a B+Tree360

10.8.3 The Order Concept363

10.8.4 The Effect of Inserts and Deletes on Rids364

10.9 Review Questions364

11 HASH-BASED INDEXING370

11.1 Static Hashing371

11.1.1 Notation and Conventions373

11.2 Extendible Hashing373

11.3 Linear Hashing379

11.4 Extendible vs.Linear Hashing384

11.5 Review Questions385

Part Ⅳ QUERY EVALUATION391

12 OVERVIEW OF QUERY EVALUATION393

12.1 The System Catalog394

12.1.1Information in the Catalog395

12.2 Introduction to Operator Evaluation397

12.2.1Three Common Techniques398

12.2.2Access Paths398

12.3 Algorithms for Relational Operations400

12.3.1Selection401

12.3.2Projection401

12.3.3Join402

12.3.4Other Operations404

12.4 Introduction to Query Optimization404

12.4.1Query Evaluation Plans405

12.4.2Multi-operator Queries：Pipelined Evaluation407

12.4.3The Iterator Interface408

12.5 Alternative Plans：A Motivating Example409

12.5.1Pushing Selections409

12.5.2Using Indexes411

12.6 What a Typical Optimizer Does414

12.6.1Alternative Plans Considered414

12.6.2Estimating the Cost of a Plan416

12.7 Review Questions417

13 EXTERNAL SORTING421

13.1 When Does a DBMS Sort Data?422

13.2 A Simple Two-Way Merge Sort423

13.3 External Merge Sort424

13.3.1Minimizing the Number of Runs428

13.4 MinimizingI/OCost versus Number ofI/Os430

13.4.1Blocked 1/O430

13.4.2Double Buffering432

13.5Using B+ Trees for Sorting433

13.5.1 Clustered Index433

13.5.2 Unclustered Index434

13.6Review Questions436

14 EVALUATING RELATIONAL OPERATORS439

14.1 The Selection Operation441

14.1.1No Index，Unsorted Data441

14.1.2No Index，Sorted Data442

14.1.3B+Iree Index442

14.1.4Hash Index， Equality Selection444

14.2 General Selection Conditions444

14.2.1 CNF and Index Matching445

14.2.2 Evaluating Selections without Disjunction445

14.2.3 Selections with Disjunction446

14.3The Projection Operation447

14.3.1 Projection Based on Sorting448

14.3.2 Projection Based on Hashing449

14.3.3 Sorting Versus Hashing for Projections451

14.3.4 Use of Indexes for Projections452

14.4The Join Operation452

14.4.1 Nested Loops Join454

14.4.2 Sort-Merge Join458

14.4.3 Hash Join463

14.4.4 General Join Conditions467

14.5The Set Operations468

14.5.1 Sorting for Union and Difference469

14.5.2 Hashing for Union and Difference469

14.6Aggregate Operations469

14.6.1 Implementing Aggregation by Using an Index471

14.7The Impact of Buffering471

14.8Review Questions472

15 A TYPICAL RELATIONAL QUERY OPTIMIZER478

15.1Translating SQL Queries into Algebra479

15.1.1 Decomposition of a Query into Blocks479

15.1.2 A Query Block as a Relational Algebra Expression481

15.2Estimating the Cost of a Plan482

15.2.1 Estimating Result Sizes483

15.3Relational Algebra Equivalences488

15.3.1 Selections488

15.3.2 Projections488

15.3.3 Cross-Products and Joins489

15.3.4 Selects，Projects，and Joins490

15.3.5 Other Equivalences491

15.4Enumeration of Alternative Plans492

15.4.1 Single-Relation Queries492

15.4.2 Multiple-Relation Queries496

15.5Nested Subqueries504

15.6The System R Optimizer506

15.7Other Approaches to Query Optimization507

15.8Review Questions507

Part V TRANSACTION MANAGEMENT517

16 OVERVIEW OF TRANSACTION MANAGEMENT519

16.1The ACID Properties520

16.1.1 Consistency and Isolation521

16.1.2 Atomicity and Durability522

16.2Transactions and Schedules523

16.3Concurrent Execution of Transactions524

16.3.1 Motivation for Concurrent Execution524

16.3.2 Serializability525

16.3.3 Anomalies Due to Interleaved Execution526

16.3.4 Schedules Involving Aborted Transactions529

16.4Lock-Based Concurrency Control530

16.4.1 Strict Two-Phase Locking （Strict 2PL）531

16.4.2 Deadlocks533

16.5Performance of Locking533

16.6Transaction Support in SQL535

16.6.1 Creating and Terminating Transactions535

16.6.2 What Should We Lock?537

16.6.3 Transaction Characteristics in SQL538

16.7Introduction to Crash Recovery540

16.7.1 Stealing Frames and Forcing Pages541

16.7.2 Recovery-Related Steps during Normal Execution542

16.7.3 Overview of ARIES543

16.7.4 Atomicity：Implementing Rollback543

16.8Review Questions544

17 CONCURRENCY CONTROL549

17.12PL，Serializability，and Recoverability550

17.1.1 View Serializability553

17.2Introduction to Lock Management553

17.2.1 Implementing Lock and Unlock Requests554

17.3Lock Conversions555

17.4Dealing With Deadlocks556

17.4.1 Deadlock Prevention558

17.5Specialized Locking Techniques559

17.5.1 Dynamic Databases and the Phantom Problem560

17.5.2 Concurrency Control in B+ Trees561

17.5.3 Multiple-Granularity Locking564

17.6Concurrency Control without Locking566

17.6.1 Optimistic Concurrency Control566

17.6.2 Timestamp-Based Concurrency Control569

17.6.3 Multiversion Concurrency Control572

17.7Review Questions573

18 CRASH RECOVERY579

18.1Introduction to ARIES580

18.2The Log582

18.3Other Recovery-Related Structures585

18.4The Write-Ahead Log Protocol586

18.5Checkpointing587

18.6Recovering from a System Crash587

18.6.1 Analysis Phase588

18.6.2 Redo Phase590

18.6.3 Undo Phase592

18.7Media Recovery595

18.8Other Approaches and Interaction with Concurrency Control596

18.9Review Questions597

Part Ⅵ DATABASE DESIGN AND TUNING603

19 SCHEMA REFINEMENT AND NORMAL FORMS605

19.1Introduction to Schema Refinement606

19.1.1 Problems Caused by Redundancy606

19.1.2 Decompositions608

19.1.3 Problems Related to Decomposition609

19.2Functional Dependencies611

19.3Reasoning about FDs612

19.3.1 Closure of a Set of FDs612

19.3.2 Attribute Closure614

19.4Normal Forms615

19.4.1 Boyce-Codd Normal Form615

19.4.2 Third Normal Form617

19.5Properties of Decompositions619

19.5.1 Lossless-Join Decomposition619

19.5.2 Dependency-Preserving Decomposition621

19.6Normalization622

19.6.1 Decomposition into BCNF622

19.6.2 Decomposition into 3NF625

19.7Schema Refinement in Database Design629

19.7.1 Constraints on an Entity Set630

19.7.2 Constraints on a Relationship Set630

19.7.3 Identifying Attributes of Entities631

19.7.4 Identifying Entity Sets633

19.8Other Kinds of Dependencies633

19.8.1 Multivalued Dependencies634

19.8.2 Fourth Normal Form636

19.8.3 Join Dependencies638

19.8.4 Fifth Normal Form638

19.8.5 Inclusion Dependencies639

19.9 Case Study：The Internet Shop640

19.10 Review Questions642

20 PHYSICAL DATABASE DESIGN AND TUNING649

20.1 Introduction to Physical Database Design650

20.1.1 Database Workloads651

20.1.2 Physical Design and Tuning Decisions652

20.1.3 Need for Database Muning653

20.2 Guidelines for Index Selection653

20.3 Basic Examples of Index Selection656

20.4 Clustering and Indexing658

20.4.1 Co-clustering Two Relations660

20.5 Indexes that Enable Index-Only Plans662

20.6 Tools to Assist in Index Selection663

20.6.1 Automatic Index Selection663

20.6.2 How Do Index Muning Wizards Work?664

20.7 Overview of Database Tuning667

20.7.1 Tuning Indexes667

20.7.2 Tuning the Conceptual Schema669

20.7.3 Tuning Queries and Views670

20.8 Choices in Tuning the Conceptual Schema671

20.8.1 Settling for a Weaker Normal Form671

20.8.2 Denormalization672

20.8.3 Choice of Decomposition672

20.8.4 Vertical Partitioning of BCNF Relations674

20.8.5 Horizontal Decomposition674

20.9 Choices in Muning Queries and Views675

20.10 Impact of Concurrency678

20.10.1 Reducing Lock Durations678

20.10.2 Reducing Hot Spots679

20.11 Case Study：The Internet Shop680

20.11.1 Mining the Database682

20.12 DBMS Benchmarking682

20.12.1 Well-Known DBMS Benchmarks683

20.12.2 Using a Benchmark684

20.13 Review Questions685

21 SECURITY AND AUTHORIZATION692

21.1 Introduction to Database Security693

21.2 Access Control694

21.3 Discretionary Access Control695

21.3.1 Grant and Revoke on Views and Integrity Constraints704

21.4Mandatory Access Control705

21.4.1 Multilevel Relations and Polyinstantiation707

21.4.2 Covert Channels， DoD Security Levels708

21.5Security for Internet Applications709

21.5.1 Encryption709

21.5.2 Certifying Servers：The SSL Protocol712

21.5.3 Digital Signatures713

21.6Additional Issues Related to Security714

21.6.1 Role of the Database Administrator714

21.6.2 Security in Statistical Databases715

21.7Design Case Study：The Internet Store716

21.8Review Questions718

Part Ⅶ ADDITIONAL TOPICS723

22 PARALLEL AND DISTRIBUTED DATABASES725

22.1Introduction726

22.2Architectures for Parallel Databases727

22.3Parallel Query Evaluation728

22.3.1 Data Partitioning730

22.3.2 Parallelizing Sequential Operator Evaluation Code730

22.4Parallelizing Individual Operations731

22.4.1 Bulk Loading and Scanning731

22.4.2 Sorting732

22.4.3 Joins732

22.5Parallel Query Optimization735

22.6Introduction to Distributed Databases736

22.6.1 Types of Distributed Databases737

22.7Distributed DBMS Architectures737

22.7.1 Client-Server Systems738

22.7.2 Collaborating Server Systems738

22.7.3 Middleware Systems739

22.8Storing Data in a Distributed DBMS739

22.8.1 Fragmentation739

22.8.2 Replication741

22.9Distributed Catalog Management741

22.9.1 Naming Objects741

22.9.2 Catalog Structure742

22.9.3 Distributed Data Independence743

22.10 Distributed Query Processing743

22.10.1 Nonjoin Queries in a Distributed DBMS744

22.10.2 Joins in a Distributed DBMS745

22.10.3 Cost-Based Query Optimization749

22.11 Updating Distributed Data750

22.11.1 Synchronous Replication750

22.11.2 Asynchronous Replication751

22.12 Distributed Transactions755

22.13 Distributed Concurrency Control755

22.13.1 Distributed Deadlock756

22.14 Distributed Recovery758

22.14.1 Normal Execution and Commit Protocols758

22.14.2 Restart after a Failure760

22.14.3 Two-Phase Commit Revisited761

22.14.4 Three-Phase Commit762

22.15 Review Questions763

23 OBJECT-DATABASE SYSTEMS772

23.1Motivating Example774

23.1.1 New Data Types775

23.1.2 Manipulating the New Data777

23.2Structured Data Types779

23.2.1 Collection Types780

23.3Operations on Structured Data781

23.3.1 Operations on Rows781

23.3.2 Operations on Arrays781

23.3.3 Operations on Other Collection Types782

23.3.4 Queries Over Nested Collections783

23.4Encapsulation and ADTs784

23.4.1 Defining Methods785

23.5Inheritance787

23.5.1 Defining Types with Inheritance787

23.5.2 Binding Methods788

23.5.3 Collection Hierarchies789

23.6Objects，OIDs，and Reference Types789

23.6.1 Notions of Equality790

23.6.2 Dereferencing Reference Types791

23.6.3 URLs and OIDs in SQL：1999791

23.7Database Design for an ORDBMS792

23.7.1 Collection Types and ADTs792

23.7.2 Object Identity795

23.7.3 Extending the ER Model796

23.7.4 Using Nested Collections798

23.8ORDBMS Implementation Challenges799

23.8.1 Storage and Access Methods799

23.8.2 Query Processing801

23.8.3 Query Optimization803

23.9 OODBMS805

23.9.1 The ODMG Data Model and ODL805

23.9.2 OQL807

23.10 Comparing RDBMS，OODBMS，and ORDBMS809

23.10.1 RDBMS versus ORDBMS809

23.10.2 OODBMS versus ORDBMS：Similarities809

23.10.3 OODBMS versus ORDBMS：Differences810

23.11 Review Questions811

24 DEDUCTIVE DATABASES817

24.1 Introduction to Recursive Queries818

24.1.1 Datalog819

24.2 Theoretical Foundations822

24.2.1 Least Model Semantics823

24.2.2 The Fixpoint Operator824

24.2.3 Safe Datalog Programs825

24.2.4 Least Model=Least Fixpoint826

24.3 Recursive Queries with Negation827

24.3.1 Stratification828

24.4 From Datalog to SQL831

24.5 Evaluating Recursive Queries834

24.5.1 Fixpoint Evaluation without Repeated Inferences835

24.5.2 Pushing Selections to Avoid Irrelevant Inferences837

24.5.3 The Magic Sets Algorithm838

24.6 Review Questions841

25 DATA WAREHOUSING AND DECISION SUPPORT846

25.1Introduction to Decision Support848

25.2OLAP： Multidimensional Data Model849

25.2.1 Multidimensional Database Design853

25.3Multidimensional Aggregation Queries854

25.3.1 ROLLUP and CUBE in SQL：1999856

25.4Window Queries in SQL：1999859

25.4.1 Framing a Window861

25.4.2 New Aggregate Functions862

25.5Finding Answers Quickly862

25.5.1 Top N Queries863

25.5.2 Online Aggregation864

25.6Implementation Techniques for OLAP865

25.6.1 Bitmap Indexes866

25.6.2 Join Indexes868

25.6.3 File Organizations869

25.7 Data Warehousing870

25.7.1 Creating and Maintaining a Warehouse871

25.8 Views and Decision Support872

25.8.1 Views， OLAP， and Warehousing872

25.8.2 Queries over Views873

25.9 View Materialization873

25.9.1 Issues in View Materialization874

25.10 Maintaining Materialized Views876

25.10.1 Incremental View Maintenance876

25.10.2 Maintaining Warehouse Views879

25.10.3 When Should We Synchronize Views?881

25.11 Review Questions882

26 DATA MINING889

26.1 Introduction to Data Mining890

26.1.1 The Knowledge Discovery Process891

26.2 Counting Co-occurrences892

26.2.1 Frequent Itemsets892

26.2.2 Iceberg Queries895

26.3 Mining for Rules897

26.3.1 Association Rules897

26.3.2 An Algorithm for Finding Association Rules898

26.3.3 Association Rules and ISA Hierarchies899

26.3.4 Generalized Association Rules900

26.3.5 Sequential Patterns901

26.3.6 The Use of Association Rules for Prediction902

26.3.7 Bayesian Networks903

26.3.8 Classification and Regression Rules904

26.4 Tree-Structured Rules906

26.4.1 Decision Trees907

26.4.2 An Algorithm to Build Decision Trees908

26.5 Clustering911

26.5.1 A Clustering Algorithm912

26.6 Similarity Search over Sequences913

26.6.1 An Algorithm to Find Similar Sequences915

26.7 Incremental Mining and Data Streams916

26.7.1 Incremental Maintenance of Frequent Itemsets918

26.8 Additional Data Mining Tasks920

26.9 Review Questions920

27 INFORMATION RETRIEVAL AND XML DATA926

27.1 Colliding Worlds：Databases，IR，and XML927

27.1.1 DBMS versus IR Systems928

27.2 Introduction to Information Retrieval929

27.2.1 Vector Space Model930

27.2.2 TF/IDF Weighting of Terms931

27.2.3 Ranking Document Similarity932

27.2.4 Measuring Success： Precision and Recall934

27.3 Indexing for Text Search934

27.3.1 Inverted Indexes935

27.3.2 Signature Files937

27.4 Web Search Engines939

27.4.1 Search Engine Architecture939

27.4.2 Using Link Information940

27.5 Managing Text in a DBMS944

27.5.1 Loosely Coupled Inverted Index945

27.6 A Data Model for XML945

27.6.1 Motivation for Loose Structure945

27.6.2 A Graph Model946

27.7 XQuery：Querying XML Data948

27.7.1 Path Expressions948

27.7.2 FLWR Expressions949

27.7.3 Ordering of Elements951

27.7.4 Grouping and Generation of Collection Values951

27.8 Efficient Evaluation of XML Queries952

27.8.1 Storing XML in RDBMS952

27.8.2 Indexing XML Repositories956

27.9 Review Questions959

28 SPATIAL DATA MANAGEMENT968

28.1Types of Spatial Data and Queries969

28.2 Applications Involving Spatial Data971

28.3 Introduction to Spatial indexes973

28.3.1 Overview of Proposed Index Structures974

28.4 Indexing Based on Space-Filling Curves975

28.4.1 Region Quad Trees and Z-Ordering：Region Data976

28.4.2 Spatial Queries Using Z-Ordering978

28.5 Grid Files978

28.5.1 Adapting Grid Files to Handle Regions981

28.6 R Trees：Point and Region Data982

28.6.1 Queries983

28.6.2 Insert and Delete Operations984

28.6.3 Concurrency Control986

28.6.4 Generalized Search Trees987

28.7 Issues in High-Dimensional Indexing988

28.8 Review Questions988

29 FURTHER READING992

29.1Advanced Transaction Processing993

29.1.1 Transaction Processing Monitors993

29.1.2New Transaction Models994

29.1.3 Real-Time DBMSs994

29.2Data Integration995

29.3Mobile Databases995

29.4Main Memory Databases996

29.5Multimedia Databases997

29.6Geographic Information Systems998

29.7Temporal Databases999

29.8Biological Databases999

29.9Information Visualization1000

29.10 Summary1000

30 THE MINIBASE SOFTWARE1002

30.1What Is Available1002

30.2Overview of Minibase Assignments1003

30.3Acknowledgments1004

REFERENCES1005

SUBJECT INDEX1045