Database Systems Concepts with Oracle CD
Format: PDF / Kindle (mobi) / ePub
The Fourth edition of Database System Concepts has been extensively revised from the 3rd edition. The new edition provides improved coverage of concepts, extensive coverage of new tools and techniques, and updated coverage of database system internals. This text is intended for a first course in databases at the junior or senior undergraduate, or first-year graduate level. Database System Concepts, 4th ed. offers a complete background in the basics of database design, languages, and system implementations. Concepts are presented using intuitive descriptions, and important theoretical results are covered, but formal proofs are omitted. The fundamental concepts and algorithms covered in Database System Concepts 4th ed. are based on those used in existing commercial or experimental database systems. The authors present these concepts and algorithms in a general setting that is not tied to one particular database system.
processing (OLAP) techniques, SQL:1999 support for OLAP, data mining, and data warehousing. The chapter also describes information retrieval techniques for 4 Silberschatz−Korth−Sudarshan: Database System Concepts, Fourth Edition xviii Front Matter Preface © The McGraw−Hill Companies, 2001 Preface querying textual data, including hyperlink-based techniques used in Web search engines. Chapter 23 covers advanced data types and new applications, including temporal data, spatial and
hierarchical data models are still in use. For the beneﬁt of readers who wish to learn about these data models, we provide appendices describing the network and hierarchical data models, in Appendices A and B respectively; the appendices are available only online (http://www.bell-labs.com/topic/books/db-book). Appendix C describes advanced relational database design, including the theory of multivalued dependencies, join dependencies, and the project-join and domain-key normal forms. This
Entity−Relationship Model Entity-Relationship Model 2.5 Entity-Relationship Diagram As we saw brieﬂy in Section 1.4, an E-R diagram can express the overall logical structure of a database graphically. E-R diagrams are simple and clear — qualities that may well account in large part for the widespread use of the E-R model. Such a diagram consists of the following major components: • Rectangles, which represent entity sets • Ellipses, which represent attributes • Diamonds, which represent
discriminating attribute of weak entity set A many-to-one relationship R l..h R E cardinality limits ISA ISA (specialization or generalization) ISA disjoint generalization role indicator total generalization 57 disjoint Symbols used in the E-R notation. • Whether to use a strong or a weak entity set (Section 2.6); a strong entity set and its dependent weak entity sets may be regarded as a single “object” in the database, since weak entities are existence dependent on a strong
Rabbit Williams Gates street Toon Tunnel Seaview null Figure 3.34 city Hollywood Carrotville Seattle null Result of employee branch-name Mesa Mesa Redmond Redmond 1 ft-works. salary 1500 1300 1500 5300 118 Silberschatz−Korth−Sudarshan: Database System Concepts, Fourth Edition 110 Chapter 3 I. Data Models © The McGraw−Hill Companies, 2001 3. Relational Model Relational Model employee-name Coyote Rabbit Williams Smith Gates street Toon Tunnel Seaview Revolver null Figure 3.35