|
CS614
|
In Horizontal Splitting We Split A Relation Into Multiple Tables On The Basis Of
|
Common Column Values
|
Common Row Values
|
Different Index Values
|
Value Resulted By Ad-Hoc Query
|
A
|
|
CS614
|
Execution Can Be Completed Successfully Or It May Be Stopped Due To Some Error. If Some Error Occurs Execution Will Be Terminated Abnormally And All Transactions Will Be __________
|
Committed To The Database
|
Rolled Back
|
Rolled Froward
|
Database
|
A
|
|
CS614
|
The Need To Synchronize Data Upon Update Is Called
|
Data Manipulation
|
Data Replication
|
Data Coherency
|
Data Imitation
|
C
|
|
CS614
|
Focusing On Data Warehouse Delivery Only Often End Up ___________
|
Rebuilding
|
Success
|
Good Stable Product
|
None Of These
|
A
|
|
CS614
|
As Apposed To The Out Come Of Classification Estimation Deal With __________ Value Outcome
|
Discrete
|
Isolated
|
Continuous
|
Distinct
|
C
|
|
CS614
|
Which Is The Least Appropriate Join Operation For Pipeline Parallelism?
|
Hash Join
|
Outer Join
|
Inner Join
|
Sort-Merge Join
|
C
|
|
CS614
|
The Goal Of __________ Is To Look At As Few Blocks As Possible To Find The Matching Records(S)
|
Indexing
|
Partitioning
|
Joining
|
None Of These
|
A
|
|
CS614
|
Collapsing Tables Can Be Done On The __________ Relationships
|
One-To-One
|
Many-To-Many
|
Both One-To-One And Many-To-Many
|
None Of These
|
C
|
|
CS614
|
Which Statement Is True For De-Normalization?
|
Redundant Data Is A Performance Liability At Query Time But Is A Performance Benefit At Update Time
|
Redundant Data Is A Performance Benefit At Both Query Time And Update Time
|
Redundant Data Is A Performance Liability At Both Query Time And Update Time
|
Redundant Data Is A Performance Benefit At Query Time But Is A Performance Liability At Update Time
|
D
|
|
CS614
|
__________ If Fits Into Memory Costs Only One Disk I/O Access To Locate A Record By Given Key
|
An Inverted Index
|
A Sparse Index
|
A Dense Index
|
None Of These
|
C
|
|
CS614
|
Transactional Fact Tables Do Not Have Records For Events That Do Not Occur. These Are Called
|
Not Recording Facts
|
Fact-Less Facts
|
Null Facts
|
None Of These
|
A
|
|
CS614
|
The Purpose Of The House Of Quality Technique Is To Reduce Types Of Risk
|
Two
|
Three
|
Four
|
All
|
A
|
|
CS614
|
Data Mining Is A/An __________ Approach Where Browsing Through Data Using Data Mining Techniques May Reveal Something That Might Be Of Interest To The User As Information That Was Unknown Previously
|
Non-Exploratory
|
Exploratory
|
Compute Science
|
None Of These
|
B
|
|
CS614
|
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
|
Oltp
|
Olap
|
Dss
|
Dwh
|
A
|
|
CS614
|
People That Design And Build The Data Warehouse Must Be Capable Of Working Across The Organization At All Levels
|
True
|
False
|
Na
|
Na
|
A
|
|
CS614
|
For A Smooth Dwh Implementation We Must Be A Technologist.
|
True
|
False
|
Na
|
Na
|
B
|
|
CS614
|
Non Uniform Distribution When The Data Is Distributed Across The Processors Is Called __________
|
Uncontrolled Distribution
|
Pipeline Distribution
|
Distributed Distribution
|
Skew In Partition
|
D
|
|
CS614
|
Pre-Computed Can Solve Performance Problems
|
Aggregates
|
Facts
|
Dimensions
|
Horizontal
|
A
|
|
CS614
|
Multidimensional Databases Typically Use Proprietary __________ Format To Store Pre-Summarized Cube Structures
|
File
|
Application
|
Aggregate
|
Database
|
A
|
|
CS614
|
The Goal Of Is To Look At As Few Block As Possible To Find The Matching Records. Indexing Partitioning
|
Joining
|
None Of These
|
Nested Loop Join
|
None Of These
|
C
|