9780131873254

Database Systems The Complete Book

by ; ;
  • ISBN13:

    9780131873254

  • ISBN10:

    0131873253

  • Edition: 2nd
  • Format: Hardcover
  • Copyright: 6/5/2008
  • Publisher: Pearson

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

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $47.25
    Check/Direct Deposit: $45.00
List Price: $214.79 Save up to $109.20
  • Rent Book $128.87
    Add to Cart Free Shipping

    TERM
    PRICE
    DUE

Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Summary

This introduction to database systems offers a comprehensive approach, focusing on database design, database use, and implementation of database applications and database management systems.KEY TOPICS: 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 covers databases from the point of view of the DBMS implementor, focusing on storage structures, query processing, and transaction management. The book covers the main techniques in these areas with broader coverage of query optimization than most other texts, along with advanced topics including multidimensional and bitmap indexes, distributed transactions, and information integration techniques. Ideal for professionals and students interested in database systems. A basic understanding of algebraic expressions and laws, logic, basic data structure, OOP concepts, and programming environments is implied.

Author Biography

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 (Prentice Hall 1998). 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.

Table of Contents

The Worlds of Database Systems
The Evolution of Database Systems
Early Database Management Systems
Relational Database Systems
Smaller and Smaller Systems
Bigger and Bigger Systems
Information Integration1.2 Overview of a Database Management System
Data-Definition Language Commands
Overview of Query Processing
Storage and Buffer Management
Transaction Processing
The Query Processor1.3 Outline of Database-System Studies1.4 References for Chapter 1I Relational Database Modeling2 The Relational Model of Data2.1 An Overview of Data Models
What is a Data Model?
Important Data Models
The Relational Model in Brief
The Semistructured Model in Brief
Other Data Models
Comparison of Modeling Approaches2.2 Basics of the Relational Model
Attributes
Schemas
Tuples
Domains2 CONTENTS
Equivalent Representations of a Relation
Relation Instances
Keys of Relations
An Example Database Schema
Exercises for Section
De ning a Relation Schema in SQL
Relations in SQL
Data Types
Simple Table Declarations
Modifying Relation Schemas
Default Values
Declaring Keys
Exercises for Section
An Algebraic Query Language
Why Do We Need a Special Query Language?
What is an Algebra?
Overview of Relational Algebra
Set Operations on Relations
Projection
Selection
Cartesian Product
Natural Joins
Theta-Joins
Combining Operations to Form Queries
Naming and Renaming
Relationships Among Operations
A Linear Notation for Algebraic Expressions
Exercises for Section
Constraints on Relations
Relational Algebra as a Constraint Language
Referential Integrity Constraints
Key Constraints
Additional Constraint Examples
Exercises for Section
Summary of Chapter 22.7 References for Chapter
Design Theory for Relational Databases3.1 Functional Dependencies
De nition of Functional Dependency
Keys of Relations
Superkeys
Exercises for Section
Rules About Functional Dependencies
Reasoning About Functional Dependencies
The Splitting/Combining Rule
Trivial Functional Dependencies
Computing the Closure of Attributes
Why the Closure Algorithm Works
The Transitive Rule
Closing Sets of Functional Dependencies
Projecting Functional Dependencies
Exercises for Section
Design of Relational Database Schemas
Anomalies
Decomposing Relations
Boyce-Codd Normal Form
Decomposition into BCNF
Exercises for Section
Decomposition: The Good, Bad, and Ugly
Recovering Information from a Decomposition
The Chase Test for Lossless Join
Why the Chase Works
Dependency Preservation
Exercises for Section
Third Normal Form
Definition of Third Normal Form
The Synthesis Algorithm for 3NF Schemas
Why the 3NF Synthesis Algorithm Works
Exercises for Section
Multivalued Dependencies
Attribute Independence and Its ConsequentRedundancy
Definition of Multivalued Dependencies
Reas
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review