최신HP Vertica Solutions [2012] - HP2-N36무료샘플문제

A. continuous mirroring of data

B. full replicas of all data on all nodes

C. built-in redundancy of data

D. full replicas of fact tables and segmented dimension tables

A. A group by pipe is at least as fast as a group by hash.

B. A group by pipe requires no optimization.

C. A group by pipe uses memory more efficiently.

D. A group by pipe can be processed spill to disk if the join result is large.

E. A group by pipe builds its entire output table in memory.

A. Redistribute data to the new host(s).

B. Recreate all projections on the new hosts

C. Update spread. conf on the new host(s) only.

D. Install Vertica on the new hosts.

E. Restart spread on all hosts in the cluster.

A. Delete vectors are a fast method for marking records for deletion.

B. Delete vectors move deleted records to files in a new location.

C. Delete vectors are stored in a different location, minimizing storage impact.

D. Delete vectors rewrite the original files, immediately purging them off the system.

E. Delete vectors enable historical queries of data marked for deletion until the data has been purged.

A. Vertica creates a delete vector, Identifying records to be deleted.

B. Vertica deletes the records from the original source files.

C. Vertica removes the file that stores the deleted data.

D. Vertica rewrites the files that contained the deleted records, ignoring records to be deleted.