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!
Explain weak and strong entity type ?
Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a weak entity set depends on the existence of a strong entity set; it must associate to the strong set via a on-to-many relationship set. A discriminator of a weak entity set is the set of attributes that distinguishes between all the entities of a weak entity set. The primary key of a weak entity set is formed by the primary key of the strong entity set on that the weak entity set is existence depends, plus the weak entity set's discriminator.
The database depicted in the Visio diagram describes Proceeding , Article , Researcher , article PublishedIn a proceeding, article WrittenBy researchers and proceedings Edi
Object-based Models: Use objects as key data representation components . Examples:- Entity-Relationship Model: It is a collection of real world objects known as entitie
You are managing the following database system: • DBMS: Oracle 11g • OS: Sun Solaris • System architecture: Web-based application using ASP.Net • Purpose of Server: HR managem
WHAT IS DATABASE TECHNOLOGIES
Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b
WRITE SHORT NOTES ON INDEX STRUCTURE OF FILES? There are two basic parts of indices 1. Ordered indices 2. Hash indices Every technique must be evaluated on the bas
Explain degree of relation? Degree of a Relation - The degree or arity of a relation is the number of attributes n of its relation schema.
Consider an information system designed for an online company which provides IT products and services These include desktops, laptops, networking products, IT books, parts, and
The Database MySQL scripts cars_for_sale.sql and car_details.sql containing the data to use for this task have been supplied. To complete this task, you need to first create
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,
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