Increased parallelism-data replication, Database Management System

Assignment Help:

Increased parallelism: Since the replicated date has several copies a query can be distributed or can be answered from the smallest loaded site. Also, with more replicas you have greater chances that the required data is found on the site where the transaction is implementing. Hence, data replication can minimise movement of data among sites.


Related Discussions:- Increased parallelism-data replication

What is a primary key, What is a primary key? Primary key is chosen by ...

What is a primary key? Primary key is chosen by the database designer as the principal means of identifying an entity in the entity set.

ER diagram in database, What is an ER diagram? Why is it used in Database m...

What is an ER diagram? Why is it used in Database management system (DBMS)?

Hashing, how to implement mid square hashing?

how to implement mid square hashing?

What are audit trails, What are audit trails? An audit trail is a log o...

What are audit trails? An audit trail is a log of all alters to the database along with information like which user performed the change and when the alter was performed.

What is difference among mysql_connect and mysql_pconnect, What is differen...

What is difference among mysql_connect and mysql_pconnect? Mysql_connect() opens a new connection to the database while mysql_pconnect() opens persistent connection to the data

Describe about use case and external case in dfd, Describe about Use Case a...

Describe about Use Case and external case in DFD The processes are transformed those into the Use Case and external case in DFD has same characteristics which of an actor in O

When is a transaction rolled back, When is a transaction rolled back? A...

When is a transaction rolled back? Any changes that the aborted transaction made to the database must be uncompleted. While the changes caused by an aborted transaction have be

B-tree, construct a b-tree for the following set of key values 2,3,5,7,11,1...

construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order

Define the query optimisation, Define the Query optimisation The query ...

Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd