Logical schema.
Physical schema.
Subschema.
None of the above.
D. None of the above.
Select * from R natural join S.
Select * from R cross join S.
Select * from R union join S.
Select * from R inner join S.
Data security
Derived columns
Hiding of complex queries
All of the above
Unary Operator
Ternary Operator
Binary Operator
Not an operator
no redo
no undo
redo but no undo
neither redo nor undo
Entity
Attribute
Relationship
Notation
Total participation.
Multiple participation.
Cardinality N.
None of the above.
Union
Intersection
Cartesian Product
Select
primary key
secondary key
foreign key
none of the above
programming
navigation
functioning
notification
<>
<
=<
>=
Standard query language
Sequential query language
Structured query language
Server side query language
Logical schema.
Physical schema.
Subschema.
None of the above.
Table
Tree like structure
Complex logical relationship
Records
Double lines
Single line
Dashed lines
Triangle
DFD
Flowcharts
Gantt Charts
E-R
Relation
Tuple
Database
Domain
DISTINCT
NO DUPLICATE
UNIQUE
None of the above
Vulcanizing
Galvanizing
Magnetizing
Passing UV rays
Schema
Tuple
Domain
Relational
Clustered
Hashed
Un-clustered
Collision
Understand each user's perspective of data
Understand the data itself irrespective of the physical representation
Understand the use of data across application areas
All of the above
TCL
DCL
DDL
DML
backup
assertion
recovery
trigger
is the entire database
Describes how data is actually stored on disk.
is a standard way of organizing information into accessible parts.
All of the above
Selection operator.
Projection operator.
Aggregation operators.
Division operator.
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.
building indices
pipelining
join ordering
none of the above
read Q
write Q
both read and write Q
write Q but not read Q
Logical
Physical
None
Theoretical
Raw data
Source
Information
Useful data