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!
Security: Data not needed by local applications is not stored at the site, therefore no unnecessary security violations may exist.
But how can we carry out fragmentation? Fragmentation may be carried out as per the following rules:
a) Completeness: This rule makes sure that there is no loss of data while fragmentation. If a relation is decomposed into fragments, then every data item must appear in at least single fragment.
b) Reconstruction: This rule makes sure preservation of functional dependencies. It should be possible to describe a relational operation that will reconstruct the relation from its fragments.
c) Disjointness: A data item that shows in a fragment should not show in any other fragment. Though, a typical fragmentation known as vertical fragmentation is an exception to this rule. In vertical fragmentation the primary key attributes must be repeated to permit reconstruction of original relation.
This rule makes sure minimization of data redundancy. What are the dissimilar types of fragmentation?
Java program for horrizontal fragmentation in distributed database
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
Question : (a) Explain with the help of appropriate examples the difference between ‘Data' and ‘Information'. (b) A digital image is an array of pixels, where each pixel h
(a) Explain briefly the three parts of a relational Model. (b) Contrast the following terms with an appropriate example: (i) stored attribute v/s derived attribute (ii) en
State the Steps of Object Design Object design is a very iterative process in which various classes, relationships among objects are added when you move from one level to
Describe the nested-loop join and block-nested loop join. Ans: The block nested- loop join algorithm is as described below: for every block B r of relation R do beg
In an organisation various projects are undertaken. Each projects can employ one or more employees. Every employee can work on one or more projects. Each project is undertaken on
What is Primary key? Primary Key - Primary key is one of the candidate keys which uniquely identifies each row in the relation.
What is a cascading update? Referential integrity constraints needs that foreign key values in one table correspond to primary key values in another. If the value of the primar
What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.
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