CS614-Midterm
1 / 50
_____modeling technique is more appropriate for data warehouses.
2 / 50
Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
3 / 50
_____ contributes to an under-utilization of valuable and expensive historical data, and inevitably results in a limitedcapability to provide decision support and analysis.
4 / 50
In a traditional MIS system, there is an almost linear sequence of queries.
5 / 50
.______ is class of Decision Support Environment.
6 / 50
Data mining derives its name from the similarities between searching for valuable business information in a large database, for example, finding linked products in gigabytes of store scanner data, and mining a mountain for a _________ of valuable ore.
7 / 50
If „M‟ rows from table-A match the conditions in the query then table-B is accessed „M‟ times. Suppose table-B has an index on the join column. If „a‟ I/Os are required to read the data block for each scan and „b‟ I/Os for each data block then the total cost of accessing table-B is _____________ logical I/Os approximately.
8 / 50
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
9 / 50
The divide & conquer cube partitioning approach helps alleviate the ____________ limitations of MOLAP implementation.
10 / 50
For a smooth DWH implementation we must be a technologist.
11 / 50
Ad-hoc access means to run such queries which are known already.
12 / 50
________ gives total view of an organization
13 / 50
DOLAP allows download of “cube” structures to a desktop platform with the need for shared relational or cube server.
14 / 50
There are many variants of the traditional nested-loop join. If the index is built as part of the query plan and subsequently dropped, it is called
15 / 50
People that design and build the data warehouse must be capable of working across the organization at all levels
16 / 50
Change Data Capture is one of the challenging technical issues in _____________
17 / 50
Multi-dimensional databases (MDDs) typically use ___________ formats to store pre-summarized cube structures.
18 / 50
There are many variants of the traditional nested-loop join, if there is an index is exploited, then it is called……
19 / 50
Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.
20 / 50
The technique that is used to perform these feats in data mining modeling, and this act of model building is something that people have been doing for long time, certainly before the _______ of computers or data mining technology.
21 / 50
The growth of master files and magnetic tapes exploded around the mid- _______. :
22 / 50
A data warehouse implementation without an OLAP tool is always possible.
23 / 50
In DWH project, it is assured that ___________ environment is similar to the production environment
24 / 50
In _________ system, the contents change with time. :
25 / 50
To identify the __________________ required we need to perform data profiling
26 / 50
NUMA stands for __________
27 / 50
To measure or quantify the similarity or dissimilarity, different techniques are available. Which of the following option represent the name of available techniques?
28 / 50
If every key in the data file is represented in the index file then index is :
29 / 50
De-Normalization normally speeds up
30 / 50
: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
31 / 50
The purpose of the House of Quality technique is to reduce ______ types of risk.
32 / 50
The key idea behind ___________ is to take a big task and break it into subtasks that can be processed concurrently on a stream of data inputs in multiple, overlapping stages of execution.
33 / 50
When performing objective assessments, companies follow a set of principles to develop metrics specific to their needs, there is hard to have “one size fits all” approach. Which of the following statement represents the pervasive functional forms?
34 / 50
_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.
35 / 50
For good decision making, data should be integrated across the organization to cross the LoB (Line of Business). This is to give the total view of organization from:
36 / 50
Rearranging the grouping of source data, delivering it to the destination database, and ensuring the quality of data are crucial to the process of loading the data warehouse. Data ____________ is vitally important to the overall health of a warehouse project. 1. Cleansing 2. Cleaning 3. Scrubbing Which of the following options is true?
37 / 50
38 / 50
39 / 50
For a relation to be in 4NF it must be:-
40 / 50
Normalization effects performance
41 / 50
Transactional fact tables do not have records for events that do not occur. These are called
42 / 50
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
43 / 50
During ETL process of an organization, suppose you have data which can be transformed using any of the transformation method. Which of the following strategy will be your choice for least complexity?
44 / 50
A ________ dimension is a collection of random transactional codes, flags and/text attributes that are unrelated to any particular dimension. The ______ dimension is simply a structure that provides a convenient place to store the ______ attributes.
45 / 50
During the application specification activity, we also must give consideration to the organization of the applications.
46 / 50
Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.
47 / 50
The Kimball s iterative data warehouse development approach drew on decades of experience to develop the _________.
48 / 50
_________ breaks a table into multiple tables based upon common column values.
49 / 50
Data mining is a/an __________ approach, where browsing through data using data mining techniques may reveal something that might be of interest to the user as information that was unknown previously.
50 / 50
Horizontal splitting breaks a table into multiple tables based upon_______
Your score is
The average score is 0%
Restart quiz