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!
Explain the term- Periodic recomputation
Periodic recomputation: Base values are often updated in bunches. Sometimes, it is possible to just recompute all derived attributes periodically without recomputing derived attributes after each base value is altered. Recomputation of all the derived attributes can be more proficient than incremental update since some derived attributes may depend on many base attributes and might be updated more than one time by an incremental approach.
Also, periodic recomputation is easier than explicit updates and less prone to bugs. While, if data set changes incrementally, some objects at a time, periodic recomputation is not practical since too many derived attributes may be recomputed when only a little are affected.
List any two significant differences between a file processing system and a DBMS. File Processing System vs. DBMS Data Independence - Data independence is the capacity t
Give an example of Object Representation For illustration, consider the implementation of a social security number within an employee object that is shown in Figure. The soci
Atomicity: It describes a transaction to be a one unit of processing. We can also say either a transaction will be finished completely or not at all. In the transaction example 1
What subschema expresses ? A subschema expresses the external view. (External schemas are called also called as subschemas)
Explain hash file organization? Hash functions a) The distribution is uniform Hash functions assign each bucket the similar number of search -key values from the set of a
For each 1: n relationship type R involving two entities E1 and E2, we recognize the entity type (say E1) at the n-side of the relationship type R and contain primary key of the en
Write short notes on relational constraints? Relational Constraints are: 1. NOT NULL 2. Unique 3. Primary key 4. Foreign key 5. Table check
Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient. Figure:
What do you mean by an execution plan? Why is it used? How will you view it? a.) An execution plan can be known as a road map which textually or graphically illustrates the dat
Domain Constraints Domain constraints are primarily formed for defining the logically correct values for an attribute of a relation. The relation allows attributes of a relatio
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