adplus-dvertising

Discussion Forum

Que. Which of the following in true regarding Referential Integrity?
a. Every primary-key value must match a primary-key value in an associated table
b. Every primary-key value must match a foreign-key value in an associated table
c. Every foreign-key value must match a primary-key value in an associated table
d. Every foreign-key value must match a foreign-key value in an associated table
Answer:Every foreign-key value must match a primary-key value in an associated table
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

A relational database developer refers to a record as
A primary key if combined with a foreign key creates
The basic operations that can be performed on relations are
The template conclusion is a set of tuples that must be included in the relations in the template dependency called
On a relational database, the kind of constraint which must be specified and does not contain large classes of constraints is considered as
Which of the following in true regarding Referential Integrity?
Who proposed the relational model?
The minimal set of super key is called
The constraint violated when key value in tuple already exists in some other relation's tuple is called
When mapping a binary many-to-many relationship into a relation which of the following is true?
The distribution in which each row denote some related values collection is classified as
A relational database management (RDBM) package manages data in more than one file at once. How does it organize these file? As
In the data model, the inherent constraints are classified as
Relations are:
If you want to group the records in the abc database, you could use the Jobcode as the _____.
What is the best data type definition for Oracle when a field is alphanumeric and has a fixed length?
A _____ is a property of the entire relation, rather than of the individual tuples in which each tuple is unique.
The ordered list of all the n-values is classified as
In a relation schema, each key of schema having more than one key is classified as
The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.