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!
Define physical and logical data independence. How does this architecture help in achieving these?
Data independence entails that change in one view must not need a change in the view(s) above. There are two sorts of data independence: logical and physical. The meaning of Logical data independence is that the conceptual view can be changed without influencing the existing external view, that is a given record may be spilt or combined along with other records but the external views need not be modified to reflect this. The meaning of Physical data independence is that the physical storage structures or devices employed to store the data can be changed without effecting the existing conceptual view or external view, that is if earlier indexed sequential files are employed to store data and then the B- trees are used, even then the upper layers must not be effected.
Write short notes on relational constraints? Relational Constraints are: 1. NOT NULL 2. Unique 3. Primary key 4. Foreign key 5. Table check
what is union compatable?
What does Aggregation mean?
Suppose R is a relation with attributes A1, A2,..., An. As a function of n, tell how many superkeys R has, if: 1.1 The only key is A1. 1.2 The only key is A1 and A2. 1.3 The o
Single-Valued Dependencies A database is a collection of related information and it is therefore inevitable that some items of information in the database would depend on some
Define page. The database is partitioned into some number of fixed-length blocks, which are referred to as pages.
Why Like predicate used for? LIKE predicate: The LIKE predicate searches for strings in which have a certain pattern.
Explain Hierarchical Model ? Hierarchical Model - It was established to model several kinds of hierarchical organizations which exist in the real world. It uses tree structur
Write short notes on domain relational calculus The domain relational calculus uses domain variables that take on values from an attribute domain rather than values for whole t
Explain the difference between optimistic locking and pessimistic locking. Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it
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