Distributed Database MCQ's




Question 1 :
Deadlock ____ is better than avoidance

  1. Recovery
  2. Prevention
  3. Repetition
  4. Allocation
  

Question 2 :
Hybrid fragmentation is a combination of ______________________

  1. Vertical and derived fragmentation.
  2. Horizontal and vertical fragmentation.
  3. Horizontal and row wise fragmentation.
  4. Horizontal, vertical and derived fragmentation
  

Question 3 :
The deadlock state can be changed back to stable state by using _____________ statement.

  1. Rollback
  2. Commit
  3. Savepoint
  4. Delete
  

Question 4 :
Distributed Execution manager is at ____

  1. Local level
  2. Global level
  3. Network level
  4. Security level
  

Question 5 :
The default model for complex type, in XML schemas for element is

  1. Text Only
  2. Default
  3. Element only
  4. Text and element
  

Question 6 :
A distributed database has which of the following advantages over a centralized database?

  1. Software cost
  2. Software Complexity
  3. Slow response
  4. Modular growth
  

Question 7 :
The representation of the query in the form of data structure is called

  1. Query graph
  2. Spanner tree
  3. Query tree
  4. Parser tree
  

Question 8 :
language for querying XML data is

  1. SQL
  2. PLSQL
  3. XQUERY
  4. Any QUERY Language
  

Question 9 :
Database system and computer networks, these are two technologies unified together to form _________________

  1. Distributed Database System (DDBS).
  2. Distributed Network System (DDNS).
  3. Distributed Database Security (DDBSE).
  4. Distributed Data Protocol (DDP).
  

Question 10 :
In distributed database the database is distributed across multiple sites on the network, but the performance expected is __________as that from the centralized database.

  1. Different
  2. Same
  3. Based on network bandwidth
  4. Based on workload
  

Question 11 :
For Bond Energy Algorithm input is_______________

  1. CA matrix
  2. AC matrix
  3. AA matrix
  4. CC matrix
  

Question 12 :
Heterogeneous database design is a

  1. Top down approach
  2. Bottom up approach
  3. Horizontal approach
  4. Sparse approach
  

Question 13 :
Factors that affect the Design of distributed databases

  1. Fragmentation , Allocation, Replication
  2. Fragmentation , Affinity, Redundancy
  3. Fragmentation , Allocation, Recovery
  4. Fragmentation , Availability, Replication
  

Question 14 :
A distributed transaction can be ____ if queries are issued at one or more nodes.

  1. Fully read-only
  2. Fully read-write
  3. Partially read-only
  4. Partially read-write
  

Question 15 :
____ query optimization takes place at execution time.

  1. Manually
  2. Static
  3. Automatic
  4. Dynamic
  

Question 16 :
Well formed XML document means

  1. It contain an element
  2. must contain one or more elements and root element
  3. It contain an element
  4. It contain one or more elements
  

Question 17 :
In which of the following scenario, using XML native storage would be inappropriate?

  1. Fixed schema
  2. You want to query and modify your XML data
  3. You want to index the XML data for faster query processing
  4. Your application needs system catalog views to administer your XML data and XML schema
  

Question 18 :
__________ is primarily designed to fulfill the criteria of being non-blocking in nature compared to its counterpart 2PC

  1. The two phase commit protocol
  2. The three phase commit protocol
  3. The four phase commit protocol
  4. The five phase commit protocol
  

Question 19 :
Transaction start with______

  1. begin_transaction
  2. read_item
  3. write_item
  4. Modify_item
  

Question 20 :
When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is

  1. Wound-wait
  2. Wait-wound
  3. Wait-die
  4. Wound-die
  

Question 21 :
In__________ when some transaction reads the same tuple twice but it gets different data values each time.

  1. Repeatable read
  2. Write committed
  3. Read committed
  4. Non repeatable read
  

Question 22 :
Allocation of fragment is based on____

  1. Locality of reference
  2. Locality of distance
  3. Fragmentation
  4. Size
  

Question 23 :
Correctness rules for data fragmentation includes

  1. Reconstruction ,Completeness , Disjointness
  2. Disjointness, Completeness , Reconstruction
  3. Completeness , Reconstruction , Disjointness
  4. Completeness , Disjointness Reconstruction
  

Question 24 :
The local queries are optimized by the local database_______

  1. Clients
  2. Servers
  3. Local machines
  4. Remote machines
  

Question 25 :
A heterogeneous distributed database is______________

  1. A different DBMS is used at each location and data are distributed across all nodes.
  2. The same DBMS is used at each location and data are not distributed across all nodes
  3. The same DBMS is used at each location and data are distributed across all nodes.
  4. A different DBMS is used at each location and data are not distributed across all nodes.
  
Pages