數(shù)據(jù)庫系統(tǒng)

前言

此教材的第二版將會(huì)發(fā)行兩個(gè)版本：本書的版本，主要是入門性內(nèi)容，適合本科生或研究生的數(shù)據(jù)庫初級(jí)課程。另一個(gè)版本則是完全版，適合以下三方面的課程。數(shù)據(jù)庫入門課程，面向本科生或研究生。事務(wù)處理方面的課程，面向?qū)W習(xí)過數(shù)據(jù)庫入門性課程的本科生或研究生。關(guān)于數(shù)據(jù)庫的本科生高級(jí)課程或者研究生初級(jí)課程，面向?qū)W習(xí)過數(shù)據(jù)庫入門性課程的學(xué)生。我們的目標(biāo)之一就是減少入門版本的篇幅，使學(xué)生更容易接受。另一個(gè)目標(biāo)是在使用本書第一版所獲經(jīng)驗(yàn)的基礎(chǔ)上，盡量使本版本更加完善。本書的章節(jié)不僅僅是完全版的子集。我們認(rèn)為講授數(shù)據(jù)庫入門課程的教師應(yīng)該選擇增加對(duì)象數(shù)據(jù)庫和XML（完全版中許多章節(jié)詳細(xì)敘述的主題），以豐富這門課程的內(nèi)容。因此在本書中，我們新加了兩章，第16章“對(duì)象數(shù)據(jù)庫緒論”和第17章“xML與Web數(shù)據(jù)緒論”，都是從本書完全版中經(jīng)過適當(dāng)挑選出來的內(nèi)容。為了使本書能與迅速發(fā)展的技術(shù)保持同步，我們?cè)诒緯鴥蓚€(gè)版本的許多章節(jié)中加入了大量關(guān)于UML的內(nèi)容，并且新加了一章關(guān)于數(shù)據(jù)庫優(yōu)化的內(nèi)容（第12章）。正如第一版，我們主要關(guān)注如何利用數(shù)據(jù)庫來創(chuàng)建應(yīng)用程序，而不是如何創(chuàng)建數(shù)據(jù)庫管理系統(tǒng)本身。我們相信，開發(fā)應(yīng)用程序的學(xué)生比創(chuàng)建DBMs的學(xué)生要多得多。因此，本書加入了大量關(guān)于通過事務(wù)訪問數(shù)據(jù)庫的語言（如嵌入式SQL、ODB和API的內(nèi)容。盡管本書涵蓋了許多關(guān)于數(shù)據(jù)庫和事務(wù)處理應(yīng)用程序的實(shí)用內(nèi)容，但是我們更關(guān)心這些主題的基本概念，而不是特定的商用系統(tǒng)或應(yīng)用程序的細(xì)節(jié)。因此，我們把重點(diǎn)集中在關(guān)系和對(duì)象數(shù)據(jù)模型的概念上。即使在SQL過時(shí)很久之后，這些概念仍然是數(shù)據(jù)庫處理的基礎(chǔ)。為了加強(qiáng)學(xué)生對(duì)技術(shù)內(nèi)容的理解，我們?cè)黾恿艘粋€(gè)事務(wù)處理應(yīng)用程序的案例，即貫徹全書的“學(xué)生注冊(cè)系統(tǒng)”。盡管一個(gè)學(xué)生注冊(cè)系統(tǒng)可能并不吸引人，但它有一個(gè)獨(dú)特的優(yōu)勢(shì)，即所有學(xué)生都曾作為用戶和這樣的系統(tǒng)進(jìn)行過交互。更重要的是，“麻雀雖小，五臟俱全”，因此我們可以用它來闡述在數(shù)據(jù)庫設(shè)計(jì)、查詢處理和事務(wù)處理等方面的諸多問題。本書的一個(gè)重要特點(diǎn)就是將“學(xué)生注冊(cè)系統(tǒng)”作為例子，介紹了用來實(shí)現(xiàn)事務(wù)處理應(yīng)用程序所需的軟件工程概念。由于許多信息系統(tǒng)的實(shí)現(xiàn)因?yàn)轫?xiàng)目管理不善和軟件工程的欠缺而最終夭折，因此我們認(rèn)為這些內(nèi)容應(yīng)成為學(xué)生教育中一個(gè)重要組成部分。由于許多學(xué)生還需要在這方面另修專門的課程，因此本書對(duì)軟件工程問題的處理是簡(jiǎn)明扼要的。然而，我們相信，如果學(xué)生們看到這些內(nèi)容在信息系統(tǒng)實(shí)現(xiàn)中會(huì)涉及，他們能更好地理解并應(yīng)用它。由于在Stony Brook使用本教材的課程不是軟件工程課程，因此我們上課時(shí)不涉及這些內(nèi)容。事實(shí)上，我們要求學(xué)生課后閱讀并在他們的課程項(xiàng)目中很好地利用軟件工程實(shí)踐。我們?cè)谡n堂上會(huì)介紹“學(xué)生注冊(cè)系統(tǒng)”的特點(diǎn)，以說明關(guān)于數(shù)據(jù)庫和事務(wù)處理的重要問題。

內(nèi)容概要

　　《數(shù)據(jù)庫系統(tǒng)：面向應(yīng)用的方法（第2版影印版）》講解了數(shù)據(jù)庫系統(tǒng)的基本知識(shí)，介紹了數(shù)據(jù)庫設(shè)計(jì)與實(shí)現(xiàn)的原理及其應(yīng)用。主要內(nèi)容包括數(shù)據(jù)庫與事務(wù)概述、關(guān)系數(shù)據(jù)模型、實(shí)體–關(guān)系圖數(shù)據(jù)庫概念建模與UML語言、關(guān)系代數(shù)與SQL、關(guān)系正則理論的數(shù)據(jù)庫設(shè)計(jì)、觸發(fā)與活動(dòng)數(shù)據(jù)庫、SQL應(yīng)用、物理數(shù)據(jù)組織與索引、查詢處理基礎(chǔ)、查詢優(yōu)化概述、數(shù)據(jù)庫調(diào)制、事務(wù)處理概述、軟件工程需求與規(guī)范、數(shù)據(jù)庫設(shè)計(jì)、編碼與測(cè)試、對(duì)象數(shù)據(jù)庫概述、XML與網(wǎng)絡(luò)數(shù)據(jù)概述?！稊?shù)據(jù)庫系統(tǒng)：面向應(yīng)用的方法（第2版影印版）》提供了從多角度了解數(shù)據(jù)庫知識(shí)的途徑?！稊?shù)據(jù)庫系統(tǒng)：面向應(yīng)用的方法（第2版影印版）》配有各章電子教案、圖稿電子文檔、在線習(xí)題解答、參考資料鏈接、作業(yè)與測(cè)試題。《數(shù)據(jù)庫系統(tǒng)：面向應(yīng)用的方法（第2版影印版）》適用于高等院校本科計(jì)算機(jī)及相關(guān)專業(yè)的數(shù)據(jù)庫系統(tǒng)課程。

作者簡(jiǎn)介

作者：(美)基弗 伯恩斯坦 劉易斯

書籍目錄

PrefacePART ONE Introduction1 Overview of Databases and Transactions1.1 What Are Databases and Transactions?1.2 Features of Modern Database and Transaction Processing Systems1.3 Major Players in the Implementation and Support of Databaseand Transaction Processing Systems1.4 Decision Support Systems——-OLAP and OLTP2 The Big Picture2.1 Case Study：A Student Registration System2.2 Introduction to Relational Databases2.3 What Makes a Program a Transaction——The ACID PropertiesBibliographic NotesExercisesPART Two Database Management3 The RelationaI Data ModeI3.1 What Is a Data Model?3.2 The Relational Model3.2.1 Basic Concepts3.2.2 Integrity Constraints3.3 SQData Definition Sublanguage3.3.1 Specifying the Relation Type3.3.2 The System Catalog3.3.3 Key Constraints3.3.4 Dealing with Missing Information3.3.5 Semantic Constraints3.3.6 User.Defined Domains3.3.7 Foreign.Key Constraints3.3.8 Reactive Constraints3.3.9 Database Views3.3.10 Modifying Existing Definitions3.3.11 SOL.Schemas3.3.12 Access ControlBibliographic NotesExercises4 Conceptual Modeling of Databases with Entity-Relationship Diagrams and the Unified Modeling Language4.1 Conceptual Modeling with the E-R Approach4.2 Entities and Entity Types4.3 Relationships and Relationship Types4.4 Advanced Features in Conceptual Data Modeling4.4.1 Entity Type Hierarchies4.4.2 Participation Constraints4.4.3 The Part.of Relationship4.5 From E.R Diagrams to Relational Database Schemas4.5.1 Representation of Entities4.5.2 Representation of Relationships4.5.3 Representing IsA Hierarchies in the Relational Model4.5.4 Representation of Participation Constraints4.5.5 Representation of the Part—of Relationship4.6 UML：A New Kid on the Block4.6.1 Representing Entities in UML4.6.2 Representing Relationships in UML4.6.3 Advanced Modeling Concepts in UML4.6.4 Translation to SQL4.7 A Brokerage Firm Example4.7.1 An Entity－Relationship Design4.7.2 A UML Design4.8 Case Study：A Database Design for the Student Registration System4.8.1 The Database Part of the Requirements Document4.8.2 The Database Design4.9 Limitations of Data Modeling MethodologiesBibliographic NotesExercises5 Relational Algebra and SQL5.1 Relational Algebra: Under the Hood of SQL 5.1.1 Basic Operators 5.1.2 Derived Operators5.2 The Query Sub]ansuage of SQL5.2.1 Simple SQL Queries 5.2.2 Set Operations  5.2.3 Nested Queries 5.2.4 Quantified Predicates 5.2.5 Aggregation over Data 5.2.6 Join Expressions in the FROM Clause 5.2.7 A Simple Query Evaluation Algorithm 5.2.8 More on Views in SQL 5.2.9 Materialized Views 5.2.10 The Null Value Quandary 5.3 Modifying Relation Instances in SQL5.3.1 Inserting Data 5.3.2 Deleting Data 5.3.3 Updating Existing Data5.3.4 Updates on Views Bibliographic Notes Exercises 6 Database Design with the Relational Normalization Theory  6.1 The Problem of Redundancy6.2 Decompositions 6.3 Functional Dependencies6.4 Properties of Functional Dependencies 6.5 Normal Forms 6.5.1 The Boyce-Codd Normal Form 6.5.2 The Third Normal Form 6.6 Properties of Decompositions 6.6.1 Lossless and Lossy Decompositions 6.6.2 Dependency-Preserving Decompositions6.7 An Algorithm for BCNF Decomposition6.8 Synthesis of 3NF Schemas 6.8.1 Minimal Cover 6.8.2 3NF Decomposition through Schema Synthesis 6.8.3 BCNF Decomposition through 3NF Synthesis 6.9 The Fourth Normal Form6.10 Advanced 4NF Design6.10.1 MVDs and Their Properties 6.10.2 The Difficulty of Designing for 4NF 6.10.3 A 4NF Decomposition How-To 6.11 Summary of Normal Form Decomposition 6.12 Case Study: Schema Refinement for the Student Registration System 6.13 Tuning Issues: To Decompose or Not to Decompose? Bibliographic Notes Exercises 7 Triggers and Active Databases7.1 What Is a Trigger? 7.2 Semantic Issues in Trigger Handling 7.3 Triggers in SQL:1999 7.4 Avoiding a Chain ReactionBibliographic Notes Exercises 8 Using SQL in an Application8.1 What Are the Issues Involved?8.2 Embedded SQL 8.2.1 Status Processing 8.2.2 Sessions, Connections, and Transactions8.2.3 Executing Transactions 8.2.4 Cursors 8.2.5 Stored Procedures on the Server 8.3 More on Integrity Constraints 8.4 Dynamic SQL 8.4.1 Statement Preparation in Dynamic SQL 8.4.2 Prepared Statements and the Descriptor Area8.4.3 Cursors 8.4.4 Stored Procedures on the Server 8.5 JDBC and SQLJ 8.5.1 JDBC Basics 8.5.2 Prepared Statements 8.5.3 Result Sets and Cursors8.5.4 Obtaining Information about a Result Set 8.5.5 Status ProcessingprocessingPART THREE Optimizing DBMS Performance and Traansaction ProcessingPART FOUR Software Engineering lssues and documentationPART FIVE Advanced topics in databasesBibliographyIndex

章節(jié)摘錄

插圖：In contrast to non-exclusive part-of relationships, the exclusive ones are repre-sented within the E-R approach using the special machinery of weak entity typesand identifying relationships. Weak entities represent subparts and identifying re-lationships are the corresponding exclusive part-of relationships. In our examples,PROGRAM and DEPENDENT are weak entity types that are related through identi-fying relationships to their master entity types （which represent whole entities）,UNWERSITY and EMPLOYEE. In E-R diagrams, weak entities and their identifying re-lationships are represented using double boxes and double diamonds, respectively. Observe that weak entities always participate in their identifying relationshipsand that each such entity is related to a single master object. Thus, there is alwaysa thick arrow going from a weak entity to its identifying relationship, as shown inFigure 4.11. Sometimes designers choose to strip weak entity types of their key attributesand have the entities identified through their relationship with the master entity.For example, the DEPENDENT entity might have the Name attribute, but not the SSBattribute. To find a dependent entity, one would have to first find the correspondingmaster （an EMPLOYEE entity） and then follow the identifying relationship. Note that the identifying relationship is not the only kind of relationship inwhich a weak entity can take part. For instance, PROGRAM in Figure 4.11 can berelated to another entity type, EMPLOYEE, via the relationship PROGRAMDIRECTOR.This relationship would not be identifying for PROGRAM （since a program mightnot have a director）, and thus it would be represented using a single diamond. Itis also conceivable （although not common） that a weak entity type can participate

編輯推薦

《數(shù)據(jù)庫系統(tǒng):面向應(yīng)用的方法(第2版影印版)》是一流的品質(zhì)，優(yōu)惠的價(jià)格。

圖書封面

評(píng)論、評(píng)分、閱讀與下載

---

    數(shù)據(jù)庫系統(tǒng) PDF格式下載

---