Q&As: Partitioning




(Q) Which of the following sentences about partitioning and data compression are true?

Basic data distribution methods: Range, Hash, and List
(a) Single-Level Partitioning
  • Range partitioning
  • Hash Partitioning
  • List Partitioning
(b) Composite Partitioning
  • Range-Range
  • Range-Hash
  • Range-List
  • List-Range
  • List-Hash
  • List-List
(c) Interval Partitioning
(d) System Partitioning
(e) Reference Partitioning
(f) Virtual column-based partitioning


(Q) Which of the following sentences about partitioning and data compression are true?

( ) Data in a partitioned table can be compressed on a partition-by-partition basis
( ) When you alter a partition to enable compression, compression is applied only to future data to be inserted
( ) When you enable compression on a partition, all data in the partition, including previously inserted data, is compressed
( ) Before adding a compressed partition to a partitioned table, you must either drop or make UNUSABLE all existing bitmap indexes
( ) You DO NOT have to drop or make unusable b-tree indexes in a table before adding a compressed partition

No comments:

Post a Comment