Advanced Database Systems

, by Zaniolo; Ceri; Faloutsos; Snodgrass; Subrahmanian; Zicari

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

ISBN: 9781558604438 | 155860443X
Cover: Hardcover
Copyright: 5/1/1997

Rent

(Recommended)

$78.53

Term

Due

Price

Semester

Dec 12

$82.66

Quarter

Aug 13

$78.53

Short Term

Aug 1

$74.40

*This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping bag.
Buy New

Usually Ships in 3-5 Business Days

$105.82

The database field has experienced a rapid and incessant growth since the development of relational databases. The progress in database systems and applications has produced a diverse landscape of specialized technology areas that have often become the exclusive domain of research specialists. Examples include active databases, temporal databases, object-oriented databases, deductive databases, imprecise reasoning and queries, and multimedia information systems. This book provides a systematic introduction to and an in-depth treatment of these advanced database areas. It supplies practitioners and researchers with authoritative coverage of recent technological advances that are shaping the future of commercial database systems and intelligent information systems. Advanced Database Systems was written by a team of six leading specialists who have made significant contributions to the development of the technology areas covered in the book. Benefiting from the authors' long experience teaching graduate and professional courses, this book is designed to provide a gradual introduction to advanced research topics and includes many examples and exercises to support its use for individual study, desk reference, and graduate classroom teaching.

Preface

1 Introduction

(4)

Part I Active Databases

(92)

2 Syntax and Semantics of Active Databases

(34)

2.1 Starburst

(7)

2.1.1 Syntax of the Starburst CREATE RULE Statement

(1)

2.1.2 Semantics of Active Rules in Starburst

(2)

2.1.3 Other Active Rule Commands

(1)

2.1.4 Examples of Active Rule Executions

(3)

2.2 Oracle

(4)

2.2.1 Syntax of the Oracle CREATE TRIGGER Statement

(1)

2.2.2 Semantics of Oracle Triggers

(1)

2.2.3 Example of Trigger Executions

(2)

2.3 DB2

(5)

2.3.1 Syntax of the DB2 CREATE TRIGGER Statement

(1)

2.3.2 Semantics of DB2 Triggers

(2)

2.3.3 Examples of Trigger Executions

(2)

2.4 Chimera

(9)

2.4.1 Summary of Chimera

(3)

2.4.2 Syntax of the Chimera Define Trigger Statement

(1)

2.4.3 Semantics of Chimera Triggers

(2)

2.4.4 Examples of Trigger Executions

(3)

2.5 Taxonomy of Active Database Concepts

(3)

2.6 Bibliographic Notes

(1)

2.7 Exercises

(4)

3 Applications of Active Databases

(22)

3.1 Integrity Management

(5)

3.1.1 Rule Generation

(1)

3.1.2. Example

(3)

3.2 Derived Data Maintenance

(2)

3.2.1 Rule Generation

(1)

3.2.2 Example

(1)

3.3 Replication

(2)

3.4 Workflow Management

(1)

3.5 Business Rules

(7)

3.5.1 A Case Study: Energy Management System (EMS)

(1)

3.5.2 Database Schema for the EMS Case Study

(1)

3.5.3 Business Rules for the EMS Case Study

(5)

3.6 Bibliographic Notes

(1)

3.7 Exercises

(3)

4 Design Principles for Active Rules

(34)

4.1 Properties of Active Rule Execution

(9)

4.1.1 Termination

(5)

4.1.2 Confluence

(2)

4.1.3 Observable Determinism

(1)

4.2 Rule Modularization

(7)

4.2.1 Behavioral Stratification

(5)

4.2.2 Assertional Stratification

(1)

4.2.3 Event-Based Stratification

(1)

4.3 Rule Debugging and Monitoring

(2)

4.4 IDEA Methodology

(8)

4.4.1 Active Rule Design

(2)

4.4.2 Active Rule Prototyping

(1)

4.4.3 Active Rule Implementation

(1)

4.4.4 Design Tools Supporting the IDEA Methodology

(3)

4.5 Summary and Open Problems

(2)

4.6 Bibliographic Notes

(2)

4.7 Exercises

(4)

Part II Temporal Databases

(64)

5 Overview of Temporal Databases

(28)

5.1 A Case Study

101

(7)

5.1.1 Temporal Projection

102

(4)

5.1.2 Temporal Join

106

(2)

5.1.3 Summary

108

(1)

5.2 The Time Domain

108

(2)

5.3 Time Data Types

110

(1)

5.4 Associating Facts with Time

110

(11)

5.4.1 Dimensionality

110

(4)

5.4.2 Underlying Data Model

114

(4)

5.4.3 Representative Data Models

118

(3)

5.5 Temporal Query Languages

121

(1)

5.6 Summary

121

(2)

5.7 Bibliographic Notes

123

(2)

5.8 Exercises

125

(2)

6 TSQL 2

127

(22)

6.1 Time Ontology

127

(1)

6.2 Data Model

128

(3)

6.3 Language Constructs

131

(11)

6.3.1 Schema Definition

131

(1)

6.3.2 The SELECT Statement

132

(1)

6.3.3 Restructuring

133

(2)

6.3.4 Partitioning

135

(1)

6.3.5 The VALID Clause

136

(1)

6.3.6 The Modification Statements

136

(2)

6.3.7 Event Relations

138

(1)

6.3.8 Transaction-Time Support

139

(2)

6.3.9 Aggregates

141

(1)

6.3.10 Schema Evolution and Versioning

142

(1)

6.4 Other Constructs

142

(2)

6.5 Summary

144

(1)

6.6 Bibliographic Notes

145

(1)

6.7 Exercises

146

(3)

7 Implementation

149

(12)

7.1 System Architecture

149

(1)

7.2 Adding Temporal Support

150

(3)

7.2.1 DDL Compiler

150

(1)

7.2.2 Query Compiler

150

(3)

7.2.3 Run-Time Evaluator

153

(1)

7.3 Minimal Support Needed for TSQL2

153

(4)

7.3.1 Data Dictionary and Data Files

154

(1)

7.3.2 DDL Compiler

155

(1)

7.3.3 Query Compiler

155

(1)

7.3.4 Run-Time Evaluator

156

(1)

7.3.5 Transaction and Data Manager

157

(1)

7.4 Summary and Open Problems

157

(3)

7.5 Bibliographic Notes

160

(1)

7.6 Exercises

160

(1)

Part III Complex Queries and Reasoning

161

(106)

8 The Logic of Query Languages

163

(38)

8.1 Datalog

163

(5)

8.2 Relational Calculi

168

(2)

8.3 Relational Algebra

170

(2)

8.4 From Safe Datalog to Relational Algebra

172

(5)

8.4.1 Commercial Query Languages

175

(2)

8.5 Recursive Rules

177

(3)

8.6 Stratification

180

(2)

8.7 Expressive Power and Data Complexity

182

(5)

8.7.1 Functors and Complex Terms

185

(2)

8.8 Syntax and Semantics of Datalog Languages

187

(5)

8.8.1 Syntax of First-Order Logic and Datalog

187

(2)

8.8.2 Semantics

189

(1)

8.8.3 Interpretations

190

(2)

8.9 The Models of a Program

192

(2)

8.10 Fixpoint-Based Semantics

194

(3)

8.10.1 Operational Semantics: Powers of Tp

196

(1)

8.11 Bibliographic Notes

197

(1)

8.12 Exercises

198

(3)

9 Implementation of Rules and Recursion

201

(34)

9.1 Operational Semantics: Bottom-Up Execution

201

(1)

9.2 Stratified Programs and Iterated Fixpoint

201

(2)

9.3 Differential Fixpoint Computation

203

(3)

9.4 Top-Down Execution

206

(6)

9.4.1 Unification

207

(1)

9.4.2 SLD-Resolution

208

(4)

9.5 Rule-Rewriting Methods

212

(9)

9.5.1 Left-Linear and Right-Linear Recursion

213

(2)

9.5.2 Magic Sets Method

215

(3)

9.5.3 The Counting Method

218

(1)

9.5.4 Supplementary Magic Sets

219

(2)

9.6 Compilation and Optimization

221

(8)

9.6.1 Nonrecursive Programs

222

(2)

9.6.2 Recursive Predicates

224

(2)

9.6.3 Selecting a Method for Recursion

226

(2)

9.6.4 Optimization Strategies and Execution Plan

228

(1)

9.7 Recursive Queries in SQL

229

(3)

9.7.1 Implementation of Recursive SQL Queries

230

(2)

9.8 Bibliographic Notes

232

(1)

9.9 Exercises

233

(2)

10 Database Updates and Nonmonotonic Reasoning

235

(32)

10.1 Nonmonotonic Reasoning

235

(5)

10.2 Stratification and Well-Founded Models

240

(4)

10.2.1 Locally Stratified Programs

241

(1)

10.2.2 Well-Founded Models

242

(2)

10.3 Datalog(1S) and Temporal Reasoning

244

(3)

10.4 XY-Stratification

247

(7)

10.5 Updates and Active Rules

254

(4)

10.6 Nondeterministic Reasoning

258

(5)

10.7 Research Directions

263

(1)

10.8 Bibliographic Notes

264

(1)

10.9 Exercises

265

(2)

Part IV Spatial, Text, and Multimedia Databases

267

(48)

11 Traditional Indexing Methods

269

(26)

11.1 Secondary Keys

269

(5)

11.1.1 Inverted Files

270

(1)

11.1.2 Grid File

270

(2)

11.1.3 k-D Trees

272

(2)

11.1.4 Conclusions

274

(1)

11.2 Spatial Access Methods (SAMs)

274

(11)

11.2.1 Space-Filling Curves

276

(4)

11.2.2 R-Trees

280

(3)

11.2.3 Transformation to Higher-D Points

283

(1)

11.2.4 Conclusions

284

(1)

11.3 Text Retrieval

285

(8)

11.3.1 Full Text Scanning

286

(1)

11.3.2 Inversion

287

(1)

11.3.3 Signature Files

288

(1)

11.3.4 Vector Space Model and Clustering

289

(4)

11.3.5 Conclusions

293

(1)

11.4 Summary and Future Research

293

(1)

11.5 Bibliographic Notes

294

(1)

11.6 Exercises

294

(1)

12 Multimedia Indexing

295

(20)

12.1 Basic Idea

295

(1)

12.2 GEMINI for Whole Match Queries

296

(5)

12.3 1-D Time Series

301

(4)

12.3.1 Distance Function

301

(1)

12.3.2 Feature Extraction and Lower-Bounding

301

(1)

12.3.3 Introduction to DFT

302

(2)

12.3.4 Energy-Concentrating Properties of DFT

304

(1)

12.3.5 Experiments

304

(1)

12.4 2-D Color Images

305

(4)

12.4.1 Image Features and Distance Functions

305

(1)

12.4.2 Lower-Bounding

306

(2)

12.4.3 Experiments and Conclusions

308

(1)

12.5 Subpattern Matching

309

(4)

12.5.1 Sketch of the Approach-ST-Index

309

(3)

12.5.2 Experiments

312

(1)

12.6 Summary and Future Research

313

(1)

12.7 Bibliographic Notes

314

(1)

12.8 Exercises

314

(1)

Part V Uncertainty in Databases and Knowledge Bases

315

(96)

13 Models of Uncertainty

317

(22)

13.1 Introduction

317

(4)

13.1.1 Uncertainty in DBs: An Image Database Example

317

(2)

13.1.2 Uncertainty in DBs: A Temporal Database Example

319

(1)

13.1.3 Uncertainty in DBs: A Null-Value Example

320

(1)

13.2 Models of Uncertainty

321

(14)

13.2.1 Fuzzy Sets

321

(5)

13.2.2 Lattice-Based Approaches

326

(3)

13.2.3 Relationship to Fuzzy Logic

329

(1)

13.2.4 Probability Theory

330

(5)

13.3 Bibliographic Notes

335

(1)

13.4 Exercises

336

(3)

14 Uncertainty in Relational Databases

339

(30)

14.1 Lattice-Based Relational Databases

340

(6)

14.1.1 An Example

344

(1)

14.1.2 Querying Lattice-Based Databases

345

(1)

14.2 Probabilistic Relational Databases

346

(18)

14.2.1 Probabilistic Relations

347

(2)

14.2.2 Annotated Relations

349

(1)

14.2.3 Converting Probabilistic Tuples to Annotated Tuples

350

(2)

14.2.4 Manipulating Annotated Relations

352

(9)

14.2.5 Querying Probabilistic Databases

361

(3)

14.3 Bibliographic Notes

364

(2)

14.4 A Final Note

366

(1)

14.5 Exercises

367

(2)

15 Including Uncertainty in Deductive Databases

369

(42)

15.1 Generalized Annotated Programs (GAPs)

369

(14)

15.1.1 Lattice-Based KBs: Model Theory

371

(3)

15.1.2 Lattice-Based KBs: Fixpoint Theory

374

(4)

15.1.3 Lattice-Based KBs: Query Processing

378

(5)

15.2 Probabilistic Knowledge Bases

383

(22)

15.2.1 Probabilistic KBs: Fixpoint Theory

387

(7)

15.2.2 Probabilistic KBs: Model Theory

394

(5)

15.2.3 Probabilistic KBs: Query Processing

399

(6)

15.3 Bibliographic Notes

405

(2)

15.4 Research Directions

407

(1)

15.5 Summary

408

(1)

15.6 Exercises

408

(3)

Part VI Schema and Database Evolution in Object Database Systems

411

(86)

16 Object Databases and Change Management

413

(24)

16.1 Why Changes Are Needed

413

(1)

16.2 The Essence of Object Databases

414

(21)

16.2.1 Basics of Object Databases

415

(16)

16.2.2 Standards

431

(1)

16.2.3 Change Management in Object Database Systems

432

(3)

16.3 Bibliographic Notes

435

(1)

16.4 Exercises

435

(2)

17 How to Change the Schema

437

(12)

17.1 Changing the Schema Using Primitives

437

(4)

17.1.1 Taxonomy of Schema Modifications

438

(1)

17.1.2 Schema Evolution Primitives in O(2)

439

(2)

17.2 Schema Invariants

441

(4)

17.3 Semantics of Schema Modifications

445

(2)

17.4 Bibliographic Notes

447

(1)

17.5 Exercises

447

(2)

18 How to Change the Database

449

(30)

18.1 Immediate vs. Deferred Transformations

449

(2)

18.1.1 Immediate Database Transformation

450

(1)

18.1.2 Deferred Database Transformation

450

(1)

18.2 Preserving Structural Consistency

451

(3)

18.2.1 Structural Consistency Preserving Primitives

451

(1)

18.2.2 Structural Consistency Modifying Primitives

452

(2)

18.3 User-Defined and Default Transformations

454

(8)

18.3.1 Default Database Transformations

455

(2)

18.3.2 User-Defined Database Transformations

457

(4)

18.3.3 User-Defined Object Migration Functions

461

(1)

18.4 Implementing Database Updates in O(2)

462

(13)

18.4.1 Problems with Deferred Database Transformations

463

(1)

18.4.2 Data Structures

464

(4)

18.4.3 The Deferred Database Update Algorithm

468

(7)

18.5 Related Work

475

(1)

18.6 Bibliographic Notes

476

(1)

18.7 Exercises

477

(2)

19 How to Change the Database Fast

479

(18)

19.1 Factors Influencing the Performance of a Database Transformation

479

(3)

19.1.1 Immediate Database Transformation

480

(1)

19.1.2 Deferred Transformation

480

(1)

19.1.3 Hybrid

481

(1)

19.2 How to Benchmark Database Updates

482

(4)

19.2.1 Basic Benchmark Organization

482

(3)

19.2.2 How to Run the Benchmark

485

(1)

19.3 Performance Evaluation

486

(7)

19.3.1 Small Databases

486

(3)

19.3.2 Large Databases

489

(4)

19.4 Open Problems

493

(2)

19.5 Bibliographic Notes

495

(2)

Bibliography

497

(42)

Author Index

539

(8)

Subject Index

547

(25)

About the Authors

572

Please wait while the item is added to your bag...

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Advanced Database Systems

Summary

Table of Contents

Supplemental Materials

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Advanced Database Systems

Summary

Table of Contents

Supplemental Materials

Digital License