CS614-Midterm
1 / 50
: The goal of ___________ is to look at as few blocks as possible to find the matching records(s).
2 / 50
Pakistan is one of the five major ________ countries in the world.
3 / 50
Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.
4 / 50
DSS queries do not involve a primary key
5 / 50
For a DWH project, the key requirement are ________ and product experience.
6 / 50
During the application specification activity, we also must give consideration to the organization of the applications.
7 / 50
_____________ is a process which involves gathering of information about column through execution of certain queries with intention to identify erroneous records.
8 / 50
Data mining uses _________ algorithms to discover patterns and regularities in data.
9 / 50
Change Data Capture is one of the challenging technical issues in _____________
10 / 50
In a traditional MIS system, there is an almost linear sequence of queries.
11 / 50
NUMA stands for __________
12 / 50
Collapsing tables can be done on the ___________ relationships
13 / 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.
14 / 50
DTS allows us to connect through any data source or destination that is supported by ____________
15 / 50
_____________, if fits into memory , costs only one disk I/O access to locate a record by given key.
16 / 50
17 / 50
Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.
18 / 50
19 / 50
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
20 / 50
To measure or quantify the similarity or dissimilarity, different techniques are available. Which of the following option represent the name of available techniques?
21 / 50
If every key in the data file is represented in the index file then index is :
22 / 50
Analytical processing uses ____________ , instead of record level access.
23 / 50
The need to synchronize data upon update is called
24 / 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 ____________.
25 / 50
B-Tree is used as an index to provide access to records
26 / 50
________ is the technique in which existing heterogeneous segments are reshuffled, relocated into homogeneous segments.
27 / 50
The divide & conquer cube partitioning approach helps alleviate the ____________ limitations of MOLAP implementation.
28 / 50
The goal of star schema design is to simplify ________
29 / 50
30 / 50
It is observed that every year the amount of data recorded in an organization :
31 / 50
32 / 50
33 / 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.
34 / 50
The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.
35 / 50
: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
36 / 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.
37 / 50
The performance in a MOLAP cube comes from the O(1) look-up time for the array data structure.
38 / 50
For a given data set, to get a global view in un-supervised learning we use
39 / 50
Which statement is true for De-Normalization?
40 / 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.
41 / 50
Many data warehouse project teams waste enormous amounts of time searching in vain for a _______.
42 / 50
_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.
43 / 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...
44 / 50
The purpose of the House of Quality technique is to reduce ______ types of risk.
45 / 50
There are many variants of the traditional nested-loop join, if there is an index is exploited, then it is called……
46 / 50
_____modeling technique is more appropriate for data warehouses.
47 / 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.
48 / 50
De-Normalization normally speeds up
49 / 50
In horizontal splitting, we split a relation into multiple tables on the basis of
50 / 50
We must try to find the one access tool that will handle all the needs of their users.
Your score is
The average score is 0%
Restart quiz
