Standard query language
Sequential query language
Structured query language
Server side query language
C. Structured query language
Serializable schedule.
Recoverable schedule.
Deadlock free schedule.
Cascadeless schedule.
Tuple
Cardinality
Degree
Domain
Indirect addressing
Indexed addressing
PC relative addressing
Base register addressing
schema
instance of the database
data domain
independence
Entity set
File
Entity instance
Organization
Query
Embedded SQL
DDL
DCL
Clustered
Hashed
Un-clustered
Collision
programming
navigation
functioning
notification
Edgar. W
Edward Stephen
Edgar F. Codd
Edward Codd
DFD
Flowcharts
Gantt Charts
E-R
Code
Codd
Boyce Codd
Boyce
DML compiler
DML pre-processor
DDL interpreter
Query interpreter
View
Order by
Group by
Having
distinct values
cannot have NULL
both (A) & (B)
same as primary key
Sequential
Direct
Index sequential
None of the above
Constraints
Triggers
Stored procedure
Cursors
It will result in a deadlock situation.
It will immediately be rejected.
It will immediately be granted.
It will be granted as soon as it is released by A .
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.
Unary Operator
Ternary Operator
Binary Operator
Not an operator
Double lines
Single line
Dashed lines
Triangle
inner join
full outer join
right outer join
all of the above
Keys
Program
Translators
Language Activity
RAM
Flash
Hard Disk
Secondary
Table
Tree like structure
Complex logical relationship
Records
(i) and (ii)
(iv) only
(i) and (iv)
(ii) and (iii)
Partition constraint.
Dependency preservation.
Redundancy.
Security.
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
Logical
Physical
None
Theoretical
GROUP BY Clause
HAVING Clause
FROM Clause
WHERE Clause
Referential constraint.
Index.
Integrity constraint.
Functional dependency.