It is a physical representation of the data.
It allows many to many relationship.
It is conceptually simple.
It will be the dominant database of the future.
A. It is a physical representation of the data.
B-Tree
graph
Query Tree
directed graph
With finer degree of granularity of locking a high degree of concurrency is possible.
Locking prevents non-serializable schedules.
Locking cannot take place at field level.
An exclusive lock on data item X is granted even if a shared lock is already held on X.
Oval; An oval with an underlined attribute
Circle; A circle with bolded attribute inside it
Diamond; A bolded attribute
Square; An attribute within the square
BCNF
3NF
PJNF
DKNF
Single
Three
Two
None
Chain
Network
Tree
Relational
m - 1
m + 1
m * m
m
distinct values
cannot have NULL
both (A) & (B)
same as primary key
Logm(n)
(m+n)/2
Logm/2(m+n)
None of these
jamming
password
documentation
record lock
data is defined separately and not included in programs.
programs are not dependent on the physical attributes of data
programs are not dependent on the logical attributes of data
both B and C
Selection operator.
Projection operator.
Aggregation operators.
Division operator.
no redo
no undo
redo but no undo
neither redo nor undo
Lost update problem.
Update anomaly.
Unrepeatable read.
Dirty read.
Software
Server
Program
Client
Union
Intersection
Cartesian Product
Select
Total participation.
Multiple participation.
Cardinality N.
None of the above.
Centralized control of data
Data independence
Both A and B
Neither A nor B
partially committed
active
committed
none of the above
Update Anomaly
Insertion Anomaly
Redundancy
Lost update problem
Standard query language
Sequential query language
Structured query language
Server side query language
ALTER TABLE Staff ALTER position DROP DEFAULT;
ALTER TABLE Staff ALTER position DEFAULT;
ALTER TABLE Staff ALTER DROP DEFAULT;
MODIFY Staff ALTER position DROP DEFAULT;
Clustered
Hashed
Un-clustered
Collision
Statistical
Mathematical
Normalized
Un normalized
Logical
Physical
None
Theoretical
Schema
Tuple
Domain
Relational
It is the data contained in database that is non redundant.
It is the data contained in database that is accurate and consistent.
It is the data contained in database that is secured.
It is the data contained in database that is shared.
Query languages and utilities
DML and query language
Data dictionary and transaction log
Data dictionary and query language
Relations
Queries
Domains
All of the above
Entity
Attribute
Relationship
Notation