Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Figure: Derived attribute to avoid re-computation
A relation has: Relational Schema Relation instance Relational Schema: A relational schema shows the relation's name, its attributes and the domain of every a
What is DataWarehousing? Subject-oriented, meaning that the data in the database is organized so that all the data elements relating to the similar real-world event or object
What is the difference between a HAVING CLAUSE and a WHERE CLAUSE? HAVING CLAUSE - HAVING CLAUSE is used only with SELECT statement. - It is normally used in a GROUP BY
What are referential integrity constraints? A value that appears in single relation for a given set of attributes also appears for a particular set of attributes in another rel
What is hash file organization? What are the causes of bucket overflow within a hash file organization? What can be completed to decrease the occurrence of bucket overflow?
3. (10 points) Assume that you have been presented with the following relation for the Baxter Aviation database: Charters (Pilot#, Pilot name, Aircraft ID#, #seats, Village, Fligh
Gaps in sequence values can happen when: - A rollback happens that is when a statement changes are not accepted. - When the system crashes - When a sequence i
What are the DBMS languages? Briefly explain? Data Definition language (DDL):A database schema is specified through a set of definitions expressed through a special language
Explain in details about the f unctions of DBA ?
Describe the nested-loop join and block-nested loop join. Ans: The block nested- loop join algorithm is as described below: for every block B r of relation R do beg
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd