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
What is inheritance? Define it in detail? Inheritance Inheritance can be at the levels of types, or at the level of tables we first consider inheritance of types, then i
Set Difference If R1 and R2 are two union compatible relations or relations then result of R3 =R1- R2 is the relation that have only those tuples that are in R1 but not in R2.
#Use the following database schema: 1) Patient—PatientID, Name, DOB 2) Doctor—DoctorID, Name, MedLicenseNumber, Phone 3) Medication—MedicationID, BrandName, GenericName 4) Prescrip
Explain the structure of well formed formulae in relational calculus. Ans: a. An atom is a formula b. If P1 is a formula, after that so are ¬P1 and (P1) c. If P1 and P2 a
Explain the concept of generalization and aggregation in E_R diagrams. Give one example for each one of them? Generalization: Consider extending the entity set account throug
Modular growth: In distributed environments, it is simple to expand. Latest sites can be added to the network without affecting the operations of other sites, as they are somewhat
WRITE SHORT NOTES ON INDEX STRUCTURE OF FILES? There are two basic parts of indices 1. Ordered indices 2. Hash indices Every technique must be evaluated on the bas
What are the comparison operator in SQL? Comparison operator in SQL are =, LIKE and BETWEEN
Determine the Persistent object Persistent object can be stored in one of the following: Files Cheap, permanent, simple storage Low level (Write, Read) Ap
#quCreate a database design specification (Enhanced Entity Relationship Diagram (EERD) and Relational Data Model (RDM)) from the given business description. The RDM must be in 3rd
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