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 partial, alternate,, artificial, compound and natural key?
Partial Key: It is a set of attributes that can uniquely recognize weak entities and that are related to same owner entity. It is sometime known as Discriminator.
Alternate Key: All Candidate Keys excluding the Primary Key are called as Alternate Keys.
Artificial Key: If no obvious key either stands alone or compound is available, then the last resort is to simply make a key, by assigning a unique number to every record or occurrence. Then this is known as developing an artificial key.
Compound Key: If no single data element uniquely identifies occurrences within a construct, then combining multiple elements to make a unique identifier for the construct is known as creating a compound key.
Natural Key: When one of the data elements stored within a construct is utilized as the primary key, then it is known as the natural key.
What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.
Explain the two constraints, check and foreign key in SQL along with an example for each. Give the syntax. CHECK constraint - CHECK constraint specifies an expression which
Consider the subsequent relation schemes: Project (Project#, Project_name, chief_architect) Employee (Emp#, Empname) Assigned_To (Project#, Emp#) Give expression i
Define shadow paging. An alternative to log-based crash recovery method is shadow paging. This technique requires fewer disk accesses than do the log-based methods.
Determine the rule that a value of a foreign key should appear as a value of some particular table is called a Ans: Referential constraint. The rule that a value of a fo
Defining Internal Classes and Operations When we enlarge algorithms, new classes can be added to the store intermediate results. A complex operation could be looked at, as a c
Heap files (unordered file) Mostly these files are unordered files. It is the easiest and most basic type. These files having of randomly ordered records. The records will have
In an E-R diagram an entity set is represent by? In an E-R digram entity set is represted by rectangle.
Define union compatibility? Explain why INTERSECTION of two relations cannot be performed if they are not union compatible? Two relations R(A1, A2,-------, An) and S(B1, B2,--
Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set
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