Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom

Database Systems: The Complete Book (eBook, PDF)

Pearson New International Edition

• Format: PDF

Produktbeschreibung

For Database Systems and Database Design and Application courses offered at the junior, senior and graduate levels in Computer Science departments.

Written by well-known computer scientists, this introduction to database systems offers a comprehensive approach, focusing on database design, database use, and implementation of database applications and database management systems.

The first half of the book provides in-depth coverage of databases from the point of view of the database designer, user, and application programmer. It covers the latest database standards SQL:1999, SQL/PSM, SQL/CLI, JDBC, ODL, and XML, with broader coverage of SQL than most other texts. The second half of the book provides in-depth coverage of databases from the point of view of the DBMS implementor. It focuses on storage structures, query processing, and transaction management. The book covers the main techniques in these areas with broader coverage of query optimisation than most other texts, along with advanced topics including multidimensional and bitmap indexes, distributed transactions, and information integration techniques.

The full text downloaded to your computer

With eBooks you can:

• search for key concepts, words and phrases
• make highlights and notes as you study
• share your notes with friends

eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps.

Upon purchase, you'll gain instant access to this eBook.

Time limit

The eBooks products do not have an expiry date. You will continue to access your digital ebook products whilst you have your Bookshelf installed.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Pearson HigherEducation
• Seitenzahl: 1140
• Altersempfehlung: ab 18 Jahre
• Erscheinungstermin: 29. August 2013
• Englisch
• ISBN-13: 9781292037301
• Artikelnr.: 41939572

Autorenporträt

Hector Garcia-Molina is the L. Bosack and S. Lerner Professor of Computer Science and Electrical Engineering at Stanford University. His research interests include digital libraries, information integration, and database applications on the Internet. He was a recipient of the SIGMOD Innovations Award and a member of PITAC (President's Information-Technology Advisory Council). He currently serves on the Board of Directors of Oracle Corp.

Jeffrey D. Ullman is the Stanford W. Ascherman Professor of Computer Science (emeritus) at Stanford University. He is the author or co-author of 16 books, including Elements of ML Programming. His research interests include data mining, information integration, and electronic education. He is a member of the National Academy of Engineering, and recipient of a Guggenheim Fellowship, the Karl V. Karlstom Outstanding Educator Award, the SIGMOD Contributions and Edgar F. Codd Innovations Awards, and the Knuth Prize.

Jennifer Widom is Professor of Computer Science and Electrical Engineering at Stanford University. Her research interests span many aspects of nontraditional data management. She is an ACM Fellow and a member of the National Academy of Engineering, she received the ACM SIGMOD Edgar F. Codd Innovations award in 2007 and was a Guggenheim Fellow in 2000, and she has served on a variety of program committees, advisory boards, and editorial boards.

Inhaltsangabe

 TABLE OF CONTENTS
 
1 The Worlds of Database Systems
   1.1 The Evolution of Database Systems
   1.1.1 Early Database Management Systems
   1.1.2 Relational Database Systems
   1.1.3 Smaller and Smaller Systems
   1.1.4 Bigger and Bigger Systems
   1.1.5 Information Integration
   1.2 Overview of a Database Management System
   1.2.1 Data-Definition Language Commands
   1.2.2 Overview of Query Processing
   1.2.3 Storage and Buffer Management
   1.2.4 Transaction Processing
   1.2.5 The Query Processor
   1.3 Outline of Database-System Studies
   1.4 References for Chapter 1
 
PART I: Relational Database Modeling
 
2 The Relational Model of Data
   2.1 An Overview of Data Models
   2.1.1 What is a Data Model?
   2.1.2 Important Data Models
   2.1.3 The Relational Model in Brief
   2.1.4 The Semistructured Model in Brief
   2.1.5 Other Data Models
   2.1.6 Comparison of Modeling Approaches
   2.2 Basics of the Relational Model
   2.2.1 Attributes
   2.2.2 Schemas
   2.2.3 Tuples
   2.2.4 Domains
   2.2.5 Equivalent Representations of a Relation
   2.2.6 Relation Instances
   2.2.7 Keys of Relations
   2.2.8 An Example Database Schema
   2.2.9 Exercises for Section 2.2
   2.3 Defining a Relation Schema in SQL
   2.3.1 Relations in SQL
   2.3.2 Data Types
   2.3.3 Simple Table Declarations
   2.3.4 Modifying Relation Schemas
   2.3.5 Default Values
   2.3.6 Declaring Keys
   2.3.7 Exercises for Section 2.3
   2.4 An Algebraic Query Language
   2.4.1 Why Do We Need a Special Query Language?
   2.4.2 What is an Algebra?
   2.4.3 Overview of Relational Algebra
   2.4.4 Set Operations on Relations
   2.4.5 Projection
   2.4.6 Selection
   2.4.7 Cartesian Product
   2.4.8 Natural Joins
   2.4.9 Theta-Joins
   2.4.10 Combining Operations to Form Queries
   2.4.11 Naming and Renaming
   2.4.12 Relationships Among Operations
   2.4.13 A Linear Notation for Algebraic Expressions
   2.4.14 Exercises for Section 2.4
   2.5 Constraints on Relations
   2.5.1 Relational Algebra as a Constraint Language
   2.5.2 Referential Integrity Constraints
   2.5.3 Key Constraints
   2.5.4 Additional Constraint Examples
   2.5.5 Exercises for Section 2.5
   2.6 Summary of Chapter 2
   2.7 References for Chapter 2
3 Design Theory for Relational Databases
   3.1 Functional Dependencies
   3.1.1 Definition of Functional Dependency
   3.1.2 Keys of Relations
   3.1.3 Superkeys
   3.1.4 Exercises for Section 3.1
   3.2 Rules About Functional Dependencies
   3.2.1 Reasoning About Functional Dependencies
   3.2.2 The Splitting/Combining Rule
   3.2.3 Trivial Functional Dependencies
   3.2.4 Computing the Closure of Attributes
   3.2.5 Why the Closure Algorithm Works
   3.2.6 The Transitive Rule
   3.2.7 Closing Sets of Function