9780321268457

Database Systems An Application Oriented Approach, Compete Version

by ; ;
  • ISBN13:

    9780321268457

  • ISBN10:

    0321268458

  • Edition: 2nd
  • Format: Paperback
  • Copyright: 3/16/2005
  • 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: $15.75
    Check/Direct Deposit: $15.00

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 copy of this book is 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

Database Systems: An Application Oriented Approach, Complete Version, Second Edition presents the principles underlying the design and implementation of databases and database applications, covering Object Databases, Security, XML and Data Mining and Web Services topics.

Author Biography

Philip Lewis is a professor in the Department of Computer Science at the State University of New York at Stony Brook.

Table of Contents

Introduction
Overview of Databases and Transactions What Are Databases and Transactions? Features of Modern Database and Transaction Processing Systems Major Players in the Implementation and Support of Database and Transaction Processing Systems Decision Support SystemsOLAP and OLTP
The Big Picture Case Study: A Student Registration System Introduction to Relational Databases What Makes a Program a TransactionThe ACID Properties Bibliographic Notes Exercises
Database Management
The Relational Data Model What Is a Data Model? The Relational Model SQLData Definition Sublanguage Bibliographic Notes Exercises
Conceptual Modeling of Databases with Entity-Relationship Diagrams and the Unified Modeling Language Conceptual Modeling with the E-R Approach Entities and Entity Types Relationships and Relationship Types Advanced Features in Conceptual Data Modeling From E-R Diagrams to Relational Database Schemas UML: A New Kid on the Block A Brokerage Firm Example Case Study: A Database Design for the Student Registration System Limitations of Data Modeling Methodologies Bibliographic Notes Exercises
Relational Algebra and SQL Relational Algebra: Under the Hood of SQL The Query Sublanguage of SQL Modifying Relation Instances in SQL Bibliographic Notes Exercises
Database Design with the Relational Normalization Theory The Problem of Redundancy Decompositions Functional Dependencies Properties of Functional Dependencies Normal Forms Properties of Decompositions An Algorithm for BCNF Decomposition Synthesis of 3NF Schemas The Fourth Normal Form Advanced 4NF Design Summary of Normal Form Decomposition Case Study: Schema Refinement for the Student Registration System Tuning Issues: To Decompose or Not to Decompose? Bibliographic Notes Exercises
Triggers and Active Databases What Is a Trigger? Semantic Issues in Trigger Handling Triggers in SQL Avoiding a Chain Reaction Bibliographic Notes Exercises
Using SQL in an Application What Are the Issues Involved? Embedded SQL More on Integrity Constraints Dynamic SQL JDBC and SQLJ ODBC Comparison Bibliographic Notes Exercises
Optimizing DBMS Performance
Physical Data Organization and Indexing Disk Organization Heap Files Sorted Files Indices Multilevel Indexing Hash Indexing Special-Purpose Indices Tuning Issues: Choosing Indices for an Application Bibliographic Notes Exercises
The Basics of Query Processing Overview of Query Processing External Sorting Computing Projection, Union, and Set Difference Computing Selection Computing Joins Multirelational Joins Computing Aggregate Functions Bibliographic Notes Exercises
An Overview of Query Optimization Query Processing Architecture Heuristic Optimization Based on Algebraic Equivalences Estimating the Cost of a Query Execution Plan Estimating the Size of the Output Choosing a Plan Bibliographic Notes Exercises
Database Tuning Disk Caches Tuning the Schema Tuning the Data Manipulation Language Tools Managing Physical Resources Influencing the Optimizer B
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review