In b-tree the number of keys in each node is than the number of its children.
one less
same
one more
half
Correct Answer :
A. one less
Related Questions
A ______ module is typically designed so that it will run on a user workstation or personal computer.
Software
Server
Program
Client
Dependency preservation is not guaranteed in
BCNF
3NF
PJNF
DKNF
Protection of data from unauthorized Disclosure results in loss of _______
Integrity
Availability
Confidentiality
Discretionary Security
The set of all values that can be taken by the attribute is called as _______ of the attribute.
Tuple
Cardinality
Degree
Domain
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
The collection of information stored in a database at a particular moment is called as ......
schema
instance of the database
data domain
independence
HSAM stands for ……….
Hierarchic Standard Access Method
Hierarchic Sequential Access Method
Hierarchic Sequential and Method
Hierarchic Standard and Method
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
If the closure of an attribute set is the entire relation then the attribute set is a
superkey
candidate key
primary key
not a key
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
Which of the following is not a recovery technique?
Deferred update
Immediate update
Two-phase commit
Shadow paging
Immediate database modification technique uses
Both undo and redo.
Undo but no redo.
Redo but no undo.
Neither undo nor redo.
Precedence graphs help to find a
Serializable schedule.
Recoverable schedule.
Deadlock free schedule.
Cascadeless schedule.
What is a disjoint less constraint?
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.
Which one is true statement :
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.
The keyword to eliminate duplicate rows from the query result in SQL is
DISTINCT
NO DUPLICATE
UNIQUE
None of the above
Relational Algebra is
Data Definition Language .
Meta Language
Procedural query Language
None of the above
Create a table with the following attributes: Employee(EMPNO integer, EMPNAME of 10 characters)
Create table Employee(EMPNO int, EMPNAME char(10));
Create table Employee(EMPNO integer, EMPNAME String(10));
Create table Emplo(EMPNO number, EMPNAME string);
Create table Emp(EMPNO int, EMPNAME char(10));
Which of the following statement on the view concept in SQL is invalid?
All views are not updateable
The views may be referenced in an SQL statement whenever tables are referenced.
The views are instantiated at the time they are referenced and not when they are defined.
The definition of a view should not have GROUP BY clause in it.
Union operator is a :
Unary Operator
Ternary Operator
Binary Operator
Not an operator
The common column is eliminated in
theta join
outer join
natural join
composed join
Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are
distinct values
cannot have NULL
both (A) & (B)
same as primary key
Cascading rollback is avoided in all protocol except
strict two-phase locking protocol.
tree locking protocol
two-phase locking protocol
validation based protocol.
The ____ operator joins two or more conditions and displays rows only if that rows data satisfies all conditions specified.
OR
AND
NOT
ALL
Employees in a company are each assigned their own office, i.e. for each employee there exists a unique office and for each office there exists a unique employee; This statement is an example of ____ type of relation.
1:1
1: Many
Many: One
Many : Many
____ table store information about database or about the system.
SQL
System
Nested
None of these
In SQL the statement select * from R, S is equivalent to
Select * from R natural join S.
Select * from R cross join S.
Select * from R union join S.
Select * from R inner join S.
The cost of reading and writing temporary files while evaluating a query can be reduced by
building indices
pipelining
join ordering
none of the above
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
Which of the following constitutes a basic set of operations for manipulating relational data?
Predicate calculus
Relational calculus
Relational algebra
SQL