CS614-Midterm
1 / 50
The users of data warehouse are knowledge workers in other words they are _______in the organization.
2 / 50
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
3 / 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.
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
In a traditional MIS system, there is an almost linear sequence of queries.
6 / 50
People that design and build the data warehouse must be capable of working across the organization at all levels
7 / 50
The input to the data warehouse can come from OLTP or transactional system but not from other third party database.
8 / 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.
9 / 50
Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.
10 / 50
NUMA stands for __________
11 / 50
To judge effectiveness we perform data profiling twice.
12 / 50
The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.
13 / 50
To identify the __________________ required we need to perform data profiling
14 / 50
Focusing on data warehouse delivery only often end up _________.
15 / 50
________ is the technique in which existing heterogeneous segments are reshuffled, relocated into homogeneous segments.
16 / 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.
17 / 50
Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.
18 / 50
Transactional fact tables do not have records for events that do not occur. These are called
19 / 50
The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.
20 / 50
A single database, couldn‟t serve both operational high performance transaction processing and DSS, analytical processing, all at the same time.
21 / 50
If some error occurs, execution will be terminated abnormally and all transactions will be rolled back. In this case when we will access the database we will find it in the state that was before the ____________.
22 / 50
Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
23 / 50
The growth of master files and magnetic tapes exploded around the mid- _______. :
24 / 50
The goal of ______is to look at as few block as possible to find the matching records.
25 / 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 ___________
26 / 50
Cube is a __________ entity containing values of a certain fact at a certain aggregation level at an intersection of a combination of dimensions.
27 / 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:
28 / 50
: The goal of ___________ is to look at as few blocks as possible to find the matching records(s).
29 / 50
Taken jointly, the extract programs or naturally evolving systems formed a spider web, also known as
30 / 50
Data Transformation Services (DTS) provide a set of _____ that lets you extract, transform, and consolidate data from disparate sources into single or multiple destinations supported by DTS connectivity.
31 / 50
It is observed that every year the amount of data recorded in anorganization is
32 / 50
_____________, if fits into memory , costs only one disk I/O access to locate a record by given key.
33 / 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
34 / 50
In horizontal splitting, we split a relation into multiple tables on the basis of
35 / 50
Pre-join technique is used to avoid
36 / 50
Data mining uses _________ algorithms to discover patterns and regularities in data.
37 / 50
The STAR schema used for data design is a __________ consisting of fact and dimension tables. :
38 / 50
The automated, prospective analyses offered by data mining move beyond the analysis of past events provided by respective tools typical of ___________.
39 / 50
: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
40 / 50
41 / 50
A data warehouse implementation without an OLAP tool is always possible.
42 / 50
43 / 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.
44 / 50
Suppose the amount of data recorded in an organization is doubled every year. This increase is __________ .
45 / 50
For a given data set, to get a global view in un-supervised learning we use
46 / 50
_____________ is a process which involves gathering of information about column through execution of certain queries with intention to identify erroneous records.
47 / 50
De-Normalization normally speeds up
48 / 50
Analytical processing uses ____________ , instead of record level access.
49 / 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.
50 / 50
Your score is
The average score is 0%
Restart quiz
