Blog

Consider the following relations:  Suppliers(sid: integer, s…

Consider the following relations:  Suppliers(sid: integer, sname: string, address: string) Parts(pid: integer, pname: string, color: string) Catalog(sid: integer, pid: integer, price: real) Write the following queries in SQL and translate each of them into two equivalent relational algebra:  a. Find the names of suppliers who supply all blue parts. b. Find the names and pids of parts that have a price less than 200 dollars So the deliverables should be two SQL statements and 4 relational algebras. For relational algebra, use the following notation:  Selection: 

You are hired to help the Lead Technical Analyst of the FBI…

You are hired to help the Lead Technical Analyst of the FBI Behavioral Unit in joining various tables and doing cross-references to help the FBI field agents to fight crimes. You are working up against an incredibly tight deadline because the suspects (the “unsub”) may strike again in 24 hours. The tables that you are working with are big, but not sorted or indexed. You need to implement a decent join algorithm.  Will you choose tuple-based nested-loop join, block-based nested-loop join, sort-merge join, or hash join? Please justify your answer, i.e., clearly explain why you think your choice is the best among these 4 options by discussing inputs, pseudocode, and complexity for the join algorithm you are choosing. 

Reading B Read the following Japanese folktale. (1 x 5 = 5)…

Reading B Read the following Japanese folktale. (1 x 5 = 5) 強(つよ)い＝strong　都(みやこ)＝capital; metropolis　お姫(ひめ)さま＝princess　家来(けらい)＝servant　鬼(おに)＝demon Choose “True” if the information is correct. If the information is not correct, choose “False”. Issunboshi is short but a strong boy. [1] Issunboshi wanted to go to the capital to become a rich samurai. [2] Issunboshi was spending time with the princess and didn’t work hard. [3] The demon wanted to take the beautiful princess to home. [4] Issunboshi and the princess married, and they had a nice life. [5]