基本信息·出版社：高等教育出版社 ·页码：870 页 ·出版日期：2001年05月 ·ISBN：7040100401 ·条形码：9787040100402 ·版本：第2版 ·装帧：平装 · ...
| 商家名称 |
信用等级 |
购买信息 |
订购本书 |
|
|
 |
数据库:原理编程与性能(影印版)(第2版) |
 |
|
|
数据库:原理编程与性能(影印版)(第2版) |
|
基本信息·出版社：高等教育出版社
·页码：870 页
·出版日期：2001年05月
·ISBN：7040100401
·条形码：9787040100402
·版本：第2版
·装帧：平装
·开本：16
·正文语种：英语
·丛书名：DATABASE:Principles,Programming.and Performance
·外文书名：Database
内容简介 《数据库:原理编程与性能(影印版)(第2版)》自1994年初版以来，已成为学习、设计及使用关系数据库人员的一本经典教材。它从理论和实践两方面对数据库设计和编程均做了严谨的表述。其内容包括关系理论、数据库设计、数据库编程及运行-转储结果。每一部分均从基本原理出发，再用实际系统中的实例来说明。
本次修订版反映了6年来数据库领域总体的进步和发展动态，书中重点讲述了对象关系模型；介绍了一些系统（如Oracle、DB2和Informix等）中通用的新概念；对隔离技术作了更新介绍；对运行结果的表述更现代。相对于初始标准来说，SQL数据库语言有了非常重要的变化，所以对对象关系给予特别讲述。《数据库:原理编程与性能(影印版)(第2版)》还介绍了SQL-99设计方法及与之相关的原理方法及主要产品。《数据库:原理编程与性能(影印版)(第2版)》的作者是在数据库界工作30多年的资深专家，富于教学和实践经验。《数据库:原理编程与性能(影印版)(第2版)》力图在数据库领域各不相同的思想和趋势中找到一个统一的观点提供给读者。
《数据库:原理编程与性能(影印版)(第2版)》对于初接触数据库系统的读者不啻为一本极好的教材；对于那些对数据库领域的发展还未给予足够关注的人是一本易于接受的参考书；同时也是设计人员和编程人员及时更新知识的有用的参考书。
内容: 1. 简介 2. 关系模型 3. 基本SQL查询语言 4. 对象关系SQL 5. 数据库编程访问 6. 数据库设计 7. 完整性、视图、安全性和目录 8. 索引 9. 查询处理 10. 事务更新 11. 并行与分布式数据库 附录A 介绍性指南 附录B 编程细节 附录C SQL语句语言 附录 D 设置查询计数。
作者简介 Parick O'Neil is a professor of computer science at the Uniersity of Massachusetts at Boston. He is responsible for a number of important results in transactonal performance and disk access algorithms,and he holds patents for his work in these and other database areas.
Elizabeth O'Neil is a professor of computer science at the University of Massachusetts at Boston.She serves as a comsult-ant to Sybase IQin Concor, Massachusetts,and has worked with a number of other corporations,includin Microsoft adn Bolt,Beranek,and Newman.
编辑推荐 《数据库:原理编程与性能(影印版)(第2版)》是由高等教育出版社出版。
目录 Foreword
Preface
Chapter 1 Introduction
1.1 Fundamental Database Concepts
History of Database Systems
The Relational and Object-Relational Models
The Database Systems Covered
A Relational Database Example
An Object-Relational Database Example
1.2 Database Users
1.3 Overview of Relational and Object-Relational DBMS
Chapter 2: The Relational Model
Chapter 3: Basic SQL Query Language
Chapter 4: The Object-Relational Model
Chapter 5: Programs to Access a Database
Chapter 6: Database Design
Chapter 7: Integrity, Views, Security, and Catalogs
Chapter 8: Indexing
Chapter 9: Query Processing
Chapter 10: update Transactions
Chapter 11: Parallel and Distributed Databases
1.4 Putting It All Together
Chapter 2 The Relational Model
2.1 The CAP Database
2.2 Naming the Parts of a Database
Domains and Datatypes
Tables and Relations
2.3 Relational Rules
2.4 Keys, Superkeys, and Null Values
Null Values
2.5 Relational algebra
Fundamental Operations of Relational Algebra
2.6 Set-Theoretic Operations
The Union, Intersection, and Difference Operations
Assignment and Alias
The Product Operation
2.7 Native Relational Operations
The Projection Operation
The Selection Operation
Precedence of Relational Operations
The Join Operation
The Division Operation
2.8 The Interdependence of Operations
2.9 Illustrative Examples
2.10 Other Relational Operations
Outer Join
Theta Join
Chapter 3 Basic SQL Query Language
3.1 Introduction
SQL Capabilities
SQL History-Standards and Dialects
3.2 Setting Up the Database
Standard Typographical Conventions
A Practical Exercise
3.3 Simple select Statements
3.4 Subqueries
The IN Predicate
The Quantified Comparison Predicate
The EXISTS Predicate
A Weakness of SQL: Too Many Equivalent Forms
3.5 union Operators and FOR ALL Conditions
The union Operator
Division: SQL "FOR ALL..." Conditions
3.6 Some Advanced SQL Syntax
The INTERSECT and EXCEPT Operators in Advanced SQL
Join Forms in Advanced SQL
OUTER JOIN
Join Forms Implemented in Database Systems
3.7 Set Functions in SQL Handling Null Values
3.8 Groups of Rows in SQL
3.9 A Complete Description of SQL Select
Identifiers
Expressions, Predicates, and the search_condition
Scalar Subqueries as Expressions:Advanced SQL
Basic SQL versus Advanced SQL: Summary
A Discussion of the Predicates
3.10 Insert, Update, and Delete Statements
The Insert Statement
The update Statement
The Delete Statement
3.11 The Power of the select Statement
The Non-Procedural select Statement
Turing Power
Limited Power of the Basic SQL select Statement
Chapter 4 Object-Relational SQL
4.1 Introduction
ORSQL Capabilities
Form of Presentation for This Chapter
Object-Relational History
4.2 Objects and Tables
4.2.1 Object Types in ORACLE
Definition of the REF Object Reference
4.2.2 INFORMIX Row Types for Objects
Absence of Refs in INFORMIX
Type Inheritance in INFORMIX
4.2.3 Objects and Tables: Summary
Object Orientation
4.3 Collection Types
4.3.1 Collection Types in ORACLE
Table Types and Nested Tables
Two Techniques for Retrieving from a Table of Tables
Unnesting via Table Products
Nested Cursors
Array Types for VARRAYs
SQL Syntax for Collections in ORACLE
Inserts and Updates in ORACLE
4.3.2 Collection Types in INFORMIX
Sets in INFORMIX
Lists in INFORMIX
SQL Syntax for Collections in INFORMIX
inserts and Updates in INFORMIX
4.3.3 Collection Types:Summary
4.4 Procedural SQL, User-Defined Functions (UDFs), and Methods
4.4.1 ORACLE PL/SQL Procedures, UDFs, and Methods
PL/SQL: ORACLE's Procedural SQL Language
Using PL/LQL to Implement Methods in ORACLE
Update Methods
4.4.2 INFORMIX User-Defined Functions
SPL:INFORMIX's Procedural SQL Language
Using SPL to Implement UDFs in INFORMIX
Update Functions
4.4.3 User-Defined Functions:Summary
4.5 External Functions and Packaged User-Defined Types(UDTs)
Binary Data and BLOBs
External Functions
Encapsulation
Distinct Types
BLOB Objects
Packaged UDTs and Other Encapsulated UDTs
Summary
Chapter 5 Programs to Access a Database
5.1 Introduction to Access a Database
A Simple Program Using Embedded SQL
Selecting Multiple Rows with a Cursor
5.2 Condition Handling
Whenever Statement:Scope and Flow of Control
Explicit Error Checking
Handling Error:Getting Error Messages from the Database
Indicator Variables
5.3 Some Common Embedded SQL Statements
The select Statement
The Declare Vursor Statement
Chapter 6 Database Design
Chapter 7 Integrity, Views, Security, and Catalogs
Chapter 8 Indexing
Chapter 9 Query Processing
Chapter 10 update Transactions
Chapter 11 Parallel and Distributed Databases
Appendix A Introductory Tutorial
Appendix B Programming Details
Appendix C SQL Statement Syntax
Appendix D Set Query Counts
Solutions to Selected Exercises
Index
……
序言 20世纪末，以计算机和通信技术为代表的信息科学和技术，对世界的经济、军事、科技、教育、文化、卫生等方面的发展产生了深刻的影响，由此而兴起的信息产业已经成为世界经济发展的支柱。进入21世纪，各国为了加快本国的信息产业，加大了资金投入和政策扶持。
为了加快我国信息产业的进程，在我国《国民经济和社会发展第十个五年计划纲要》中，明确提出“以信息化带动工业化，发挥后发优势，实现社会生产力的跨越式发展。”信息产业的国际竞争将日趋激烈。在我国加入WTO后，我国信息产业将面临国外竞争对手的严峻挑战。竞争成败最终将取决于信息科学和技术人才的多少与优劣。
在20世纪末，我国信息产业虽然得到迅猛发展，但与国际先进国家相比，差距还很大。为了赶上并超过国际先进水平，我国必须加快信息技术人才的培养，特别要培养一大批具有国际竞争能力的高水平的信息技术人才，促进我国信息产业和国家信息化水平的全面提高。为此，教育部高等教育司根据教育部吕福源副部长的意见，在长期重视推动高等学校信息科学和技术的教学的基础上，将实施超前发展战略，采取一些重要举措，加快推动高等学校的信息科学和技术等相关专业的教学工作。在大力宣传、推荐我国专家编著的面向21世纪和“九五”重点的信息科学和技术课程教材的基础上，在有条件的高等学校的某些信息科学和技术课程中推动使用国外优秀教材的影印版进行英语或双语教学，以缩短我国在计算机教学上与国际先进水平的差距，同时也有助于强化我国大学生的英语水平。
文摘 插图：
The Courses table in Figure 1.1a lists the set of courses offered,with course numbergiven by cno，course name by cname，the room where the course meets by croom，and thedays and period it meets by time.The time column values are encoded：for example，MW2 means Monday and Wednesday during period 2.The enrollment table has onlythree columns：each row of the table pairs up a student with given student ID，sid，and acourse that the student iS taking，represented by cno，together with whether（Yes or No）the course iS in the student major，major.For example，student 1 has a declared major inmathematics and student 3 has a major in modern languages.The three tables of Figure1.1a together represent a relational database.Note that we use lowercase names（inmonofont type）for tables and column names，but many other texts use uppercase names.
A number of other concepts governing the tabular representation of data in the rela-tional model will be covered starting in Chapter 2,but we mention one concept now,known as the first normal form rule：in the relational model.a column of a table mustcontain a single，unstructured value.The unstructured value constraint implies，for exam-pie，that we cannot place both the last name and first name as separate values that can beseparately set and retrieved in a single column：that iS，we cannot create a column thatlooks like a C struct or lava class.
