Explain th process to avoid re-computation, Database Management System

Assignment Help:

Saving Derived Attributes to Avoid Re-computation

Data that is derived from other data should be stored in the computed form to avoid re-computation. For this, we could define new classes and objects and these derived classes must be updated if any of the base objects is changed.

 


Related Discussions:- Explain th process to avoid re-computation

Management information system, Explain the challenges before an E-business ...

Explain the challenges before an E-business management.

Sparse and dense indexes, Sparse and Dense Indexes These indexes in pri...

Sparse and Dense Indexes These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are: They are arranged

Cases of constraint violations, (1)     Insert into PERSON Violated con...

(1)     Insert into PERSON Violated constraint: - Key constraint Reason: - Primary key 1 already exists in PERSON. Dealing: - DBMS could ask the user to provide valid PER

Describe the algorithm to draw the dependency graph, Describe the algorithm...

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Explain growing phase of locking, Explain Growing Phase of locking Grow...

Explain Growing Phase of locking Growing Phase: In this phase the transaction can only obtain locks, but cannot release any lock. The transaction enters the growing phase as so

What type of view of total database content, What type of view of total dat...

What type of view of total database content? Data base content Conceptual view of total database contain.

What is indexed sequential file organization, What is indexed sequential fi...

What is indexed sequential file organization? What are the applications of this organization?  Ans: An index file can be employed to effectively overcome the problem of storing

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

Find a 3nf decomposition , Find a 3NF decomposition of the following relati...

Find a 3NF decomposition of the following relation scheme: University (Faculty, Dean, Department, Chair, Professor, Rank, Student}. The University relation satisfies the following

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