Distributed Databases MCQ

Test your knowledge with important Distributed Databases MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Distributed Databases MCQs at Bissoy

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

  True

  খ

  False
• In a semijoin, only the joining attribute is sent from one site to another, and then only the required rows are returned.
  ক

  True

  খ

  False
• The semijoin approach saves network traffic.
  ক

  True

  খ

  False
• The cost to perform a snapshot refresh may depend on whether the snapshot is simple or complex.
  ক

  True

  খ

  False
• Data replication is favored where most process requests are read-only and where the data are relatively static.
  ক

  True

  খ

  False
• The purpose of timestamping is to avoid the use of locks.
  ক

  True

  খ

  False
• A distributed unit of work allows various statements within a unit of work to refer to multiple remote DBMS locations.
  ক

  True

  খ

  False
• An increasingly popular option for data distribution as well as for fault tolerance of any database is to store a separate copy of the database at each of two or more sites.
  ক

  True

  খ

  False
• Databases that are stored on computers at multiple locations and are not interconnected by a network are known as distributed databases.
  ক

  True

  খ

  False
• With asynchronous technology, if any copy of a data item is updated anywhere on the network, the same update is immediately applied to all other copies or it is aborted.
  ক

  True

  খ

  False
• 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

  খ

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

  True

  খ

  False
• Each site (or node) in a distributed system is subject to the same types of failure as in a centralized system.
  ক

  True

  খ

  False
• With failure transparency, all of the actions of a transaction are committed or none of them are committed.
  ক

  True

  খ

  False
• Which of the following is not one of the stages in the evolution of distributed DBMS?
  ক

  Unit of work

  খ

  Remote unit of work

  গ

  Distributed unit of Work

  ঘ

  Distributed request
• A semijoin is which of the following?
  ক

  Only the joining attributes are sent from one site to another and then all of the rows are returned.

  খ

  All of the attributes are sent from one site to another and then only the required rows are returned.

  গ

  Only the joining attributes are sent from one site to another and then only the required rows are returned.

  ঘ

  All of the attributes are sent from one site to another and then only the required rows are returned.
• Storing a separate copy of the database at multiple locations is which of the following?
  ক

  Data Replication

  খ

  Horizontal Partitioning

  গ

  Vertical Partitioning

  ঘ

  Horizontal and Vertical Partitioning
• 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 designs.

  গ

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

  ঘ

  All of the above.
• A homogenous distributed database is which of the following?
  ক

  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.

  গ

  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.
• 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 requests as necessary.

  গ

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

  ঘ

  The required data are located in at least one nonlocal site and the distributed DBMS passes the request to only the local DBMS.
• Some of the columns of a relation are at different sites is which of the following?
  ক

  Data Replication

  খ

  Horizontal Partitioning

  গ

  Vertical Partitioning

  ঘ

  Horizontal and Vertical Partitioning
• A heterogeneous distributed database is which of the following?
  ক

  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.

  গ

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

  গ

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

  ঘ

  All of the above
• A transaction manager is which of the following?
  ক

  Maintains a log of transactions

  খ

  Maintains before and after database images

  গ

  Maintains appropriate concurrency control

  ঘ

  All of the above
• An autonomous homogenous environment is which of the following?
  ক

  The same DBMS is at each node and each DBMS works independently.

  খ

  The same DBMS is at each node and a central DBMS coordinates database access.

  গ

  A different DBMS is at each node and each DBMS works independently.

  ঘ

  A different DBMS is at each node and a central DBMS coordinates database access.
• A distributed database has which of the following advantages over a centralized database?
  ক

  Software cost

  খ

  Software complexity

  গ

  Slow Response

  ঘ

  Modular growth