Improved performance, Database Management System

Assignment Help:

Improved performance:As the data is located near the site of its demand, and given the inherent parallelism because of multiple copies, speed of database access may be good for distributed databases than that of the speed that is achievable by a remote centralised database. Also, since every site handles only a part of the whole database, there may not be the similar contention for CPU and I/O services as characterized by a centralised DBMS.

 


Related Discussions:- Improved performance

Transaction states, The following variant of the primary copy asynchronous-...

The following variant of the primary copy asynchronous-update replication protocol has been proposed for totally replicated systems. (a)  A transaction executing at site A updat

Write a short note on oracle instance, Write a short note on oracle Instanc...

Write a short note on oracle Instance? Oracle Instances: An instance is the (executed) Oracle software and the memory they use. It is the instance which manipulates the data s

Differentiate between static hashing and dynamic hashing, Differentiate bet...

Differentiate between static hashing and dynamic hashing.  Ans: Static Hashing comprises the number of primary pages in the directory fixed. So, while a bucket is full, we requ

What are temporary tables, What are temporary tables? Temporary tables...

What are temporary tables? Temporary tables exist solely for a particular session or whose data persists for the duration of the transaction.

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

What is a hashing function, What is a hashing function?  What are the prope...

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.      Ans:  Hashing function is a method

Example of database optimisation, Create 1 experiment to demonstrate an asp...

Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment

How does query tree represent relational algebra expression, How does a que...

How does a query tree represent a relational algebra expression?  Discuss any three rules for query optimisation, giving example as to when should each rule be applied.     Ans

Explain trivial dependency, Explain trivial dependency? Functional depe...

Explain trivial dependency? Functional dependency of the form α ->β. is trivial if α C β. Trivial functional dependencies are satisfied by all the relations.

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