Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
An Introduction to Data Base Design provides an understanding of how data base management systems (DBMS) work to be able to use any available commercial DBMS intelligently. This book presents the principle of independence of physical and local organization.
Organized into seven chapters, this book begins with an overview of normal form theory. This text then describes the three types of DBMS. Other chapters consider the difficulties in processing queries where the names of the files are not mentioned. This book discusses as well how to group data hierarchically, how to use a preorder tree traversal to represent the data, and how to convert a network organization to a hierarchical one. The final chapter deals with four essential issues in data base theory, namely, recovery, security, integrity, and concurrency.
This book is a valuable resource for computer science students in the junior or senior year, and people in industry who are doing technical work using data bases.
1-2 What a DBMS Provides
1-3 Views, Subschema, and Data Independence
1-4 How to Begin
2 Normal Form Design Theory
2-2 First Normal Form
2-3 Functional Dependence
2-6 Higher Normal Forms and Projections
2-7 Boyce Codd Normal Form
2-8 Lossless Join and Preservation of Dependencies
2-9 Third Normal Form
2-11 Fourth Normal Form
3 Relational Data Bases
3-2 Complete Relational Data Bases
3-3 SQL and QUEL
3-5 Microcomputer DBMSs
3-6 Some Efficiency Considerations
3-7 Query Optimization
3-8 Queries Without File Names
4 Network Data Bases (CODASYL)
4-2 The CODASYL Data Definition Language
4-3 The CODASYL Data Manipulation Language
4-4 Using a CODASYL DBMS Interactively
4-5 CODASYL DML Host Language Procedures
5 Hierarchical Data Bases (IMS)
5-2 The IMS Data Definition Language
5-3 Storage Options in IMS
5-4 IMS Data Manipulation Language, DL/1
5-5 Host Language Procedures for Relational Queries
6 Physical Organization
6-3 Hashing Algorithms
7 Integrity, Concurrency, Recovery and Security
1 A Case Study
2 Construct Your Own Relational Data Base
3 Create a CODASYL Data Definition Language Compiler
4 Relational Algebra and Relational Calculus Notation
Answers to Selected Exercises
- No. of pages:
- © Academic Press 1986
- 1st January 1986
- Academic Press
- eBook ISBN:
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.