Please Note that GDB of CS614 will be launched on 13th of February 2014 (13-Feb-2014) and will last for 48 hours only.
The topic will be as follows:
Consider the following table structure named "Students":
StudentID (Primary Key, Integer, Not Null)
StudentName (Varchar, Not NULL)
StudentEmail (Varchar, Not NULL)
StudentDateOfBirth (Date, Not NULL)
StudentCity (Varchar, Not NULL)
You have studied different partitioning techniques. In context of horizontal partitioning, remember the following techniques:
1) Hash partitioning
2) Round robin
3) Range partitioning
If the criteria to select a partitioning technique consists of “Even distribution of rows along a partition” and “Logical meaning of the partition”, then which partitioning technique (from the above given) you would select to partition the "Students" table. Justify your answer with appropriate reasons.
Idea Solution :
Round-robin partitioning
In round-robin partitioning, Adaptive Server assigns rows in a round-robin manner to each partition so that each partition contains a more or less equal number of rows and load balancing is achieved. Because there is no partition key, rows are distributed randomly across all partitions.
In addition, round-robin partitioning offers:
Multiple insertion points for future inserts
A way to enhance performance using parallelism
A way to perform administrative tasks, such as updating statistics and truncating data on individual partitions
