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.
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
Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by
Distributed Database Management System
Differentiate between a Global and a Local temporary table? - A local temporary table exists only for the duration of a connection or if defined inside a compound statement, fo
Aggregation : One limitation of the E-R diagram is that they do not permit representation of relationships between relationships. In such a case the relationship along with its ent
Indexed (Indexed Sequential) File Organisation It organises the file like a big dictionary, i.e., records are kept in order of the key but an index is stored which also allows
Determine the Persistent object Persistent object can be stored in one of the following: Files Cheap, permanent, simple storage Low level (Write, Read) Ap
Define a relation ? Relation - A relations is a named two-dimensional table of data. Mathematically, a relation can be described as a subset of the cartesian product of a lis
project on dbms
Define seek time. The time for repositioning the arm is known as the seek time and it enhances with the distance that the arm is known as the seek time.
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