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.
Give a brief introduction of the term universe in SQL? Brief explain the kinds of universes in business objects?
Explain the term Chasm trap?
Explain the Stored Procedure transformation?
Explain what is meant by the Drill up/down/by/through?
List out the regions in which data structures are applied widely?
Is it possible that two tasks be assigned to the similar Partition in Sybase?
When must you seem de-normalization?
Define the term spanning Tree?
Write about the term Attribute, Entity and Relationship?
Illustrates the case statement present into stored procedure?
18,76,764
1925973 Asked
3,689
Active Tutors
1453431
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!