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!
Q. Describe how an ER schema can be represented by relation schemas and constraints arising from ER design can be mapped to constraints on a relation schema.
The entity relationship data model is based on a perception of a real world that consists of basic objects called entities and of relationships among these objects. An entity is thing or object in the real world that is distinguishable from other objects. For eg., each person is an entity and band accounts can be considered as entities. Entities are described in a database by set of attributes. For eg., the attributes account number and balance may describe one particular acconunt in a bank and they form attributes of the account entity set. An extra attribute customer id is used to uniquely identify customers. A relationship is an association among several entities. For eg., a depositor relationship associates a customer with each account that he has. The set of all entities of the same type and the set of all relationship of the same type are called entity set and relationship set respectively. The overall logical structure of a database can be expressed graphically by and ER diagram, which is buily up using : R ectangles - which represent entity sets Ellipses - which represent attributes Diamonds - which represent relationships Lines - which represent link attributes to entity sets. Each component is labelled with the entity or relationship that it represents. Constraints to which the contents of database must confirm. For eg., mapping cardinalities, which express the number of entities to which another entity can be asociated via a relationship set.
Relations create the database. They must satisfy various properties, like no duplicate tuples, no ordering of tuples, and atomic attributes, etc. Relations that satisfy these basic
Timestamp Ordering Protocol A timestamp is a tag that can be attached to any transaction or any data item, which indicates a specific time on which the transaction or data item
Define Shared locks? Ans: Shared lock: Throughout concurrent execution of transactions, earlier than a transaction can access a data item, it has to obtain a lock on it. Now he
I need help with data warehousing and business intelligence course project about designing a data warehouse for a jewelry company that does not have one
Derived horizontal fragmentation: Some applications may include a join of two or more relations. If the relations are stored at dissimilar locations, there may be a major overhead
PART MARKING: We will only mark TWO of the four questions below but you must submit answers to all four. We will choose the questions we mark randomly and we will supply you with
Describe the algorithm to draw the dependency graph? Ans: Algorithm to draw Precedence Graph is like this: a. For every transaction T i participating in schedule S, make
Describe the candidate key functions ? Candidate Key and Alternate Key: In some instances, an entity will have more than one attribute which can serve as a primary key. Any key
Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?
Ask question #MinimThe Georgia Tech Library (GTL) has approximately 16,000 members, 100,000 titles, and 250,000 volumes (an average of 2.5 copies per book). About 10 percent of the
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