多项选择题

GivenaSHEAPTHRESvalueof2560,inwhichtwocaseswillaSHEAPTH……

Given a SHEAPTHRES value of 2560, in which two cases will a SHEAPTHRES_SHR value of 1024 be meaningful?（）

A.INTRA_PARALLEL NO
B.MAX_CONNECTIONS 2000, MAX_COORDAGENTS 100
C.MAX_AGENTS 100, MAX_CONNECTIONS 2000
D.MAX_CONNECTIONS 500, MAX_COORDAGENTS 1000
E.INTRA_PARALLEL YES

<上一题目录下一题>

热门试题

多项选择题Inwhichtwoenvironmentswouldintra-partitionparallelismbeused?（）

A.Single database partition, single processor
B.Single database partition, multiple processors
C.Multiple database partitions, single processor
D.Multiple database partitions, multiple processors

单项选择题AdatabaseadministratorwouldliketoexaminerepartitioningoptionsforapartitioneddatabasenamedPRODDB.Aworkloadhasbeencapturedonthesystem(Windows)andisstoredinafilenamedWORKLOAD.SQL.WhatisthepropercommandtoruntheDesignAdvisorsothatitwillevaluatetheinformationstoredinthefileandgiveadviceonre-partitioning?（）

A.db2advis -d proddb -i workload.sql -P
B.db2advis -d proddb -i workload.sql -partitioning
C.db2advis -d proddb -i workload.sql -m P
D.db2advis -d proddb -i workload.sql -m ALL

单项选择题Adatabaseadministratorwantstodesignamulti-partitiondatabasethatcantakeadvantageofbothintra-partitionparallelismandinter-partitionparallelism.Whichconfigurationwillallowtheuseofthesetypesofparallelismwhileusingtheleastnumberofhardwarecomponents(servers,processors)?（）

A.one server having at least two processors
B.two servers having one processor and one logical database partition
C.one server having four processors and two logical database partitions
D.two servers each having four processors and two logical database partitions

多项选择题WhenadatabaseadministratorchoosesthedimensionsforanMDCtable,whichtwocharacteristicsshouldbeconsidered?（）

A.the query transaction rate
B.numeric data versus character data
C.extent size
D.the cardinality of the candidate columns
E.prefetch size

单项选择题Whichdataorganizationschemesaresupported?（）

A.PARTITION BY HASH and ORGANIZE BY
B.PARTITION BY RANGE and ORGANIZE BY KEY SEQUENCE
C.PARTITION BY HASH and ORGANIZE BY KEY SEQUENCE
D.PARTITION BY RANGE and ORGANIZE BY