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

Develop a simple database of student records, In this programming assignmen...

In this programming assignment, you will develop a simple database of student records. Here are the requirements: 1) A student record contains a name and a number. We assume tha

Explain candidate key, Explain Candidate key? Candidate Key - A candi...

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

Data aggregation, Q.   Explain  data aggregatio n and discuss differen...

Q.   Explain  data aggregatio n and discuss different design constraints. Sol. Aggregation   One limitation of the E-R model is that it cannot express relationships amon

Concurrency control, Give the two reasons for allowing concurrency

Give the two reasons for allowing concurrency

Create a entity-relationship diagrams, This project requires you to create ...

This project requires you to create a database design.  Your design will be documented in a set of Entity-Relationship diagrams.  Draw a set of Entity-Relationship diagrams to mode

Relational database implementation, You must implement the entity relations...

You must implement the entity relationship model provided in the model solution to Assignment 1. The model solution will be released on the course website approximately TWO (2) we

Write short notes on relational model, Write short notes on relational mode...

Write short notes on relational model   The  relational  model  uses a  collection of  tables  to show  both data  and the relationships between those  data.  The relational mo

What is magnetic disks, What is magnetic disks?explain it? Magnetic dis...

What is magnetic disks?explain it? Magnetic disk provides the bulk of secondary storage of modern computer system. The disk capacity is growing at over 50% per year. But the st

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