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

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

Posted Date: 8/30/2013 5:17:18 AM | Location : United States

Related Discussions:- Explain saving derived attributes to avoid re-computation, Assignment Help, Ask Question on Explain saving derived attributes to avoid re-computation, Get Answer, Expert's Help, Explain saving derived attributes to avoid re-computation Discussions

Write discussion on Explain saving derived attributes to avoid re-computation
Your posts are moderated
Related Questions
Hello.I have database access assignment which consist of creation Form, Subform, Calculation, Macros

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

1.  Define each of the following IN YOUR OWN WORDS: (a)   File: (b)   Record: (c)   Field: (d)   Primary Key: (e)   Secondary Key: 2.  A travel agency wants t

how oracle can be used

What is authorization graph? Passing of authorization from single user to another can be shown by an authorization graph.

#question.what is mapping constraints and types?.

Nested Queries Let us see some more complex queries in this section. Sub-queries: Some of the basic concerns of sub-queries are: A sub-query is a SELECT statemen

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.