Partitioning — Learn free

Self-check

Questions 1–10 of 10

1. What is Partitioning in a database?
Question 1A. Copying a table to several servers for redundancyB. Compressing a table so it occupies fewer blocksC. A data organisation scheme in which table data is divided across multiple storage objects called data partitions according to values in one or more columnsD. Splitting a database into separate schemas per departmentE. Assigning each table to a dedicated node in a shared-nothing cluster
2. What does each data partition consist of?
Question 2A. Its own data, indexes, configuration files and transaction logsB. Only the rows, with indexes held centrallyC. A read-only snapshot of the parent tableD. Just a pointer to the original tableE. Data and indexes, but no logs
3. If a Salary table holding 10 years of data is partitioned yearly, how is it divided at the storage level?
Question 3A. Into 2 datasets, one for current and one for historical dataB. Into 120 datasets, one per monthC. Into one dataset per employeeD. Into 10 smaller datasets, one for each yearE. Into 10 datasets each holding a copy of all years
4. When partitions are stored wherever empty slots exist, so that several partitions may land on one node of a cluster, what is this arrangement called?
Question 4A. Shared-nothing architectureB. Shared architectureC. Sharded architectureD. Vertical architectureE. Composite architecture
5. In the yearly Salary example, a query for years 2 and 3 hits only two partitions, but both sit on the same node. What is the consequence?
Question 5A. The query fails because partitions must be on separate nodesB. All 10 nodes process the query in parallelC. The query reads all 10 partitions anywayD. The partitions are moved to separate nodes before the query runsE. The query is faster than a full scan, but only one node's processing power is used
6. What is Horizontal Partitioning?
Question 6A. Placing entire columns into new, distinct tablesB. Separating one table's rows into multiple partitions that share the same schema and columns but hold entirely different rowsC. Storing each partition on a dedicated nodeD. Combining several small tables into one large tableE. Splitting a table by the data type of its columns
7. What is Vertical Partitioning?
Question 7A. Dividing rows by a date rangeB. Distributing rows using a hash functionC. Hashing the primary key to select a nodeD. Separating entire columns into new, distinct tables whose data is independent of the othersE. Splitting rows into partitions with identical columns
8. Which of the following is NOT a single-level partitioning technique?
Question 8A. Range–Hash PartitioningB. Hash PartitioningC. Range PartitioningD. List PartitioningE. Single-level Hash Partitioning
9. Which of the following is a composite partitioning technique?
Question 9A. Hash PartitioningB. Range PartitioningC. List PartitioningD. Vertical PartitioningE. List–Hash Partitioning
10. Which of the following is NOT a stated benefit of partitioning?
Question 10A. Queries can be solved for a collection of partitions instead of a giant databaseB. Planned downtime is reducedC. It eliminates the need for backupsD. Parallel execution optimises resource utilisation and shortens execution timeE. Administration tasks such as loading, index creation and backup can be done at the partition level