Vor Ort
Merkzettel Warenkorb
Produktbild: Database Systems: The Complete Book

Database Systems: The Complete Book

106,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

17.07.2013

Verlag

Pearson Education Limited

Seitenzahl

1140

Maße (L/B/H)

27,6/21,6/6,1 cm

Gewicht

2660 g

Auflage

2

Sprache

Englisch

ISBN

978-1-292-02447-9

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

17.07.2013

Verlag

Pearson Education Limited

Seitenzahl

1140

Maße (L/B/H)

27,6/21,6/6,1 cm

Gewicht

2660 g

Auflage

2

Sprache

Englisch

ISBN

978-1-292-02447-9

Herstelleradresse

Pearson
St.-Martin-Straße 82
81541 München
DE

Email: salesde@pearson.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Database Systems: The Complete Book

  •  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