Fundamentals of Database Systems (7th Edition)
Language: English
Pages: 1272
ISBN: 0133970779
Format: PDF / Kindle (mobi) / ePub
For database systems courses in Computer Science
This book introduces the fundamental concepts necessary for designing, using, and implementing database systems and database applications. Our presentation stresses the fundamentals of database modeling and design, the languages and models provided by the database management systems, and database system implementation techniques.
The book is meant to be used as a textbook for a one- or two-semester course in database systems at the junior, senior, or graduate level, and as a reference book. The goal is to provide an in-depth and up-to-date presentation of the most important aspects of database systems and applications, and related technologies. It is assumed that readers are familiar with elementary programming and data-structuring concepts and that they have had some exposure to the basics of computer organization.
Build Your Own PaaS with Docker
Stochastic Models for Fault Tolerance: Restart, Rejuvenation and Checkpointing
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architecture (6th Edition)
Of 893 © Copyright 2000 by Ramez Elmasri and Shamkant B. Navathe 1 Page 162 of 893 Part 2: Relational Model, Languages, and Systems (Fundamentals of Database Systems, Third Edition) Chapter 7: The Relational Data Model, Relational Constraints, and the Relational Algebra Chapter 8: SQL - The Relational Database Standard Chapter 9: ER- and EER-to-Relational Mapping, and Other Relational Languages Chapter 10: Examples of Relational Database Management Systems: Oracle and Microsoft Access.
Given or in the preferred order of each individual instructor. Selected chapters and sections may be left out, and the instructor can add other chapters from the rest of the book, depending on the emphasis of the course. At the end of each chapter’s opening section, we list sections that are candidates for being left out whenever a less detailed discussion of the topic in a particular chapter is desired. We suggest covering up to Chapter 14 in an introductory database course and including.
Summary...............................................................................................................................593 Review Questions.........................................................................................................................594 Exercises.......................................................................................................................................595 Selected Bibliography.
Each leaf node, on the average, will hold 0.69 * pleaf = 0.69 * 31 or approximately 21 data record pointers. A B+-tree will have the following average number of entries at each level: Root: 1 node 22 entries 23 pointers Level 1: 23 nodes 506 entries 529 pointers Level 2: 529 nodes 11,638 entries 12,167 pointers Leaf level: 12,167 nodes 255,507 record pointers For the block size, pointer size, and search field size given above, a three-level B+-tree holds up to 255,507 record.
Fewer tree pointer and search value are needed. This can propagate and reduce the tree levels. Notice that implementing the insertion and deletion algorithms may require parent and sibling pointers for each node, or the use of a stack as in Algorithm 6.3. Each node should also include the number of entries in it and its type (leaf or internal). Another alternative is to implement insertion and deletion as recursive procedures. Variations of B-Trees and B+-Trees To conclude this section, we.