The basic partition algorithm reduces the number of database scans to – McqOptions

MCQOPTIONS

1.	The basic partition algorithm reduces the number of database scans to ________ & divides it into partitions.
A.	one.
B.	two.
C.	three.
D.	four.
Answer» C. three.

Discussion

No Comment Found

Related MCQs

Bill Inmon has estimated___________of the time required to build a data warehouse, is consumed in the conversion process.
____________ are a different paradigm for computing which draws its inspiration from neuroscience.
The _______ step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, from being considered for counting support.
Certain itemsets in the dashed circle whose support count reach support value during an iteration move into the ______.
Certain itemsets enter afresh into the system and get into the _______, which are essentially the supersets of the itemsets that move from the dashed circle to the dashed box.
____________ contains information that gives users an easy-to-understand perspective of the information stored in the data warehouse.
___________ of data means that the attributes within a given entity are fully dependent on the entire primary key of the entity.
The ____________ of data could result in the disclosure of information that is deemed to be confidential.
If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. Then the support of bread and jam is _______.
7 If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. Then the confidence of buying bread with jam is _______.