Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
A distributed transaction consists of subtransactions that execute at different sites and access local DBMSs at those sites. For example, a distributed transaction that transfers money from a bank account at site A to a bank account at site B executes a subtransaction at A that does the withdrawal and then a subtransaction at B that does the deposit.
Such a distributed transaction must satisfy the ACID properties in a global sense: it must be globally atomic, isolated, consistent, and durable. The issue is, if the subtransactions at each site individually satisfy the ACID properties, does the distributed transaction necessarily satisfy the ACID properties? Certainly if the subtransactions at each site are individually durable, the distributed transaction is durable. Give examples of situations in which
(a) The subtransactions at each site are atomic, but the distributed transaction is not atomic.
(b) The subtransactions at each site are consistent, but the distributed transaction is not consistent.
(c) The subtransactions at each site are isolated, but the distributed transaction is not isolated.
Explain Composite attribute in SQL ? Composite attribute: A composite attribute has many components, each of that is atomic or composite.
Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli
What is meant by heuristic optimisation? Discuss the main heuristics that are applied during query optimisation. Ans: In heuristic optimization, heuristics are employed to r
what is attribute is attribute inheritance in dbms?
1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict
What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.
What are the properties of transaction? There are three properties of transactions :- A) Atomicity B) Consistency C) Isolation
Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that
Question: Describe briefly the three parts of the Relational Model. (a) The term integrity refers to the accuracy or correctness of the data in the database. Define the fol
Explain the Recoverable Schedule A recoverable schedule is one in which for each pair of transactions Ti and Tj such that Tj reads a data item formerly written by Ti, the comm
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd