Advance Database Management System - 1

Q1.

The problem of concurrency control is more complex in a distributed database

True 

User Answer Correct Answer

FALSE

Q2.

Some of the columns of a relation are at different sites is which of the following?

Data replication 

User Answer

Horizontal partitioning

Vertical partitioning 

Correct Answer

Horizontal and vertical partitioning

Q3.

Synchronization for pull replication is less disruptive and occurs only when needed by each site, not when a central master site thinks it is best to update.

True 

User Answer Correct Answer

FALSE

Can't say

Q4.

The purpose of time stamping is to avoid the use of locks

True 

User Answer Correct Answer

FALSE

Can't say

Q5.

A distributed database can use which of the following strategies?

True

FALSE 

User Answer

Can't say

All of the above 

Correct Answer

Q6.

Replication may use either synchronous or asynchronous distributed database technologies, although asynchronous technologies are more typical in a replicated environment

True 

Correct Answer

FALSE 

User Answer

Can't say

Q7.

Which of the following is true concerning a global transaction?

The required data are at one local site and the distributed DBMS routes requests as necessary

The required data are located in at least one nonlocal site and the distributed DBMS routes request to only the local DBMS 

Correct Answer

The required data are at one local site and the distributed DBMS passes the request to only the local DBMS 

User Answer

The required data are located in at least one nonlocal site and the distributed DBMS passes the request to only the local DBMS

Q8.

Location transparency allows for which of the following?

Users to treat the data as if it is at one location

Programmers to treat the data as if it is at one location 

User Answer

Managers to treat the data as if it is at one location

All of the above 

Correct Answer

Q9.

How many phases are there in basic commit protocol?

2 

User Answer Correct Answer

3

4

5

Q10.

State true or false: Each site (or node) in a distributed system is subject to the same types of failure as in a centralized system

True 

Correct Answer

FALSE 

User Answer

Can't say

Q11.

Replication should be used when which of the following exist?

When transmission speeds and capacity in a network prohibit frequent refreshing of large tables

When using many nodes with different operating systems and DBMSs and database design

The application's data can be somewhat out-of-date. 

Correct Answer

All of the above 

User Answer

Q12.

Data replication is favored where most process requests are read only and where the data are relatively static

True 

User Answer Correct Answer

FALSE

Can't say

Q13.

Which kinds of failures are handled by 2PC?

Failure of participating site

Failure of coordinator

network partitions

All of the above 

User Answer Correct Answer

Q14.

A homogeneous distributed databse is which of the following?

A different DBMS is used at each location and data are not distributed across all nodes

A different DBMS is used at each location and data are distributed across all nodes 

User Answer Correct Answer

The same DBMS is used at each location and data are not distributed across all nodes

The same DBMS is used at each location and data are distributed across all nodes

Q15.

The following is an example of sccalability provided by a client-server approach with distributed processing:

Move some work an overloaded server to a new server

Move some work from an overloaded server to a client

Move some work from a client to a server

All of the above 

User Answer Correct Answer

Advance Database Management System

Q1.

Which of the following is not a parallel database architecture

Shared memory

Shared processor

Shared Disk

Shared nothing

Q2.

Supporting interquery parallelism is more complicated in______

Shared memory

shared disk

shared nothing

B and C

Q3.

Range partitioning works best for___

Large databases

small databases

Databases with less attributes

Databases with less range tuples

Q4.

What is the advantage of Intraquery parallelism?

Reduce network traffic

Reduce bottleneck

Speeding up long running queries

Scaling up the system

Q5.

__________designates one or more attributes from the given relations scheme as the partitioning attributes.

Round robin

Hash partitioning

Range partitioning

Vertical partitioning

Q6.

____________skew refers to the fact that there may be load imbalance in the partitioning, even when there is no attribute skew

Attribute value skew

Partition skew

Both

None of the above

Q7.

____________skew refers to the fact that some values appear in the partitioning attributes of many tuples

Attribute value skew

Partition skew

Both

None of the above

Q8.

Which are the two steps in range partitioning sort? i)Range partitioning sort ii) sorting each partition separately iii) Redistribute tuples iv) virtual partitioning

I,iii

I,iv,

I,ii

iii,iv

Q9.

Hash partitioning is a better choice than range than range partitioning when:

you don’t know beforehand how much data will map into a given range

sizes of range partitions would differ quite substantially.

Partition pruning and partition-wise joins on a partition-wise joins on a partitioning attribute are important

All of the above

Q10.

Round robin partitioning is ideally suited for which kind of applications?

Reading entire relation sequentially

reading some part of database

Random read operations

All of the above

Q11.

What are the issues motivating parallelism?

Increased availability

Distributed access to data

Analysis of distributed data

All of the above

Q12.

Which of the following is true in case of pipelining

They scale up well

It is possible to pipeline relational operators that donot produce O/P until I/P have been accessed.

Only marginal speedup is obtained for frequent cases in which one operator's execution cost is more than others'.

Pipeline chains attain sufficient length to provide high degree of parallelism

Q13.

In______________performance is sustained if the number of CPUs and disks are increased in proportion to the amount of data.

Linear scale up

Linear speed-up

Interference

None of the above

Q14.

The main advantage of shared memory and shared disk architecture is interference

TRUE

FALSE

cant say

Q15.

A__________ system seeks to improve performance through parallelization of various operations, such as loading data, building indexes and evaluating queries.

Distributed database

Parallel database

Client server database

standalone systems