Recursive relationships in a database design
How can we handled are recursive relationships in a database design? Describe briefly?
Expert
A recursive relationship is a relationship between entities of the same class, and is represented in the similar way as other relationships are. The rows of the tables can take two various roles, but. Some are parent rows, and the others are child rows. Furthermore, the table will contain both its own primary key and the foreign key which links back to the table itself. When a row has no parent, then the value of the foreign key column in which row will be null. If the row has a parent, then there should be a foreign key value in that row which corresponds to the primary key value of any other row in the table.
Describe the difference between SQL Server 2000 clustered indexes and non clustered indexes?
What does it mean when we say that a relation is in Boyce-Codd Normal Form (BCNF)?
Explain the Slice and Dice attribute in the Business Objects?
What is the corresponding of Oracle/Db2 Coalesce Function within Sybase?
Write down the differentiation between lookup and filter transformation?
Explain the operations that can be done with the Data Stage Director?
Write about the term Attribute, Entity and Relationship?
What do you understand by the term deadlock in DBMS? How can it be avoided? How can it be solved once it happens?
What is meant by the Drill Through?
Define the term DataStage?
18,76,764
1958659 Asked
3,689
Active Tutors
1452355
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!