DATA/FILE STRUCTURES

10 points

1. A table has 250,000 Customer records of fixed-length. Each row has the following columns:

NAME (20 bytes)

ID (9 bytes)

ADDRESS (40 bytes)

PHONE (9 bytes)

BIRTHDATE (8 bytes)

GENDER (1 byte)

PRODCODE (4 bytes)

DEPTCODE (4 bytes)

CATCODE (4 bytes)

BUYERPROGRAM (3 bytes)

An additional byte per row is used as a deletion marker.

a. Calculate the row (record) size R in bytes.

b. Calculate the table size (T) in bytes.

c. Assuming a 512 byte block, calculate the number of blocks required assuming a

spanned

block

organization. where each block uses a 5-byte pointer to the next block.

2. Create a B+-tree index for the following sequential data. Think about what you will need to do to create

the index. Make sure your index values are well balanced. Show the path that the system would take to find

the record for Norton:

Use Figure 5-7 in Chapter 5 on page 222 as a guide or the following link for assistance:

http://sqlity.net/en/2445/b-plus-tree/

Harshman

Douglass

Stokes

Keller

Wassef

Beck

Walker

Wehe

Daisley

Kolber

Fegley

Ainley

Banks

Siu

Bartter

Russell

Palermo

Rucker

Mclain

Shields

Maestas

Beasley

Vogel

Blackwelder

Kjeell

Silverberg

Condreay

Boklage

Bidwell

Oller

Calnin

Sanders

Rodriguez

Couto

Ladewig

Steinhauser

Khandpur

Beckstead

Fisher

Shaw

Pritchett

Harrison

Ray

Fudickar

Whiteley

Scheer

Wayman

Rembold

Shankar

Stokes

Goldstein

McIlwain

Trostle

Grulke

Kulbacki

Hager

Duval

Johnson

Holt

Jahnke

Berthold

Fortkamp

Wylie Biggs

Williams

Fenzel

Medders

Madding

Blake

Bytheway

Cimino

Coles

Mayer

Bolduc

Hughes

Hoem

McElvain

Krueger

Basnet

Megerdichian

Jones

O'Connell

Meyer

Norton

Wood

Bushell

Sears

Wilson-Ferry

Molatore

Sepich-

Anderson

Makens

Craig

Toma

Curtis

Walz

Taplin

Potter

Amen

Hadden

Smith

James

Zivich

Booth

Ducharme