CS614 Data Warehousing Solved Quiz Collection

CS614 Data Warehousing Solved Quiz Collection

By MMA(Awi)

______ index stores first value in each block in the sequential file and a pointer to the block. 

Select correct option: 

 Dense

 Sparse

 B-Tree

 Hash

In context of data parallelism, the work done by query processor should be: 

Select correct option: 

Almost zero

 Maximum

 Pipelined

 Filtered across partitions

The optimizer uses a hash join to join two tables if they are joined using an equijoin and

 Select correct option: 

 Outer table has less number of rows

 Inner table has less number of rows

 Cardinality of tables is equal

 Large amount of data needs to be joined

Bitmap index is appropriate for:

 Select correct option: 

Low cardinality data

 High cardinality data

 Clustered data

 Aggregated data

If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take _______ time units.  

Select correct option: 

 N*T

 N/T

 N+T

 N-T

“More resources means proportionally less time for given amount of data”. The statement refers to: 

 Select correct option: 

 Scale-Up

 Speed-Up

 Size-up

 Over-utilized system

If we apply Run Length Encoding on the input “11001100”, the output will be:

Select correct option: 

 41#40

14#04

 12#02#12#02

 21#20#21#20

_______ refers to “Parallel execution of single data operation across multiple partitions of data” 

Select correct option: 

 Hardware parallelism

 Software parallelism

 Data parallelism

 Operational parallelism

In context of bitmap index, the length of the bit vector is:

Select correct option: 

The possible number of domain values in corresponding field (column)

 The number of records in the base table

 The possible number of bitmap tables formed for corresponding field (column)

 None of the given options

_______ do not (typically) keep the index values in sorted order

Select correct option: 

Dense index

Sparse index

 B-Tree index

 Hash based index

 www.vusuperior.net

“More resources means proportionally less time for given amount of data”. The statement refers to:

Scale-Up

Speed-Up

Size-up

Over-utilized system

In ______ index, the itch bit is set to "1" if the itch row of the base table has the value for the indexed column.

Select correct option: 

 Inverted index

 Bitmap index

 Cluster index

 Join index

An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is

OLTP

OLAP

DSS

Inverted Index

“If resources increase in proportion to increase in data size, time is constant”. The statement refers to:

  Scale-Up

 Speed-Up

 Size-up

 Over-utilized system

In nested-loop join case, if there are ‘M’ rows in outer table and ‘N’ rows in inner table, time complexity is

  O (M log N)

 O (log MN)

 O (MN)

 O (M + N

_______ refers to “Parallel execution of single data operation across multiple partitions of data”

Hardware parallelism

Software parallelism

Data parallelism

Operational parallelism

In context of nested-loop join. actual number of matching rows returned as a result of the join would be ____________ of the order of tables.

Dependent

Independent

Superset

Subset

Which of the following is NOT one of the parallel hardware architecture?

Symmetric Multi-Processing

Massively Parallel Processing

Non-Uniform Memory access

Shared Memory

“If resources increase in proportion to increase in data size, time is constant”. The statement refers to:

  Scale-Up

 Speed-Up

 Size-up

 Over-utilized system

If every key in the data file is represented in the index file then index is

Dense Index

Sparse Index

Inverted Index

None

In context of data parallelism, to get a speed-up of N with N partitions. It must be ensure that:

There are enough computing resources

Query-coordinator is very fast as compared as query servers

Work done in each partition almost same

All given options

 www.vusuperior.net

In nested-loop join case, if there are ‘M’ rows in outer table and ‘N’ rows in inner table, time

complexity is

O (M log N)

O (log MN)

O (MN)

O (M + N)

The goal of ______is to look at as few block as possible to find the matching records.

Indexing 

ETL

Joining

Dimentional Modeling

Parallelism can be exploited, if there is.

Symmetric multi-processors (SMP)

Sufficient I/O bandwidth

Underutilized or intermittently used CPUs

All of the above

Which of the following is NOT one of the variants of nested-loop join?

Naïve nested-loop join

Indexed Nested-loop join

Temporary index Nested-loop joins

Binary index nested-loop join

as the number of processors increase, the speedup should also increase thus we should have linear speedup. Which of the following is not one of the barriers to achive this linear speedup?

Amdhal law

Startup

No interference

Skew

 vusuperior.net

Bitmap index is appropriate

lists each term in the collection only once and then shows a list of all the documents that contain the given term.

Inverted Index

Bitmap index

Clustor index

Join index

One of the preconditions to decide about operations to be parallelized is that :

Operations can be implemented independent

_______________ if fits into memory, costs only one disk I/O access to locate a record by given key.

A Dense Index

A Sparse Index

An Inverted Index

None of These

1_In context of nested-loop join, actual number of matching rows returned as a result of the join would be _________ of the order of tables.

Independent

2_which of the following is NOT one of the parallel hardware architectures?

Shared memory

3 "If resources increase in proportion to increase in data size. Time is constant’. The statement refers to:

Scale Up

4_ If every key in the data file is represented in the index file then it is called

Dense Index 

5_ In context of data parallelism, to get a speed-up of N with N partitions. it must be ensured that:

All of the given option 

6_ In nested-loop join case, if there are 'M' rows in outer table and 'N' rows in inner table, time complexity is 

o(MN)

7_ The goal of _____ is to look at as few blocks as possible to find matching records(s).

Indexing 

8_ Parallelism can be exploited, if there is:

All of the given options    

 MMA(Awi)

9_ If we apply Run Length Encoding on the input "11001100", the output will be:

21#20#21#20

10_ Which of the following is NOT one of variants of Nested-loop join?

Binary index nested-loop join  

1_ In context of data parallelism, the work done by query processor should be:

Maximum

2_  _______ do not (typically) keep the index values in stored order

Hash based index

3_ if every key in the data is represented in the index file then it is called

Dense index

4_ In context of bitmap index, the length of the bit vector is: 

the number of records in the base table 

5_ In context of joining tables, the join condition is specified in _____ clause.

WHERE

6_ A join is identified by multiple tables in the  _____ clause.

From 

7_  Parallelism can be exploited, if there is:

All of the given options    

8_ In ____ index, the itch bit is set to "1" if the itch row of the base table has the value for the indexed column.

Bitmap index

9_ As the number of processors increase, the speedup should also increase. thus we should have linear speedup. Which of the following is NOT the one of the barriers

 to achieve this linear speed-up?

Amdahl’s Law not sure 

10_ Bitmap index is appropriate for:

Low cardinality data 

Q1:   in context of nested-loop join, actual number so matching rows returned as a result of the join would be ________ of the order of tables.
Independent.

Q2:  Which of the following is NOT one of the parallel hardware architecture?
Shared Memory

Q3: If resources increase in proportion to increase in data size. time is constant’. The statement refers to:
Scale-Up

Q4: If every key in the data file is represented in the index file then it is called?
Dense Index

Q5: In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that.
All

Q6: In nested-loop join case, if there are ‘M’ rows in outer table and N rows in inner table, time complexity is.
o(MN)

Q7: The goal of__________ is to look at as few blocks as possible le to find the matching records(s).
Indexing

Q8: Parallelism can be exploited, if there is.
All of the given options

Q9: If we apply Run Length Encoding on the input “11001100”, the output will be.
21#20#21#20

Q10: Which of the following is NOT one of the variants of Nested-loop join?
Binary index nested-loop join.

Q11: In context of data parallelism, the work done by query processor should be:
Maximum.

Q12: ___________ do not (typically) keep the index values in sorted ordered
Hash based Index

Q13: if every key the data file is represented in the index file then it is called.
Dense Index

Q14: In context of bitmap index, the length of the bit vector is:
The number of records in the base table

Q15; In context of joining tables, the join condition is specified in ______ clause:
Where

Q16: A join is identified by multiple tables in the________ clause.
From

Q17: Parallelism can exploited, if there is
All of the given options

Q18: In ________ index, the itch bit is set to “1” if the itch row of the base table has the value for the index column
Bitmap index

Q19: As the number of processors increase, the speedup should also increase. Thus we should have linear speedup. Which of the following is NOT one of the barriers to achieve this linear speed-up?
Amdahl’ Law

Q20: Bitmap index is appropriate for:
Low cardinality data

Q21: If a task takes “T” time units to execute on a single data item, then execution of the task on “N” data items will take______ time units?
N*T

Q22: _________ lists each term in the collection only once and then shows a list of all the documents the contain the given term.
Inverted index

Q23: “More resources means proportionally less time for given amount of data”. The statement refers to:
Speed-Up

Q24: In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:
All of the given option

Q25: In context of bitmap index, the length of the bit vector is
the number of records in the base table.

Q26: One of the preconditions to decide about operations to be parallelized is that:
Operation can be implemented independent of each other

Q27: A_________ index, if fits in the memory, costs only one disk I/O access to locate a record given a key.
Dense Index

Q28: In context of nested-loop join, actual number of matching rows returned as a result of the join would be ___ of the order of tables
Independent

Q29: __________ refers to “Parallel Execution of single data operation across multiple partitions of data”
 Data Parallelism.

 www.vusuperior.net

A join is identified by multiple tables in the _ FROM ___ clause

In context of joining tables, the join condition is specified in _ WHERE ___ clause

The goal of ______ ing Goal _____ is to look at as few blocks as possible to find the matching records(s).

__ Sparse Index _____ index uses even less space than __ dense ____ index, but the block has to be searched, even for unsuccessful searches.

In context of data parallelism, to get a speed-up of N with N partitions, it must be ensured that:

If we apply Run Length Encoding on the input “11001100”, the output will be:

In B-tree index, the lowest level index blocks are called leaf blocks, and these blocks contain:

every indexed data value and a corresponding ROWID

___ Sparse Index ___ index stores first value in each block in the sequential file and a pointer to the block.