Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

Designing a database
Example Database Design
Entity-Relationship Model
E-R Model: What it is
Entity Sets and Attributes
Types of Attributes
Relationship Sets
Cardinality Constraints / Mapping Cardinalities / Cardinality Ratios
Participation Constraints
Cardinality Limits
Weak Entity Sets
Discriminator / Partial Key of a Weak Entity Set
How the primary key of a weak entity set is formed
Placement of descriptive attributes in a weak entity set
Participation of weak entity sets in relationships
Weak entity sets – should they be designed as multivalued attributes?
Specialization and Generalization
Reduction of E-R Schemas to Tables
Strong Entity Sets
One-to-One Relationship
One-to-Many Relationship
Many-to-One Relationship
Many-to-Many Relationship
Composite Attributes
Multivalued Attributes
E-R Diagram Symbols at a Glance
DML: Data-Manipulation Language
DML (Data-Manipulation Language): What it is
Query Language
The SELECT Operation / Statement
Relational Algebra
Fundamental Relational Algebra Operations
The Selection Operation
The Projection Operation
Composition of the Relational Operations
The Union Operation
The Set-Difference Operation
The Cartesian-Product Operation
The Rename Operation
Additional Relational Algebra Operations
The Set-intersection Operation
The Natural Join Operation
Extended Relational Algebra Operations
The Outer Join Operation
Generalized Projection
Aggregate Functions
Modification of Database
Indexing and Hashing
The Problem
Basic Concepts
Types of Indices
Index Technique Choosing Factors
Ordered Indices
Primary / Clustering Index
Secondary / Non-Clustering Index
Index-Sequential Files
Contents of an index record / entry
Types of ordered indices
Dense Index
Dense index for primary indices
Another implementation of dense indices
Sparse Index
Comparative Analysis of Dense and Sparse Index
A good trade-off
Why this trade-off is good
Multi-Level Indices
The problem with single-level indices
Solution to this problem
Secondary Indices
Tree Index
The Problem with Indexed-Sequential File Organization
Tree Index Solves the Problem
Tree File Organization
B-Tree Index
Advantages of B-Tree
Disdvantages of B-Tree
The Problem with Sequential File Organization and How Hashing Solves It
Hash File Organization
Manipulation of Records in Hash Files
Hash Functions
Distribution Qualities for Choosing a Hash Function
Some Examples Illustrating These Qualities
How Hash Functions Should be Designed
Handling of Bucket Overflows
Causes of bucket overflows
Reducing bucket overflows
Handling bucket overflows
Hash Indices
Static and Dynamic Hashing
Drawbacks of Hashing
Comparison of Ordered Indexing and Hashing
Multiple-Key Indices
Problem with Multiple Single-Key Indices
Advantages of Using Multiple-Key Indices
Index Definitions in SQL
Creating an Index
Removing an Index
0 of .
Results for:
No results containing your search query
P. 1
DBMS - An Interactive Tutorial (B&W)

DBMS - An Interactive Tutorial (B&W)

Ratings: (0)|Views: 2,793|Likes:
Published by Saurabh Sharma

More info:

Published by: Saurabh Sharma on May 31, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 6 to 53 are not shown in this preview.

Activity (21)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Harsha Tai liked this
Raveena Wadhwa liked this
Pallabi Saha liked this
Albert Lekaj liked this
Pranay Kesarwani liked this
ketanap liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->