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?
What is Secondary Index While making the index, generally the index table is kept in the primary memory (RAM) and the main table, because of its size is keeps in the secondary
A Structure of a dependency diagram
What is Relational DBMS This is our subject of study. A DBMS is relational if the data is organized into relations, that is, tables. In RDBMS, all data are kept in the well-kno
FDs in Relationships: Enrols Relationship: None as it is many to many Teaches Relationship : Course code → Instructor Instructor → Course code The next question is:
Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit
The result of the UNION operation between R1 and R2 is a relation that includes? The result of the operation between R1 and R2 includes all the tuples of R1 and R2 which have c
The Conceptual Level or Global level The conceptual level presents a logical view of the complete database as a unified whole. It permits the user to bring all the data in th
Support by Adding Indexes Multiple indexes can be used to access a data file by multiple access paths. In such a scheme only single copy of the data is consider, only the numbe
joins
Which method of access uses key transformation? A Hash method of access uses key transformation.
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