Database study exam3

Match the raid type to its definition: RAID 0 ¤ An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING) ¤ Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING) ¤ A striped array of disks is implemented. (STRIPING) ¤ Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk. ¤ Stripes the data onto multiple disks. (BYTE LEVEL STRIPING) ¤ Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING) ¤ Two independent parities are generated and stored in distributed fashion among multiple disks.

A striped array of disks is implemented. (STRIPING)

Match the type of join to its definition Full Outer Join ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

All the tuples from both participating relations are included in the resulting relation.

Match the type of join to its definition Left Outer Join ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

All the tuples from the Left relation, R, are included in the resulting relation.

Match the type of join to its definition Right Outer Join ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

All the tuples from the Right relation, S, are included in the resulting relation.

Match the raid type to its definition: RAID 1 ¤ An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING) ¤ Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING) ¤ A striped array of disks is implemented. (STRIPING) ¤ Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk. ¤ Stripes the data onto multiple disks. (BYTE LEVEL STRIPING) ¤ Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING) ¤ Two independent parities are generated and stored in distributed fashion among multiple disks.

Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING)

Match the raid type to its definition: RAID 4 ¤ An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING) ¤ Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING) ¤ A striped array of disks is implemented. (STRIPING) ¤ Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk. ¤ Stripes the data onto multiple disks. (BYTE LEVEL STRIPING) ¤ Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING) ¤ Two independent parities are generated and stored in distributed fashion among multiple disks.

An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING)

Which of the following attributes defines Second Normal Form? Select all that apply. ¤ Cannot have partial dependency ¤ Every non-prime attribute should be fully functionally dependent on prime key attribute ¤ Cannot have transitive dependency ¤ No non-prime attribute is transitively dependent on prime key attribute

Cannot have partial dependency Every non-prime attribute should be fully functionally dependent on prime key attribute

Match the type of join to its definition Theta Join ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

Combines tuples from different relations provided they satisfy the theta condition.

Which of the following attributes defines First Normal Form? Select all that apply. ¤ No non-prime attribute is transitively dependent on prime key attribute ¤ Each attribute must contain only a single value from its pre-defined domain ¤ has a prime attribute ¤ The values in an atomic domain are indivisible units ¤ all the attributes in a relation must have atomic domains

Each attribute must contain only a single value from its pre-defined domain has a prime attribute The values in an atomic domain are indivisible units all the attributes in a relation must have atomic domains

Match the term relative to Trivial Functional Dependency to its definition. Trivial (Trivial Functional Dependency): ¤ If an FD X → Y holds, where Y is not a subset of X ¤ If a functional dependency (FD) X → Y holds, where Y is a subset of X ¤ If an FD X → Y holds, where x intersect Y = Φ

If a functional dependency (FD) X → Y holds, where Y is a subset of X, then it is called a trivial FD.

Match Armstrong's Rule to its definition. Augmentation Rule (Armstrong's Rule): ¤ If alpha is a set of attributes and beta is a subset of alpha, then alpha holds beta. ¤ Same as transitive rule in algebra, if a → b holds and b → c holds, then a → c also holds ¤ If a → b holds and y is attribute set, then ay → by also holds

If a → b holds and y is attribute set, then ay → by also holds

Match Armstrong's Rule to its definition. Reflexive Rule (Armstrong's Rule): ¤ If a → b holds and y is attribute set, then ay → by also holds ¤ Same as transitive rule in algebra, if a → b holds and b → c holds, then a → c also holds ¤ If alpha is a set of attributes and beta is a subset of alpha, then alpha holds beta.

If alpha is a set of attributes and beta is a subset of alpha, then alpha holds beta.

Match the term relative to Trivial Functional Dependency to its definition. Non-trivial (Trivial Functional Dependency): ¤ If a functional dependency (FD) X → Y holds, where Y is a subset of X ¤ If an FD X → Y holds, where Y is not a subset of X ¤ If an FD X → Y holds, where x intersect Y = Φ

If an FD X → Y holds, where Y is not a subset of X, then it is called a non-trivial FD.

Match the term relative to Trivial Functional Dependency to its definition. Completely Non-trivial (Trivial Functional Dependency): ¤ If a functional dependency (FD) X → Y holds, where Y is a subset of X ¤ If an FD X → Y holds, where x intersect Y = Φ ¤ If an FD X → Y holds, where Y is not a subset of X

If an FD X → Y holds, where x intersect Y = Φ, it is said to be a completely non-trivial FD.

Match the type of join to its definition Natural Join ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain.

Match the type of join to its definition Outer Joins ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

Include all the tuples from the participating relations in the resulting relation.

Match the storage type to its definition. Secondary Memory ¤ Includes memory devices that are not a part of the CPU chip set or motherboard. ¤ Used to store huge volumes of data external to the computer system. ¤ The memory storage that is directly accessible to the CPU comes under this category.

Includes memory devices that are not a part of the CPU chip set or motherboard.

Match the type of join to its definition Inner Joins ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

Includes only those tuples with matching attributes and the rest are discarded in the resulting relation.

Match the raid type to its definition: RAID 2 ¤ An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING) ¤ Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING) ¤ A striped array of disks is implemented. (STRIPING) ¤ Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk. ¤ Stripes the data onto multiple disks. (BYTE LEVEL STRIPING) ¤ Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING) ¤ Two independent parities are generated and stored in distributed fashion among multiple disks.

Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING)

Match Armstrong's Rule to its definition. Transitivity Rule (Armstrong's Rule): ¤ Same as transitive rule in algebra, if a → b holds and b → c holds, then a → c also holds ¤ If a → b holds and y is attribute set, then ay → by also holds ¤ If alpha is a set of attributes and beta is a subset of alpha, then alpha holds beta.

Same as transitive rule in algebra, if a → b holds and b → c holds, then a → c also holds

Match the raid type to its definition: RAID 3 ¤ An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING) ¤ Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING) ¤ A striped array of disks is implemented. (STRIPING) ¤ Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk. ¤ Stripes the data onto multiple disks. (BYTE LEVEL STRIPING) ¤ Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING) ¤ Two independent parities are generated and stored in distributed fashion among multiple disks.

Stripes the data onto multiple disks. (BYTE LEVEL STRIPING)

Match the storage type to its definition. Primary Memory ¤ Includes memory devices that are not a part of the CPU chip set or motherboard. ¤ The memory storage that is directly accessible to the CPU comes under this category. ¤ Used to store huge volumes of data external to the computer system.

The memory storage that is directly accessible to the CPU comes under this category.

Match the deadlock prevention and avoidance to its behavior in a DBMS Wound-Wait Scheme ¤ This scheme allows the older transaction to wait but kills the younger one. ¤ The transaction that enters the system at a later stage is aborted. ¤ With the help of some relative algorithm, a transaction is chosen, which is to be aborted.

The transaction that enters the system at a later stage is aborted.

Which of the following attributes define Third Normal Form? ¤ The values in an atomic domain are indivisible units. ¤ Must have a prime attribute ¤ Cannot have partial dependency ¤ Each attribute must contain only a single value from its pre-defined domain ¤ Cannot have transitive dependency

The values in an atomic domain are indivisible units. Must have a prime attribute Cannot have partial dependency Each attribute must contain only a single value from its pre-defined domain Cannot have transitive dependency

Match the deadlock prevention and avoidance to its behavior in a DBMS Wait-Die Scheme ¤ This scheme allows the older transaction to wait but kills the younger one. ¤ The transaction that enters the system at a later stage is aborted. ¤ With the help of some relative algorithm, a transaction is chosen, which is to be aborted.

This scheme allows the older transaction to wait but kills the younger one

Armstrong's Axioms are a set of rules, that when applied repeatedly, generates a closure of functional dependencies True False

True

If the DBMS finds that a deadlock situation might occur, then that transaction is never allowed to be executed True False

True

Functional dependency (FD) is a set of constraints between how many attributes in a relation? Unlimited Three Two One

Two

Match the raid type to its definition: RAID 6 ¤ An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING) ¤ Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING) ¤ A striped array of disks is implemented. (STRIPING) ¤ Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk. ¤ Stripes the data onto multiple disks. (BYTE LEVEL STRIPING) ¤ Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING) ¤ Two independent parities are generated and stored in distributed fashion among multiple disks.

Two independent parities are generated and stored in distributed fashion among multiple disks.

Match the storage type to its definition. Tertiary Memory ¤ Used to store huge volumes of data external to the computer system. ¤ The memory storage that is directly accessible to the CPU comes under this category. ¤ Includes memory devices that are not a part of the CPU chip set or motherboard.

Used to store huge volumes of data external to the computer system.

Match the type of join to its definition Equijoin ¤ Combines tuples from different relations provided they satisfy the theta condition. ¤ When Theta join uses only equality comparison operator ¤ If there is at least one common attribute that exists between two relations. The attributes must have the same name and domain. ¤ Includes only those tuples with matching attributes and the rest are discarded in the resulting relation. ¤ Include all the tuples from the participating relations in the resulting relation. ¤ All the tuples from the Left relation, R, are included in the resulting relation. ¤ All the tuples from the Right relation, S, are included in the resulting relation. ¤ All the tuples from both participating relations are included in the resulting relation.

When Theta join uses only equality comparison operator

Match the deadlock prevention and avoidance to its behavior in a DBMS Wait-for Graph ¤ This scheme allows the older transaction to wait but kills the younger one. ¤ The transaction that enters the system at a later stage is aborted. ¤ With the help of some relative algorithm, a transaction is chosen, which is to be aborted.

With the help of some relative algorithm, a transaction is chosen, which is to be aborted.

Match the raid type to its definition: RAID 5 ¤ An entire block of data is written onto data disks and then the parity is generated and stored on a different disk. (BLOCK LEVEL STRIPING) ¤ Records Error Correction Code using Hamming distance for its data, striped on different disks. (HAMMING) ¤ A striped array of disks is implemented. (STRIPING) ¤ Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk. ¤ Stripes the data onto multiple disks. (BYTE LEVEL STRIPING) ¤ Also called mirroring and provides 100% redundancy in case of a failure. (MIRRORING) ¤ Two independent parities are generated and stored in distributed fashion among multiple disks.

Writes whole data blocks onto different disks, but the parity bits generated for data block stripe are distributed among all the data disks rather than storing them on a different dedicated disk.

What is a join regarding DBMS? ¤ join operation pairs two tuples from different relations ¤ a Cartesian product followed by a selection process ¤ None of these ¤ a Cartesian product of two relations

a Cartesian product followed by a selection process

What is the definition of deadlock? ¤ a process indefinitely waits for a resource that is held by another process ¤ the CPU priority of processes prevents the newest process from running ¤ a process crashes and cannot be restarted ¤ the CPU performs time slicing and a process never runs

a process indefinitely waits for a resource that is held by another process

Functional dependency is represented by an arrow sign (→) that is, X→Y, where X functionally determines Y. As a result, which attributes determine the values in the relationship? ¤ right-hand side attributes determine the values of attributes on the left-hand side ¤ left-hand side attributes determine the values of attributes on the right-hand side ¤ left-hand side attributes determine the values of attributes on the left-hand side ¤ right-hand side attributes determine the values of attributes on the right-hand side

left-hand side attributes determine the values of attributes on the right-hand side