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!
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 considering some of its attributes in conjunction with the primary key attributes of another entity, which is known as the identifying owner entity.
Usually a partial key is attached to a weak entity type that is used for unique identification of weak entities associated to a particular owner entity type. The following restrictions must hold:
Explain Composite attribute in SQL ? Composite attribute: A composite attribute has many components, each of that is atomic or composite.
Given the following relations Vehicle (Reg_no, make, colour) Person(eno, name, address) Owner(eno, reg_no) Write expressions in the relational algebra to answer the following
What is a transaction ? The Transaction is a unit of data processing. For instance, many of the transactions at a bank may be withdrawal or deposit of money; transfer of money f
lock and types of lock
What are the advantages of creating a table from existing table?
A distributed database is defined as "a collection of multiple logically interrelated database which are physically distributed over a computer network" (a) Give any three advan
What is called mirroring? The simplest approach to introducing redundancy is to duplicate each disk. This method is called mirroring or shadowing.
Define the concept of aggregation. Give two examples where this concept is useful. Ans: Aggregation transforms a relationship among the objects into a higher-level object. A
Define access time. Access time is the time from when a read or write request is issued to when data transfer starts.
What is a query tree? Ans: A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu
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