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!
Complete replication: It implies maintaining of a whole copy of the database at every site. Thus, the reliability & availability and performance for query response are maximized. Though, storage costs, communication costs, and updates are costly. To overcome some of these troubles relation, snapshots are sometimes used. A snapshot is definite as the copy of the data at a given time. These copies are updated periodically, like, hourly or weekly. Therefore, snapshots may not always be up to date.
What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec
Benefits: It limits data access. It makes difficult queries look easy. It permits data independence. It presents dissimilar views of the similar data.
Explain the θ-join and equijoin Refer tables Car and Boat which list models of cars and boats and their relevant prices. Assume a customer wants to buy a car and a boat, but sh
What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.
Discuss the count function? The COUNT function used returns the number of tuples or values fixed in a query. The count function comprises two types of syntax: (1) COUNT (*)
Greater potential for bugs: Since the sites of a distributed system operate simultaneously, it is more complex to ensure the correctness of algorithms. The art of constructing dis
Example : Search the name, department number and salary of employees drawing minimum salary in that department. SELECT ENAME, SAL, DEPTNO FROM EMP WHERE SAL IN (SELECT MI
Describe the advantage of State chart Diagram A state chart represents a state machine, emphasizing flow of control from one state to other. A state machine is a behaviour whi
Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.
Consider a bank that has a collection of sites, each running a database system. Suppose the only way the databases interact is by electronic transfer of money between one another,
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd