Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 399 Weeks Ago, 2 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 22 Sep 2017 My Price 4.00

Sailors relation

Consider again the schema with the Sailors relation: 

Sailors(sid: integer, sname: string, rating: integer, age: real)

Assume that each tuple of Sailors is 50 bytes long, that a page can hold 80 Sailors tuples, and that we have 500 pages of such tuples. For each of the following selection conditions, estimate the number of pages retrieved, given the catalog information in the question.

1. Assume that we have a B+-tree index T on the search key _ Sailors.sid _, and assume that IHeight(T) = 4, INPages(T ) = 50, Low(T ) = 1, and High(T ) = 100,000.

(a) σSailors.sid<50,000(Sailors)

(b) σSailors.sid=50,000(Sailors)

2. Assume that we have a hash index T on the search key _ Sailors.sid _, and assume

that IHeight(T) = 2, INPages(T ) = 50, Low(T ) = 1, and High(T ) = 100,000.

(a) σSailors.sid<50,000(Sailors)

(b) σSailors.sid=50,000(Sailors)

Answers

Maurice Tutor
(5)
Status NEW Posted 22 Sep 2017 09:09 PM My Price 4.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)