The normalization was first proposed by .
Code
Codd
Boyce Codd
Boyce
Correct Answer :
B. Codd
Related Questions
Wait-for graph is used for
detecting view serializability.
detecting conflict serializability.
deadlock prevention
deadlock detection
A ______ module is typically designed so that it will run on a user workstation or personal computer.
Software
Server
Program
Client
operator is used to compare a value to a list of literals values that have been specified.
Like
COMPARE
BETWEEN
IN
Which of the following is not a consequence of non-normalized database?
Update Anomaly
Insertion Anomaly
Redundancy
Lost update problem
HSAM stands for ……….
Hierarchic Standard Access Method
Hierarchic Sequential Access Method
Hierarchic Sequential and Method
Hierarchic Standard and Method
A _____ is used to define overall design of the database
code
data definition language
application program
schema
A _____ is a logical unit of database processing that includes one or more data access operations that can include insertion, deletion, modification or retrieval operations.
Database
Data
Transaction
Record
The metadata is created by the
DML compiler
DML pre-processor
DDL interpreter
Query interpreter
The ______ indexes are forced to store only record IDs in the data structure and require at least one additional I/O Operation to retrieve the actual record.
Clustered
Hashed
Un-clustered
Collision
The full form of GUI is _________
Government Union Internet
Graphical Unit Interface
Graphical User Interface
Graphical University Interface
Relations produced from an E-R model will always be
First normal form.
Second normal form.
Third normal form.
Fourth normal form.
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
Processed data is called _____
Raw data
Source
Information
Useful data
The common column is eliminated in
theta join
outer join
natural join
composed join
The ____ operator joins two or more conditions and displays rows only if that rows data satisfies all conditions specified.
OR
AND
NOT
ALL
______contains information that defines valid values that are stored in a column or data type.
Default
Index
Rule
View
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.
The clause alter table in SQL can be used to
add an attribute
delete an attribute
alter the default values of an attribute
all of the above
If both the functional dependencies : X�Y and Y�X hold for two attributes X and Y then the relationship between X and Y is
M:N
M:1
1:M
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 _____ category includes storage media that can be operated on directly by the computers central processing unit.
Primary storage
Secondary Storage
All
Tertiary Storage
An advantage of the database management approach is
data redundancy increases
data is dependent on programs
data is integrated and can be accessed by multiple programs
none of the above
The ______ language consists of SQL statements for operating on the data (insert, Modify, Delete) in tables that already exist.
Data Manipulation
Data Definition
Data Control
None
The values of the attribute describes a particular
Entity set
File
Entity instance
Organization
_____ First proposed the process of normalization.
Edgar. W
Edward Stephen
Edgar F. Codd
Edward Codd
Which of the following is not a logical database structure?
Chain
Network
Tree
Relational
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
A relational database developer refers to a record as
an attribute
a tuple
a criteria
a relation
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
The graphical representation of a query is .
B-Tree
graph
Query Tree
directed graph