CS614 Midterm Online Quiz

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.

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.

It is observed that every year the amount of data recorded in an organization :

The goal of ______is to look at as few block as possible to find the matching records.

The purpose of the House of Quality technique is to reduce ______ types of risk.

The Kimball s iterative data warehouse development approach drew on decades of experience to develop the _________.

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.

There are many variants of the traditional nested-loop join, if there is an index is exploited, then it is called……

Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.

_____________, if fits into memory , costs only one disk I/O access to locate a record by given key.

A single database, couldn‟t serve both operational high performance transaction processing and DSS, analytical processing, all at the same time.

_______ is an application of information and data.

Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.

The goal of star schema design is to simplify ________

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.

People that design and build the data warehouse must be capable of working across the organization at all levels

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.

In horizontal splitting, we split a relation into multiple tables on the basis of

Pakistan is one of the five major ________ countries in the world.

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...

Relational databases allow you to navigate the data in ____________ that is appropriate using the primary, foreign key structure within the data model.

30.Data Warehouse is about taking / colleting data from different ________ sources:

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 ____________.

Pre-computed _______ can solve performance problems

____________ in agriculture extension is that pest population beyond which the benefit of spraying outweighs its cost.

DTS allows us to connect through any data source or destination that is supported by ____________

The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.

: The goal of ___________ is to look at as few blocks as possible to find the matching records(s).

Analytical processing uses ____________ , instead of record level access.

Data mining uses _________ algorithms to discover patterns and regularities in data.

For a smooth DWH implementation we must be a technologist.

Normalization effects performance

Non uniform distribution, when the data is distributed across the processors, is called ______.

Pre-computed _______ can solve performance problems

_________ breaks a table into multiple tables based upon common column values.

It is observed that every year the amount of data recorded in anorganization is

The performance in a MOLAP cube comes from the O(1) look-up time for the array data structure.

Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.

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.

A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.

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.

The need to synchronize data upon update is called

Pre-join technique is used to avoid

DTS allows us to connect through any data source or destination that is supported by ____________

Many data warehouse project teams waste enormous amounts of time searching in vain for a _______.

People that design and build the data warehouse must be capable of working across the organization at all levels

In _________ system, the contents change with time. :

The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.

: An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is

Horizontal splitting breaks a table into multiple tables based upon_______