Multiple Choice Questions on Partitioning
Document Details
Uploaded by DecisiveGreatWallOfChina1467
Tags
Summary
This document contains multiple choice questions about database partitioning techniques. The questions cover various partitioning methods like horizontal, vertical, hybrid, key-based, and data range partitioning. The document also contains explanations for each correct answer. Many database design principles are addressed within the questions including hash-based and consistent hashing techniques.
Full Transcript
Add the following multiple choice questions and answers and explanations verbatim (DO NOT change the given wording). ========================================== New Question 1: Which partitioning method combines both horizontal and vertical partitioning techniques? Choice A: Horizontal partitioning C...
Add the following multiple choice questions and answers and explanations verbatim (DO NOT change the given wording). ========================================== New Question 1: Which partitioning method combines both horizontal and vertical partitioning techniques? Choice A: Horizontal partitioning Choice B: Vertical partitioning Choice C: Hybrid partitioning Choice D: Round-robin partitioning Correct answer: C Explanation: Hybrid partitioning involves using both horizontal and vertical partitioning techniques to optimize data distribution and access efficiency. ========================================== New Question 2: What is a key advantage of using consistent hashing in key or hash-based partitioning? Choice A: It eliminates the need for a hash function. Choice B: It allows adding new servers without significant data redistribution. Choice C: It ensures that all data is stored on a single server. Choice D: It simplifies the partitioning scheme by using list-based criteria. Correct answer: B Explanation: Consistent hashing allows the system to add new servers with minimal data redistribution, addressing the issue of fixed server numbers in standard hash-based partitioning. ========================================== New Question 3: Which partitioning criterion involves assigning specific lists of values to each partition? Choice A: Key-based partitioning Choice B: List partitioning Choice C: Round-robin partitioning Choice D: Composite partitioning Correct answer: B Explanation: List partitioning assigns specific lists of values to each partition, ensuring that records with certain key values are stored together. ========================================== New Question 4: What is a primary challenge associated with directory-based partitioning? Choice A: It cannot handle large datasets. Choice B: It introduces a single point of failure. Choice C: It requires denormalization of the database. Choice D: It makes horizontal partitioning impossible. Correct answer: B Explanation: Directory-based partitioning relies on a central directory to map data to partitions, which can become a single point of failure in the system. ========================================== New Question 5: How does data range partitioning differ from key-based partitioning? Choice A: Data range partitioning divides data based on specific key values, while key-based uses hash functions. Choice B: Data range partitioning assigns data to partitions in a round-robin fashion, whereas key-based does not. Choice C: Data range partitioning divides data based on value ranges, while key-based uses hash functions on key attributes. Choice D: Data range partitioning combines multiple partitioning methods, unlike key-based partitioning. Correct answer: C Explanation: Data range partitioning divides data based on specific value ranges of a chosen attribute, whereas key-based partitioning uses hash functions applied to key attributes to determine partition placement. ==========================================
