Database Concepts (8th Edition)
8th Edition
ISBN: 9780134601533
Author: David M. Kroenke, David J. Auer, Scott L. Vandenberg, Robert C. Yoder
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 5, Problem 5.34RQ
Explanation of Solution
Intersection Table:
- Relational
database system will not allow the user to implement a direct many-to-many relationship. So, the many-to-many relationship will break into two one-to-many relationships by using third table, it is called as “intersection table”. - The intersection table contains primary key of the two tables as a foreign key.
Recursive many-to-many relationship (N:M):
- Recursive many-to-many relationship is one of the types of recursive binary relationship that refer to the relationship between two entities which means many fields or records in a table are associated with many fields or records in another table in recursive manner.
- Let us consider the example:
- The “Agent” can buy or sell the property to any other agent in recursive manner.
Explanation:
- The “Agent_ID” is a primary key of the “Agent” table. The “Agent_for_Agent” is the intersection table which contains “Client_Agent_ID” and “Selling_Agent_ID” as the foreign keys.
- “Client_Agent_ID” contains the “Agent_ID” of the agent buying the property and “Selling_Agent_ID” contains the “Agent_ID” of the agent acting as the selling agent...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Give some instances of relationships that may have more than one candidate key to consider.
What is aproximiation, and how can it be performed using fuzzy relation?
Convert the following relation to 2NF, and then to 3NF. Show both conversions. (h, n, c, a, f, k, p, r, g, i, m, b, o, d, j, l, s, e) Functional Dependencies: p → j m, b → l h → g n → p n → o c → i n → j p → o h → d s → e a → r
Chapter 5 Solutions
Database Concepts (8th Edition)
Ch. 5 - Explain how entities are transformed into tables.Ch. 5 - Prob. 5.2RQCh. 5 - Prob. 5.3RQCh. 5 - What is denormalization?Ch. 5 - Prob. 5.5RQCh. 5 - Explain the problems that denormalized tables may...Ch. 5 - Explain how the representation of weak entities...Ch. 5 - Explain how supertype and subtype entities are...Ch. 5 - Prob. 5.9RQCh. 5 - Prob. 5.10RQ
Ch. 5 - Show two different ways to represent the 1:1...Ch. 5 - Prob. 5.12RQCh. 5 - Prob. 5.13RQCh. 5 - Prob. 5.14RQCh. 5 - Prob. 5.15RQCh. 5 - Prob. 5.16RQCh. 5 - For your answer to question 5.15, code an SQL...Ch. 5 - Prob. 5.18RQCh. 5 - Prob. 5.20RQCh. 5 - Prob. 5.21RQCh. 5 - Explain how the terms parent table and child table...Ch. 5 - For your answers to questions 5.20, 5.21, and...Ch. 5 - Prob. 5.24RQCh. 5 - Prob. 5.25RQCh. 5 - Prob. 5.26RQCh. 5 - Prob. 5.27RQCh. 5 - Prob. 5.28RQCh. 5 - Define the three types of recursive binary...Ch. 5 - Prob. 5.30RQCh. 5 - Prob. 5.31RQCh. 5 - Prob. 5.32RQCh. 5 - Prob. 5.33RQCh. 5 - Prob. 5.34RQCh. 5 - Code an SQL statement that creates a table with...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Match each of the following Set relationship representation with its corresponding ERD representationarrow_forwardDiscuss the concept of a fuzzy relation. How are fuzzyrelations used?arrow_forwardWhy do we still use linear data structures when we could just as easily use non-linear data structures? Please illustrate your answer with an example and provide an explanation to support it.arrow_forward
- Using a graphics program, develop an entity-relationship diagram for a database application for an Internet bookstore where students buy textbooks from a salesperson and receive invoices for their purchases. Use Figure 5.5 as a guide.arrow_forwardDoes a higher value of k lead to a more complex model, or a less complex model?arrow_forwardIs it possible to utilize two clustering indices for different search keys on the same relation in general? Describe how you arrived at your conclusion.arrow_forward
- i need a better explaarrow_forwardHow does the linker differentiate between these two procedures that seem to be quite similar to one another?arrow_forwardFor each of the short procedures, state the computational complexity in terms of the variables N, M, P, and K, as appropriate. Assume that all data structures are defined, that those without indexes are scalars and that those with indexes have the number of dimensions shown.arrow_forward
- A main disadvantage of data matching using probabilistic approaches is that they take far longer to run than non-probabilistic approaches. True or false?arrow_forwardGive examples of relations that demonstrate that the expressions aren't equal for each of the following pairs of expressions. Would both instances of max in the preceding phrases be comparable if they were replaced with min?arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningNp Ms Office 365/Excel 2016 I NtermedComputer ScienceISBN:9781337508841Author:CareyPublisher:Cengage
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage