Explain saving derived attributes to avoid re-computation, Database Management System

Assignment Help:

Saving Derived Attributes to Avoid Re-computation  

As discussed, "redundancy means duplication of exact data". But, if multiple copies of same data are present in the system, then it can increase chance of availability of data, but the problem of computing overhead is also associated with it.

To overcome this difficulty we can "cache" or store the redundant data in its computed form and classes or objects might be defined to retain this information. The class which contains cached data must be updated if any of objects that it depends on are changed.

Figure shows use of derived object and derived attribute in OMTool. Each class box contains an ordered list of operations and attributes, each represented as text string (left of diagram). Given the location of the class box itself, the location of each attribute can be computed by adding up the size of all the elements in front of it. Since location of each element is required frequently, location of each attribute string is computed and then stored. The region containing entire attribute list is also computed and saved. In this way, you can avoid the testing of input points against the attribute text element. It is shown in the right side in Figures. If a new attribute string is added to list, then locations of the ones after it in list are simply offset by size of the new element.

 

728_Derived attribute to avoid re-computation.png

                                                                       Figure: Derived attribute to avoid re-computation


Related Discussions:- Explain saving derived attributes to avoid re-computation

Entity set that does not have sufficient attributes known as, An entity set...

An entity set that does not have sufficient attributes to form a primary key is called? An entity set that doesn't have sufficient attribute to form a primary key is known as w

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

Describe the concepts of structural semantic data model, Question 1 List a...

Question 1 List and explain various Normal Forms. How BCNF differs from the Third Normal Form and 4th Normal forms? Question 2 Describe the concepts of Structural Semantic Da

Database Models, Benefits and Limitations od Data Models?

Benefits and Limitations od Data Models?

Vertical fragmentation, Vertical Fragmentation- Vertical fragmentation grou...

Vertical Fragmentation- Vertical fragmentation groups together only those attributes in a relation that are used jointly by various important transactions. A vertical fragment is d

Define the method of recursion, What is recursion? Is it possible for a sto...

What is recursion? Is it possible for a stored procedure to call itself or recursive stored procedure?  How many levels of SP nesting is possible? Recursion is method of proble

Define timestamp ordering, Define Timestamp ordering Ans In timestamp-b...

Define Timestamp ordering Ans In timestamp-based method, a serial order is made among the concurrent transaction by assigning to every transaction a unique nondecreasing number

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

Example of relational operations, Consider the relation PERSON. If you want...

Consider the relation PERSON. If you want to display details of persons having age less than or equal to 30 than the select operation will be used as follows: σ AGE The resu

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