Which of the following concurrency control schemes is not based on the serializability property?
Two - phase locking
Graph-based locking
Time-stamp based locking
None of these .
Correct Answer :
D. None of these .
Related Questions
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
Which of the following is not a recovery technique?
Deferred update
Immediate update
Two-phase commit
Shadow paging
Checkpoints are a part of
Recovery measures.
Security measures.
Concurrency measures.
uthorization measures.
The drawback of shadow paging technique are
Commit overhead
Data fragmentation
Garbage collection
All of these
In multiple granularity of locks SIX lock is compatible with
IX
IS
S
SIX
SQL server stores index information in the _____system table
system indexes
syst indexes
sys indexes
sysind
Which normal form is considered adequate for normal relational database design?
2NF
5NF
4NF
3NF
The fact that information in the data warehouse changes far less often and may be regarded as non-real-time with periodic updating; This implies that data warehouses are _______
Volatile
Non - Volatile
Logical
Physical
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
The ______ key of a relation is the attribute (column) or collection of attributes, which uniquely identify a given tuple.
Primary
Foreign
Candidate
Alternate
The normal form that is not necessarily dependency preserving is
2NF
3NF
BCNF
4NF
In E-R Diagram total participation is represented by
Double lines
Single line
Dashed lines
Triangle
Which of the following addressing modes permits relocation without any change over in the code?
Indirect addressing
Indexed addressing
PC relative addressing
Base register addressing
Which of the following is not a consequence of concurrent operations?
Lost update problem.
Update anomaly.
Unrepeatable read.
Dirty read.
A top-to-bottom relationship among the items in a database is established by a
Hierarchical schema
Network schema
Relational Schema
All of the above
A relational database developer refers to a record as
an attribute
a tuple
a criteria
a relation
If a transaction T has obtained an exclusive lock on item Q, then T can
read Q
write Q
both read and write Q
write Q but not read Q
In an ER model,_____ is described in the database by storing its data.
Entity
Attribute
Relationship
Notation
The graphical representation of a query is .
B-Tree
graph
Query Tree
directed graph
When an E-R diagram is mapped to tables, the representation is redundant for
weak entity sets
weak relationship sets
strong entity sets
strong relationship sets
_____ is a utility to capture a continuous record of server activity and provide auditing capability.
SQL server Profile
SQL server wizard.
SQL server service manager
SQL server setup
Which is the best file organization when data is frequently added or deleted from a file?
Sequential
Direct
Index sequential
None of the above
Maximum height of a B+ tree of order m with n key values is
Logm(n)
(m+n)/2
Logm/2(m+n)
None of these
………………… approach reduces time and effort required for design and lesser risk in database management.
Single global database
Multiple databases
Top-down approach
None of the above
Relational Algebra is
Data Definition Language .
Meta Language
Procedural query Language
None of the above
Grant and revoke are _____ statements.
TCL
DCL
DDL
DML
Precedence graphs help to find a
Serializable schedule.
Recoverable schedule.
Deadlock free schedule.
Cascadeless schedule.
What is data integrity?
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.
______is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
Domain Integrity Constraints
Referential Integrity Constraints
Domain Constraints
Entity Integrity Constraints
_____ command can be used to modify a column in a table
alter
update
set
create