Whenever two independent one-to-many relationships are mixed in the same relation, a __________ arises.
Functional dependency
Multi-valued dependency
Transitive dependency
Partial dependency
Correct Answer :
B. Multi-valued dependency
Related Questions
The transactions like adding an employee, enrolling a student in a course are examples of _______
Logical
Physical
None
Theoretical
In E-R Diagram total participation is represented by
Double lines
Single line
Dashed lines
Triangle
_____ First proposed the process of normalization.
Edgar. W
Edward Stephen
Edgar F. Codd
Edward Codd
For correct behaviour during recovery, undo and redo operation must be
Commutative
Associative
idempotent
distributive
The data in the database at a particular moment of time is called the _______
Snapshot
Dynaset
Stateless
Stateful
_______ product was acquired by Informix, integrated into its RDBMS and introduced as the Informix Universal Server an ORDBMS.
Star
llustar
SQL
Cygnus
The normalization was first proposed by .
Code
Codd
Boyce Codd
Boyce
Which of the following is a reason to model data?
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
The ______ key of a relation is the attribute (column) or collection of attributes, which uniquely identify a given tuple.
Primary
Foreign
Candidate
Alternate
Which of the following is not a recovery technique?
Deferred update
Immediate update
Two-phase commit
Shadow paging
_____is a full form of SQL.
Standard query language
Sequential query language
Structured query language
Server side query language
The drawback of shadow paging technique are
Commit overhead
Data fragmentation
Garbage collection
All of these
Which of the following is not a characteristic of a relational database model?
Table
Tree like structure
Complex logical relationship
Records
Given the following relation S(SNO,SNAME,CITY) write a query to update the value of CITY to KANPUR for the supplier S1.
UPDATE S CITY = KANPUR WHERE SNO=S1
UPDATE S SET CITY = KANPUR FOR SNO=S1
UPDATE S SET CITY = KANPUR WHERE SNO=S1
UPDATE S RENAME CITY = KANPUR WHERE SNO=S1
The concept of mapping of ______ entity types is the concept in which the for each strong entity type E in the ER schema, create a relation R that includes all the simple attributes of E.
Regular
Irregular
None
Weak
It is an abstraction through which relationships are treated as higher level entities
Generalization.
Specialization.
Aggregation.
Inheritance.
DBMS helps achieve
Centralized control of data
Data independence
Both A and B
Neither A nor B
Processed data is called _____
Raw data
Source
Information
Useful data
______defines the structure of a relation which consists of a fixed set of attribute-domain pairs.
Instance
Program
Schema
Super Key
The graphical representation of a query is .
B-Tree
graph
Query Tree
directed graph
Relational Algebra is
Data Definition Language .
Meta Language
Procedural query Language
None of the above
In multiple granularity of locks SIX lock is compatible with
IX
IS
S
SIX
In an ER model,_____ is described in the database by storing its data.
Entity
Attribute
Relationship
Notation
In a relational schema, each tuple is divided into fields called
Relations
Queries
Domains
All of the above
Key to represent relationship between tables is called
primary key
secondary key
foreign key
none of the above
A ______ module is typically designed so that it will run on a user workstation or personal computer.
Software
Server
Program
Client
Which of the following aggregate functions does not ignore nulls in its results?.
COUNT .
COUNT (*)
MAX
MIN
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.
DFD stands for
Data Flow Document
Data File Diagram
Data Flow Diagram
Non of the above
Which of the following relational algebraic operations is not from set theory?
Union
Intersection
Cartesian Product
Select