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.
Which language has presently become the defacto standard for interfacing application programs along with relational database system? The language which has recently become the
Types of Data fragmentation
(a) Design a query plan for the following distributed query: An application at site B wants to compute a join of STUDENT ? Id=StudId TRANSCRIPT where STUDENT (Id,Major) is at site
Create an index for the table Client, field CLIENT_NO of Q ? Command: CREATE INDEX client_client_no ON client(client_no);
Locks: Serialisabilty is just a test whether a given interleaved schedule is ok or has a concurrency related trouble. Though, it does not make sure that the interleaved concurrent
Representing complex relationship among data A database may contain varieties of data interrelated to each other in numerous ways. A DBMS must have the capability to represent
Differentiate between B-tree and B + tree Ans: A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time
Northwind Pty Ltd sells a variety of food products throughout the world. They want to use the reporting features of SAP''s Business Information Warehouse to better understand thei
Create centralized relational database using bottom up method. (a) Recognize a single un-normalized relation for the above scenario. (b) Recognize the primary key for
Introductory course and so does not require any fancy coding. I will provide a guidance document to help you in producing the solutions.
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