Parallelism of transaction execution-data fragmentation, Database Management System

Assignment Help:

Parallelism of transaction execution: A transaction can be divided into various sub-queries that can operate on fragments in parallel. This enhances the degree of concurrency in the system, therefore allowing transactions to execute efficiently.

 


Related Discussions:- Parallelism of transaction execution-data fragmentation

Improved reliability, Improved Reliability: In a centralised DBMS, a server...

Improved Reliability: In a centralised DBMS, a server failure stops the operations of the DBMS. Though, a failure at single site of a DDBMS, or a failure of a communication link cr

Differentiate between natural join and outer join, Differentiate between na...

Differentiate between natural join and outer join? Natural join is a binary operator which is written as (R * S) where as R and S are relations. The output of the natural join

What are the advantages of having an index structure, What are the advantag...

What are the advantages of having an index structure?      Ans: The index structures commonly provide secondary access paths, which offer alternative ways of accessing the reco

What is deadlock, What is deadlock? Neither of the transaction can ever...

What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.

Entity identifier key attributes, An entity type usually has an attribute w...

An entity type usually has an attribute whose values are distinct for every individual entity in the collection. Such an attribute is known as a key attribute and its values can be

What is transaction, What is transaction? Transaction is a unit of prog...

What is transaction? Transaction is a unit of program implementation that accesses and possibly updated several data items.

Aggregation, What does Aggregation mean?

What does Aggregation mean?

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

State the objectives of object design, Determine the OBJECTIVES of  object ...

Determine the OBJECTIVES of  object design After passing through this unit, you should be able to: describe and apply concept of generalisation; understand and appl

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