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.
Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every
Given the following set of functional dependencies {cf?bg, g?d, cdg?f, b?de, d?c} defined on R(b,c,d,e,f,g) a.Find a non-redundant cover. b.Find a canonical cover.
What are the three classes of SQL expression? SQL expression consists of three clauses: Select From Where
what is 3nf
Accessing information about permissions to all users- Object level permissions: With the use of data dictionary you can see the permissions to user. Let us get the table name fro
Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen
Write the motivations led to development of OO-DBMS? 1. Programmer frustration with RDBMSs. 2. Requirement for special features.
Which product produces the relation that has attributes of R1 and R2 ? Cartesian product produce the relation which has attributes of R1 and R2
Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.
Consider the two relations given below Given that A is the primary key of R, D is the primary key of S and there is a referential integrity among S.A and R.A, discuss all
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