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 Partial Key and Primary Key
A partial key, also known as discriminator, is the set of attributes which can uniquely identify weak entities that are related to similar owner entity. Primary key is a unique key but not comprise null values. An entity set can comprise at most one primary key.
Consider student (std_id, std_name, date_of_birth, phone, dept_name). Put the data for a student with student id200, name arun, birth date 1 February, 1985, phone number (01110 328
List the Armstrong's axioms for functional dependencies. What do you understand by soundness and completeness of these axioms? Ans: The Armstrong's axioms are: F1:
Explain the Recoverable Schedule A recoverable schedule is one in which for each pair of transactions Ti and Tj such that Tj reads a data item formerly written by Ti, the comm
Guidelines for creation of table: Table name should begin with an alphabet. In table name, single quotes and blank spaces are not allowed. Reserve words of that DBM
What is the role of ORDER By Clause? ORDER BY clause: The ORDER BY clause permits you to sort the records in your result set. The ORDER BY clause can just be used in select s
If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,
Explain the Difference between DROP and DELETE DELETE deletes one or more than one tuples of a particular relation from the database. DROP is employed to remove a table from th
Explain concept of inheritance with support of suitable example. Inheritance Inheritance is one of milestone of object-oriented programming language as it allows a creati
How does Oracle act as ODBC and give examples of front end uses with ODBC? ODBC achieve portability at the level of the executable by introducing an extra level of indirection.
Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is
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