strict two-phase locking protocol.
tree locking protocol
two-phase locking protocol
validation based protocol.
D. validation based protocol.
Aggregation
Association
Weak entity sets
Weak relationship sets
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.
2NF
3NF
BCNF
1NF
Chain
Network
Tree
Relational
Raw data
Source
Information
Useful data
BCNF
3NF
PJNF
DKNF
Union.
Set difference.
Intersection.
All of the above.
4,0
0,0
4,5
8,5
Standard query language
Sequential query language
Structured query language
Server side query language
Union
Intersection
Cartesian Product
Select
add an attribute
delete an attribute
alter the default values of an attribute
all of the above
TCL
DCL
DDL
DML
Conceptual level data hiding.
External level data hiding.
Physical level data hiding.
None of these.
Deferred update
Immediate update
Two-phase commit
Shadow paging
read Q
write Q
both read and write Q
write Q but not read Q
It requires that an entity belongs to no more than one level entity set.
The same entity may belong to more than one level.
The database must contain an unmatched foreign key value.
An entity can be joined with another entity in the same level entity set.
Tuple
Cardinality
Degree
Domain
IX
IS
S
SIX
Relations
Queries
Domains
All of the above
Sequential
Direct
Index sequential
None of the above
theta join
outer join
natural join
composed join
Single global database
Multiple databases
Top-down approach
None of the above
Commit overhead
Data fragmentation
Garbage collection
All of these
None
Multi
Single
Concurrent
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.
UPDATE S CITY = KANPUR WHERE SNO=S1
UPDATE S SET CITY = KANPUR FOR SNO=S1
UPDATE S SET CITY = KANPUR WHERE SNO=S1
UPDATE S RENAME CITY = KANPUR WHERE SNO=S1
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.
Constraints
Triggers
Stored procedure
Cursors
Default
Index
Rule
View
weak entity sets
weak relationship sets
strong entity sets
strong relationship sets