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
Correct Answer :
B. Non - Volatile
Related Questions
Data independence means
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
HSAM stands for ……….
Hierarchic Standard Access Method
Hierarchic Sequential Access Method
Hierarchic Sequential and Method
Hierarchic Standard and Method
As per equivalence rules for query transformation, selection operation distributes over
Union.
Set difference.
Intersection.
All of the above.
In SQL the word natural can be used with
inner join
full outer join
right outer join
all of the above
What are the desirable properties of a decomposition
Partition constraint.
Dependency preservation.
Redundancy.
Security.
Which of the syntax is correct for insert statement?
i) insert into values
ii) insert into (column list) values
ii) insert into
i-only
ii-only
Both of them
None of them
Immediate database modification technique uses
Both undo and redo.
Undo but no redo.
Redo but no undo.
Neither undo nor redo.
An advantage of views is
Data security
Derived columns
Hiding of complex queries
All of the above
Consider the join of relation R with a relation S. If R has m tuples and S has n tuples, then the maximum and minimum size of the join respectively are
m+n and 0
m+n and |m-n|
mn and 0
mn and m+n
Relational Algebra does not have
Selection operator.
Projection operator.
Aggregation operators.
Division operator.
Isolation of the transactions is ensured by
Transaction management
Application programmer
Concurrency control
Recovery management
The part of a database management system which ensures that the data remains in a consistent state is
authorization and integrity manager
buffer manager
transaction manager
file manager
DROP is a statement in SQL.
Query
Embedded SQL
DDL
DCL
Which of the following is not a property of transactions?
Atomicity
Concurrency
Isolation
Durability
In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the following is incorrect :
Operationally, if Y is deleted, so is X
existence is dependent on Y.
Operationally, if X is deleted, so is Y.
Operationally, if X is deleted, & remains the same.
It is an abstraction through which relationships are treated as higher level entities
Generalization.
Specialization.
Aggregation.
Inheritance.
In E-R Diagram total participation is represented by
Double lines
Single line
Dashed lines
Triangle
………………… 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
Which of the following constitutes a basic set of operations for manipulating relational data?
Predicate calculus
Relational calculus
Relational algebra
SQL
Which of the following relational algebra operations do not require the participating tables to be union-compatible?
Union
Intersection
Difference
Join
The set of all values that can be taken by the attribute is called as _______ of the attribute.
Tuple
Cardinality
Degree
Domain
A relation is in attribute of other composite key. if an attribute of a composite key is dependent on an
2NF
3NF
BCNF
1NF
If an entity can belong to only one lower level entity then the constraint is
disjoint
partial
overlapping
single
In a multi-user database, if two users wish to update the same record at the same time, they are prevented from doing so by
jamming
password
documentation
record lock
DFD stands for
Data Flow Document
Data File Diagram
Data Flow Diagram
Non of the above
Which normal form is considered adequate for normal relational database design?
2NF
5NF
4NF
3NF
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
______defines the structure of a relation which consists of a fixed set of attribute-domain pairs.
Instance
Program
Schema
Super Key
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
_____ database is used to provide statistical information or summaries of values based on various criteria.
Statistical
Mathematical
Normalized
Un normalized