CS614-Midterm
1 / 50
Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.
2 / 50
The goal of ideal parallel execution is to completely parallelize those parts of a computation that are not constrained by data dependencies. The __________ the portion of the program that must be executed sequentially, the greater the scalability of computation.
3 / 50
If every key in the data file is represented in the index file then index is :
4 / 50
Data mining evolve as a mechanism to cater the limitations of ________ systems to deal massive data sets with high dimensionality, new data types, multiple heterogeneous data resources etc.
5 / 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.
6 / 50
: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
7 / 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:
8 / 50
The goal of ______is to look at as few block as possible to find the matching records.
9 / 50
The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
10 / 50
For a relation to be in 4NF it must be:-
11 / 50
Pakistan is one of the five major ________ countries in the world.
12 / 50
The growth of master files and magnetic tapes exploded around the mid- _______. :
13 / 50
Horizontal splitting breaks a table into multiple tables based upon_______
14 / 50
15 / 50
B-Tree is used as an index to provide access to records
16 / 50
_____ contributes to an under-utilization of valuable and expensive historical data, and inevitably results in a limitedcapability to provide decision support and analysis.
17 / 50
Many data warehouse project teams waste enormous amounts of time searching in vain for a _______.
18 / 50
DSS queries do not involve a primary key
19 / 50
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
20 / 50
________ is the technique in which existing heterogeneous segments are reshuffled, relocated into homogeneous segments.
21 / 50
Analytical processing uses ____________ , instead of record level access.
22 / 50
NUMA stands for __________
23 / 50
In horizontal splitting, we split a relation into multiple tables on the basis of
24 / 50
Ad-hoc access means to run such queries which are known already.
25 / 50
_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.
26 / 50
The input to the data warehouse can come from OLTP or transactional system but not from other third party database.
27 / 50
____________ in agriculture extension is that pest population beyond which the benefit of spraying outweighs its cost.
28 / 50
.______ is class of Decision Support Environment.
29 / 50
_________ breaks a table into multiple tables based upon common column values.
30 / 50
The divide & conquer cube partitioning approach helps alleviate the ____________ limitations of MOLAP implementation.
31 / 50
During the application specification activity, we also must give consideration to the organization of the applications.
32 / 50
Focusing on data warehouse delivery only often end up _________.
33 / 50
Change Data Capture is one of the challenging technical issues in _____________
34 / 50
30.Data Warehouse is about taking / colleting data from different ________ sources:
35 / 50
The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.
36 / 50
De-Normalization normally speeds up
37 / 50
The Kimball s iterative data warehouse development approach drew on decades of experience to develop the _________.
38 / 50
A data warehouse implementation without an OLAP tool is always possible.
39 / 50
Execution can be completed successfully or it may be stopped due to some error. In case of successful completion of execution all the transactions will be ___________
40 / 50
If w is the window size and n is the size of data set, then the complexity of merging phase in BSN method is___________
41 / 50
Data mining is a/an ______ approach , where browsing through data using mining techniques may reveal something that might be of interest to the user as information that was unknown previously.
42 / 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.
43 / 50
We must try to find the one access tool that will handle all the needs of their users.
44 / 50
45 / 50
_____________, if fits into memory , costs only one disk I/O access to locate a record by given key.
46 / 50
To measure or quantify the similarity or dissimilarity, different techniques are available. Which of the following option represent the name of available techniques?
47 / 50
48 / 50
Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
49 / 50
Data mining evolve as mechanism to cater the limitations of _____ systems to deal massive data sets with high dimensionality, new data types, multiple heterogeneous data resources etc...
50 / 50
Cube is a __________ entity containing values of a certain fact at a certain aggregation level at an intersection of a combination of dimensions.
Your score is
The average score is 0%
Restart quiz
