Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 2 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Engineering Posted 04 May 2017 My Price 10.00

Given two relations R1 and R2,

Given two relations R1 and R2, where R1 contains N1 tuples, R2 contains N2 tuples, and N2 > N1 > 0, give the minimum and maximum possible sizes (in tuples) for the result relation produced by each of the following relational algebra expressions. In each case, state any assumptions about the schemas for R1 and R2 that are needed to make the expression meaningful:

 

Answers

Alpha Geek
(8)
Status NEW Posted 04 May 2017 09:05 AM My Price 10.00

-----------

Attachments

file 1493889585-Answer.docx preview (433 words )
G-----------ive-----------n t-----------wo -----------rel-----------ati-----------ons----------- R1----------- an-----------d R-----------2, -----------whe-----------re -----------R1 -----------con-----------tai-----------ns -----------N1 -----------tup-----------les-----------, R-----------2 c-----------ont-----------ain-----------s N-----------2 t-----------upl-----------es,----------- an-----------d N-----------2 &-----------amp-----------;gt-----------; N-----------1 &-----------amp-----------;gt-----------; 0-----------, g-----------ive----------- th-----------e m-----------ini-----------mum----------- an-----------d m-----------axi-----------mum----------- po-----------ssi-----------ble----------- si-----------zes----------- (i-----------n t-----------upl-----------es)----------- fo-----------r t-----------he -----------res-----------ult----------- re-----------lat-----------ion----------- pr-----------odu-----------ced----------- by----------- ea-----------ch -----------of -----------the----------- fo-----------llo-----------win-----------g r-----------ela-----------tio-----------nal----------- al-----------geb-----------ra -----------exp-----------res-----------sio-----------ns.----------- In----------- ea-----------ch -----------cas-----------e, -----------sta-----------te -----------any----------- as-----------sum-----------pti-----------ons----------- ab-----------out----------- th-----------e s-----------che-----------mas----------- fo-----------r R-----------1 a-----------nd -----------R2 -----------tha-----------t a-----------re -----------nee-----------ded----------- to----------- ma-----------ke -----------the----------- ex-----------pre-----------ssi-----------on -----------mea-----------nin-----------gfu-----------l: ----------- -----------  ----------- An-----------swe-----------r: ----------- 1.----------- T-----------he -----------min-----------imu-----------m n-----------umb-----------er -----------of -----------tup-----------les----------- fo-----------r
Not Rated(0)