Question
a.
relational synthesis algorithm
b.
decomposition algorithm
c.
schema synthesis algorithm
d.
none of above
Posted under Relational Databases DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as
Similar Questions
Discover Related MCQs
Q. The ordered list of all the n-values is classified as
View solution
Q. A number of related records that are treated as a unit is called
View solution
Q. When mapping a ternary relationship with an associative entity into a relation which of the following is true?
View solution
Q. A _____ database does not use pointers or physical links, but instead finds related records by examining the contents of fields.
View solution
Q. If no multivalued attributes exist in a relation, then the relation is in what normal form?
View solution
Q. Domain constraints, functional dependency and referential integrity are special forms of _________.
View solution
Q. A primary key is which of the following?
View solution
Q. The constraints that are applied on individual tuples and are verified whenever any tuple is modified or new tuple is inserted are called
View solution
Q. Which of the following improves a query's processing time?
View solution
Q. A row of table in relational model terminology is classified as
View solution
Q. On a relational database, the kind of constraint which must be specified and does not contain large classes of constraints is considered as
View solution
Q. The ______ is the one in which the primary key of one relation is used as a normal attribute in another relation .
View solution
Q. When the primary key is null of the new tuple then the constraint violated is
View solution
Q. The constraints which deals with the changes in the database are classified as
View solution
Q. A Relation is a
View solution
Q. If a denormalization situation exists with a many-to-many or associative binary relationship, which of the following is true?
View solution
Q. The RDBMS terminology for a row is
View solution
Q. When mapping a multivalued attribute into a relation which of the following is true?
View solution
Q. The minimal set of super key is called
View solution
Q. Key to represent relationship between tables is called
View solution
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!