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!
What are the problems if one were not to normalize? When do these problems surface?
Ans: Database normalization, sometimes considered to as canonical synthesis, is a method for designing relational database tables to minimize duplication of information and, in so doing, to preserve the database against specific types of logical or structural problems, that are data anomalies. For instance, when multiple instances of a given piece of information take place in a table, the possibility exists that these examples will not be kept consistent while the data within the table is updated, leading to a loss of data integrity. A table that is adequately normalized is less vulnerable to problems of this type, as its structure reflects the basic assumptions for while multiple instances of similar information should be denoted by a single instance only.
a) Suppose we updated the catalog tables in real time, that is, after every update, insert, or delete SQL statement were executed-rather than only running RUNSTATS once every few
(a) What is a Sub-Query? (b) What is the difference between a scalar sub-query and a tabular sub-query? (c) Write an equivalent SQL statement to get the Name of Product wh
what is attribute is attribute inheritance in dbms?
What is the difference among a database schema and a database state? The collection of information stored in database at particular moment in time is known as database state a
Example -Find the employee name, salary, department number and average salary of his/her department, for those employees whose salary is more than the average salary of that depart
Explain the cartesian product in Database Management System
Prove that a relation which is 4NF must be BCNF. Ans Let R be in 4NF. Suppose it is not in BCNF. Hence, there exists an FD X→Y in R such that x is not a super key. Although
Types of Locks There are two necessary types of locks: Binary lock : This locking mechanism has two states for to a data item: locked or unlocked Multiple-mode loc
In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning
Explain the Weak Entity Set An Entity set which does not have sufficient attribute to make a primay key is known as weak entity set. For instance, dependents of an employee in
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