Security-data fragmentation, Database Management System

Assignment Help:

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?

 


Related Discussions:- Security-data fragmentation

Assignment, am looking for assignment helper for dbms

am looking for assignment helper for dbms

Although how will the system recover, Although how will the system recover ...

Although how will the system recover The selection of REDO or UNDO for a transaction for the recovery is completed on the basis of the state of the transactions. This state is

Define rotational latency time, Define rotational latency time. The ti...

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

Mysql, he SQL query that will return the order number, quantity ordered, pr...

he SQL query that will return the order number, quantity ordered, price each and total cost of an order (quantity * price each) from the order details table. Label the calculated c

Define- relational algebra, Define- relational algebra. The relational ...

Define- relational algebra. The relational algebra is a procedural query language. It having of a set of operations that take one or two relation as input and make a new relati

Define the term domain, Define the term Domain. For each n every attrib...

Define the term Domain. For each n every attribute there is a set of permitted values known as the domain of that attribute.

List and describe the different types of indexes, Question 1 Indexes are o...

Question 1 Indexes are ocasionally defines on a single field of a file called an indexing field. List and describe the different types of indexes Question 2 Consider a book i

Explain the structured decomposition, Differentiate between the object orie...

Differentiate between the object oriented decomposition and the structured decomposition? Process-oriented (structural) decomposition divides a complex process, function or tas

Division operation, To do the division operation R1 ÷ R2, R2 should be a co...

To do the division operation R1 ÷ R2, R2 should be a correct subset of R1. In the following example R1 have attributes A and B and R2 have only attribute B so R2 is a correct subse

What are the advantages of dbms, What are the advantages of DBMS ? 1. ...

What are the advantages of DBMS ? 1. Centralized Management and Control - One of the major advantages of using a database system is in which the organization could exert, thr

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd