N-ary relationship, Database Management System

For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the participating entity types. We also contain any easy attributes of the n-ary relationship type (or easy components of complete attributes) as attributes of S. The primary key of S is generally a combination of all the foreign keys that reference the relations showing the participating entity types. Figure  is a special case of n-ary relationship: a binary relation.

Posted Date: 3/6/2013 6:28:06 AM | Location : United States







Related Discussions:- N-ary relationship, Assignment Help, Ask Question on N-ary relationship, Get Answer, Expert's Help, N-ary relationship Discussions

Write discussion on N-ary relationship
Your posts are moderated
Related Questions
10A.53 Code an Oracle Database trigger to enforce the constraint that an employee can never change his or her department. 10A.54 Code an Oracle Database trigger to allow the delet

What is normalization? It is a method of analysing the given relation schemas based on their Functional Dependencies (FDs) and primary key to attain the properties (1).Minim

What is Hierarchical DBMS In HDBMS, data is structured in a tree like manner. There is a parent-child relationship between data items and the data model is very suitable for re

write-set(T): Each data items that are written by a transaction T

Object-oriented decompositions Object-oriented decompositions of systems better are able to cope with change. Each subsystem has a well-defined interface which communicates with

Explain the concept of a data model ? Data Model - Model is an abstraction procedure which hides irrelevant details although highlighting details relevant to the application

Multi-Key File Organisation In this part, we will introduce two basic file Organisation schemes that permit records to be accessed by more than one key field, therefore, allowi

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

Part 1: Security Plan Consider the Case study and identify 3 security requirements. For each of these security requirements: • Discuss the necessity for the feature and how

write a short note on participation role? Participation role: roles are indicating in E-R diagram by labelling the lines that connect diamonds to rectangles.