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

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

Multilevel indexing scheme, Multilevel Indexing Scheme Consider the ind...

Multilevel Indexing Scheme Consider the indexing scheme where the address of the block is consider in the index for each record, for a little file, this index would be little a

Define atomicity and aggregation, Atomicity : Either all functions are lai...

Atomicity : Either all functions are laid out or none are. Users could not have to think about the effect of incomplete operations. DBMS ensures this by undoing the functions

How does the system cope up with a record crash, How does the system cope u...

How does the system cope up with a record crash when recovery is going on after the first crash? Ans:  In a system the undo and redo operations are needed to be idempotent to c

Insert statement reverses storage space and transfers value, A field-groups...

A field-groups statement or an insert statement reverses storage space and transfers values. False.

Draw an er diagram for organization of a student database, Draw an ER diagr...

Draw an ER diagram that shows the organization of a simple student database. The database captures the information about letter grades obtained by university students who enrolled

Entity relationship, how to write tables and drow E-R diagrams for hosiptal...

how to write tables and drow E-R diagrams for hosiptal management system and how to normalize and cardinalities?

Explain difference between volatile, Explain the difference between the thr...

Explain the difference between the three storage types - volatile, non volatile and stable.             Ans: Volatile storage: if storage media loses data while power goes off,

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