數(shù)據(jù)庫系統(tǒng)實(shí)現(xiàn)

前言

This book covers the core of the material taught in the database sequence at Stanford. The introductory course, CS145, uses the first twelve chapters, and is designed for all students -those who want to use database systems as well as those who want to get involved in database implementation. The second course, CS245 on database implementation, covers most of the rest of the book. However, some material is covered in more detail in special topics courses. These include CS346 （implementation project）, which concentrates on query optimization as in Chapters 15 and 16. Also, CS345A, on data mining and Web mining, covers the material in the last two chapters.What's New in the Second Edition After a brief introduction in Chapter 1, we cover relational modeling in Chapters 2-4. Chapter 4 is devoted to high-level modeling. There, in addition to the E/R model, we now cover UML （Unified Modeling Language）. We also have moved to Chapter 4 a shorter version of the material on ODL, treating it as a design language for relational database schemas.The material on functional and multivalued dependencies has been mod- ified and remains in Chapter 3.  We have changed our viewpoint, so that a functional dependency is assumed to have a set of attributes on the right. We have also given explicitly certain algorithms, including the "chase," that allow us to manipulate dependencies.  We have augmented our discussion of third normal form to include the 3NF synthesis algorithm and to make clear what the tradeoff between 3NF and BCNF is.Chapter 5 contains the coverage of relational algebra from the previous edition, and is joined by （part of） the treatment of Dataiog from the old Chap- ter 10. The discussion of recursion in Datalog is either moved to the book's Web site or combined with the treatment of recursive SQL in Chapter 10 of this edition.Chapters 6-10 are devoted to aspects of SQL programming, and they repre- sent a reorganization and augmentation of the earlier book's Chapters 6, 7, 8, and parts of 10. The material on views and indexes has been moved to its own chapter.

內(nèi)容概要

本書是關(guān)于數(shù)據(jù)庫系統(tǒng)實(shí)現(xiàn)方面內(nèi)容最為全面的著作之一，是美國斯坦福大學(xué)計算機(jī)科學(xué)專業(yè)數(shù)據(jù)庫系列課程第二門課程的指定教材。書中從數(shù)據(jù)庫實(shí)現(xiàn)者的角度對數(shù)據(jù)庫系統(tǒng)實(shí)現(xiàn)原理進(jìn)行了深入闡述。并具體討論了數(shù)據(jù)庫管理系統(tǒng)的三個主要成分——存儲管理器、查詢處理器和事務(wù)管理器的實(shí)現(xiàn)技術(shù)。斯坦福大學(xué)計算機(jī)科學(xué)專業(yè)數(shù)據(jù)庫系列課程第一門課程的內(nèi)容包括數(shù)據(jù)庫設(shè)計和數(shù)據(jù)庫編程。本書的后兩位作者Jeffrey D.UIIman和Jennifer Widom為該課程編寫的教材《數(shù)據(jù)庫系統(tǒng)基礎(chǔ)教程》（A First Course in Database Systems）第3版的中文翻譯版和英文影印版已由機(jī)械工業(yè)出版社出版。    本書內(nèi)容深入且全面，技術(shù)實(shí)用且先進(jìn)，敘述深入淺出，是一本難得的高層次的教材，適合作為高等院校計算機(jī)專業(yè)研究生的教材或本科生的教學(xué)參考書，也適合作為從事相關(guān)研究或開發(fā)工作的專業(yè)技術(shù)人員的高級參考資料。

作者簡介

加西亞－莫利納（Hector Garcia-Molina）斯坦福大學(xué)計算機(jī)科學(xué)與電子工程系的Leonard Bosack和Sandra Lerner教授。他在數(shù)據(jù)庫系統(tǒng)、分布式系統(tǒng)和數(shù)字圖書館領(lǐng)域中發(fā)表了大量論文。研究興趣包括分布式計算系統(tǒng)、數(shù)據(jù)庫系統(tǒng)和數(shù)字圖書館。他是ACM會士、美國藝術(shù)與科學(xué)院會士和

書籍目錄

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Ⅰ　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　　　……Ⅱ　Relational Database ProgrammingⅢ  Modeling and Programming for Semistructured DataⅣ  Database System Implementation

章節(jié)摘錄

插圖：13.2 DisksThe use of secondary storage is one of the important characteristics of a DBMS, and secondary storage is almost exclusively based on magnetic disks. Thus, to motivate many of the ideas used in DBMS implementation, we must examine the operation of disks in detail.13.2.1 Mechanics of DisksThe two principal moving pieces of a disk drive are shown in Fig. 13.2; they are a disk assembly and a head assembly. The disk assembly consists of one or more circular platters that rotate around a central spindle. The upper and lower surfaces of the platters are covered with a thin layer of magnetic material, on which bits are stored. O's and l's are represented by different patterns in the magnetic material. A common diameter for disk platters is 3.5 inches, although disks with diameters from an inch to several feet have been built.The disk is organized into tracks, which are concentric circles on a single platter. The tracks that are at a fixed radius from the center, among all the surfaces, form one cylinder. Tracks occupy most of a surface, except for the region closest to the spindle, as can be seen in the top view of Fig. 13.3. The density of data is much greater along a track than radially. In 2008, a typical disk has about 100,000 tracks per inch but stores about a million bits per inch along the tracks.Tracks are organized into sectors, which are segments of the circle separated by gaps that are not magnetized to represent either O's or l's.1 The sector is an indivisible unit, as far as reading and writing the disk is concerned. It is also indivisible as far as errors are concerned.

編輯推薦

《數(shù)據(jù)庫系統(tǒng)實(shí)現(xiàn)(英文版第2版)》：經(jīng)典原版書庫

圖書封面

圖書標(biāo)簽Tags

無

評論、評分、閱讀與下載

---

    數(shù)據(jù)庫系統(tǒng)實(shí)現(xiàn) PDF格式下載

---