The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as

DBMS - RELATIONAL DATABASES MCQ

• A Relation is a
• In mathematical term Table is referred as
• In mathematical term Row is referred as
• _______ allow us to identify uniquely a tuple in the relation
• Minimal Superkeys are called
• Who proposed the relational model?
• Data Manipulation Language (DML) is not to
• Which of the following in true regarding Referential Integrity?
• How many types of keys in Database Design?
• The minimal set of super key is called
• Foreign key is the one in which the ________ of one relation is referenced in another relation
• Domain constraints, functional dependency and referential integrity are special forms of _________
• Which one of the following uniquely identifies the elements in the relation?
• A _____ is a property of the entire relation, rather than of the individual tuples in which each tuple is unique
• Which one of the following attribute can be taken as a primary key ?
• Which one of the following cannot be taken as a primary key ?
• A attribute in a relation is a foreign key if the _______ key from one relation is used as an attribute in that relation
• The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as primary key is called
• The ______ is the one in which the primary key of one relation is used as a normal attribute in another relation
• A _________ integrity constraint requires that the values appearing in specified attributes of any tuple in the referencing relation also appear in specified attributes of at least one tuple in the referenced relation
• Row is synonymous with the term:
• The primary key is selected from the:
• Which of the following is a group of one or more attributes that uniquely identifies a row?
• A relation is considered a:
• In the relational model, relationships between relations or tables are created by using:
• Table is synonymous with the term:
• Which of the following is not a restriction for a table to be a relation?
• A key:
• An attribute is a(n):
• A tuple is a(n):
• In the relational models, cardinality is termed as:
• In a relational model, relations are termed as
• A relational database developer refers to a record as
• The relational model feature is that there
• Key to represent relationship between tables is called
• In a relation
• The RDBMS terminology for a row is
• Which of the operations constitute a basic set of operations for manipulating relational data?
• A primary key is combined with a foreign key creates
• A primary key if combined with a foreign key creates
• The relational model consists of:
• A primary key is which of the following?
• A foreign key is which of the following?
• Relations are:
• A relation has which of the following properties?
• The entity integrity rule states that:
• When mapping a multivalued attribute into a relation which of the following is true?
• When mapping a regular entity into a relation which of the following is true?
• When mapping a binary many-to-many relationship into a relation which of the following is true?
• When mapping a many-to-many unary relationship into a relation which of the following is true?
• When mapping a ternary relationship with an associative entity into a relation which of the following is true?
• When mapping a supertype/subtype relationship which of the following is true?
• If no multivalued attributes exist in a relation, then the relation is in what normal form?
• If no multivalued attributes exist and no partial dependencies exist in a relation, then the relation is in what normal form?
• A transitive dependency is which of the following?
• What is the best data type definition for Oracle when a field is alphanumeric and has a fixed length?
• If a denormalization situation exists with a many-to-many or associative binary relationship, which of the following is true?
• Which of the following is an advantage of partitioning?
• Sequential retrieval on a primary key for sequential file storage has which of the following features?
• A rule of thumb for choosing indexes for a relational database includes which of the following?
• Which of the following are integrity controls that a DBMS may support?
• A secondary key is which of the following?
• The fastest read/write time and most efficient data storage of any disk array type is:
• Which of the following improves a query's processing time?
• The blocking factor is:
• Which of the following is not a relational database?
• A list consists of last names, first names, addresses, and pin codes if all people in the list have the same last and the same pin code, a useful key would be
• A number of related records that are treated as a unit is called
• If you want to group the records in the abc database, you could use the Jobcode as the _____
• Which of the following is not characteristic of a relational database model?
• A _____ database does not use pointers or physical links, but instead finds related records by examining the contents of fields
• A compound key
• If a piece of data is stored in two places in the database, then
• A relational database management (RDBM) package manages data in more than one file at once. How does it organize these file? As
• When the primary key is null of the new tuple then the constraint violated is
• In formal relational model, the set of indivisible values is called
• In relational model terminology, the table is considered as
• The key which specifies that two different tuples cannot have the same value is classified as
• The format or data type must be specified for
• In a relation schema, each key of schema having more than one key is classified as
• In the data model schemas, the constraints that are can not be expressed directly are classified as
• The cardinality in relational data model is considered as
• The constraint violated when the given value of attribute is not included in the corresponding domain is
• If two or more constraints are violated by using insert operation then by default the
• In the data model, the inherent constraints are classified as
• The multi-valued dependencies and functional dependencies are classified as category of
• The model in which the multi-valued and composite attributes is considered as
• The type of constraint in which value of each attribute (X) must be an indivisible value from domain (X) is classified as
• The constraints which deals with the changes in the database are classified as
• The multivalued dependencies used to develop relational design theory of database is classified as
• In the data model schemas, the constraints that are expressed directly are classified as
• In relational database schemas, the transition constraints are also known as
• A row of table in relational model terminology is classified as
• The constraint which is used to specify the consistency in two or more relations among tuples is classified as
• The ordered list of all the n-values is classified as
• The state in which the database follows all the integrity constraints is classified as
• The column header of table in relational model terminology is classified as
• The operation which violates only one constraint called referential integrity when it is performed is called
• The distribution in which each row denote some related values collection is classified as
• When the foreign key refers to a tuple which does not exists in subjected relation then the constraint violated is
• The basic operations that can be performed on relations are
• In relational database schemas, the state constraints are also known as
• The tuples in relation are sensitive to
• The state in which the database does not follow integrity constraints is classified as
• The type of constraint which states that not even a single value with primary key can be a null value is classified as
• The values which cannot be divided further are classified as
• On a relational database, the kind of constraint which must be specified and does not contain large classes of constraints is considered as
• The definition of relation in which values and attributes are ordered in tuple is classified as
• The constraint violated when key value in tuple already exists in some other relation's tuple is called
• The normal form which consider all the types of constraints and dependencies is classified as
• The tuples that are represented in one of two relations and are lost if the JOIN operation is performed are called
• The inclusion dependencies that are preceding are used to represent
• The template conclusion is a set of tuples that must be included in the relations in the template dependency called
• The other name of project-join normal form is
• The types of template dependencies are
• The decomposition of one relation say R into two relations 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
• The conclusion of the template is a condition which must be held on tuples hypothesis in the template dependency called
• The constraints that are applied on individual tuples and are verified whenever any tuple is modified or new tuple is inserted are called

This question belongs to these collections

• DBMS - RELATIONAL DATABASES MCQ

Similar questions