CS614-Midterm
1 / 50
The goal of star schema design is to simplify ________
2 / 50
Ad-hoc access means to run such queries which are known already.
3 / 50
B-Tree is used as an index to provide access to records
4 / 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___________
5 / 50
To judge effectiveness we perform data profiling twice.
6 / 50
Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
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
In horizontal splitting, we split a relation into multiple tables on the basis of
9 / 50
Non uniform distribution, when the data is distributed across the processors, is called ______.
10 / 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.
11 / 50
The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.
12 / 50
Transactional fact tables do not have records for events that do not occur. These are called
13 / 50
14 / 50
Horizontal splitting breaks a table into multiple tables based upon_______
15 / 50
A single database, couldn‟t serve both operational high performance transaction processing and DSS, analytical processing, all at the same time.
16 / 50
The purpose of the House of Quality technique is to reduce ______ types of risk.
17 / 50
Pre-join technique is used to avoid
18 / 50
We must try to find the one access tool that will handle all the needs of their users.
19 / 50
Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.
20 / 50
21 / 50
Companies collect and record their own operational data, but at the same time they also use reference data obtained from _______ sources such as codes, prices etc.
22 / 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.
23 / 50
The _________ is only a small part in realizing the true business value buried within the mountain of data collected and stored within organizations business systems and operational databases.
24 / 50
The need to synchronize data upon update is called
25 / 50
in agriculture extension is that pest population beyond which the benefit of spraying outweighs levels
26 / 50
_______ is an application of information and data.
27 / 50
: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
28 / 50
It is observed that every year the amount of data recorded in anorganization is
29 / 50
The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
30 / 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 ___________
31 / 50
The goal of ideal parallel execution is to completely parallelize those parts of a computation that are not constrained by data dependencies. The smaller the portion of the program that must be executed __________, the greater the scalability of the computation.
32 / 50
Suppose the amount of data recorded in an organization is doubled every year. This increase is __________ .
33 / 50
Analytical processing uses ____________ , instead of record level access.
34 / 50
35 / 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.
36 / 50
37 / 50
Relational databases allow you to navigate the data in ____________ that is appropriate using the primary, foreign key structure within the data model.
38 / 50
A data warehouse implementation without an OLAP tool is always possible.
39 / 50
The performance in a MOLAP cube comes from the O(1) look-up time for the array data structure.
40 / 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.
41 / 50
Multi-dimensional databases (MDDs) typically use ___________ formats to store pre-summarized cube structures.
42 / 50
Cube is a __________ entity containing values of a certain fact at a certain aggregation level at an intersection of a combination of dimensions.
43 / 50
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
44 / 50
The users of data warehouse are knowledge workers in other words they are _______in the organization.
45 / 50
The automated, prospective analyses offered by data mining move beyond the analysis of past events provided by respective tools typical of ___________.
46 / 50
With data mining, the best way to accomplish this is by setting aside some of your data in a vault to isolate it from the mining process; once the mining is complete, the results can be tested against the isolated data to confirm the model's _______.
47 / 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.
48 / 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?
49 / 50
50 / 50
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
Your score is
The average score is 0%
Restart quiz
