How many block accesses average saved on using secondryindex, Database Management System

Assignment Help:

An un- ordered student file has 20,000 records stored on a disk having the Block size as 1 K. Suppose that each student record is of 100 bytes, the secondary index field is of 8 bytes, and block pointer is also of 8 bytes, find how many block accesses on average may be saved on using secondary index on enrolment number.

Answer:

Number of accesses without using Secondary Index:

Number of records in the file = 20000

Block size = 1024 bytes

Record size = 100 bytes

Number of records per block = integer value of [1024 / 100] = 10

Number of disk blocks acquired by the file = [Number of records / records per block]

= [20000/10] = 2000

 

As the file is un-ordered any search on an average will require about half of the above blocks to be accessed. Thus, average number of block accesses = 1000

Number of accesses with Secondary Index:

Size of an index entry = 8+8 = 16 bytes

Number of index entries that can be stored per block

= integer value of [1024 / 16] = 64

Number of index entries = number of records = 20000

Number of index blocks = ceiling of [20000/ 64] = 320

Number of index block transfers to find the value in index blocks = ceiling of [log2320] = 9

One block move will be needed to get the data records using the index pointer after the needed index value has been located. So total number of block transmits with secondary index = 9 + 1 = 10

Therefore,, the Secondary index would save about 1990 block transmit for the given case. This is a huge saving compared to primary index. Please also compare the size of secondary index to primary index.

Let us now see an illustration of a secondary index that is on an attribute that is not an alternate key.

 

 

 

 

                                269_how many block accesses average saved on using Secondryindex.png


Related Discussions:- How many block accesses average saved on using secondryindex

Process-oriented decompositions, Process-oriented decompositions Pr...

Process-oriented decompositions Process-oriented decompositions divide complex process, task or function into simpler sub processes until they get simple enough to be deal

OLAP CUBES, 1) Define a job scheduling strategy that will meet business req...

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

What are the responsibility of file manager, What are the responsibility of...

What are the responsibility of File manager? File Manager : Manager allocation of space on disk storage and the data structures used to represent within stored on disk. It is a

What is a select operation, What is a SELECT operation? The select oper...

What is a SELECT operation? The select operation selects tuples that please a given predicate. We use the lowercase letter σ to denote selection.

Why do you go for sorting your query results, Why do you go for sorting you...

Why do you go for sorting your query results? SQL SELECT command to fetch data from MySQL table. Whenever you select rows, the MySQL server is free to return them in any order

Organize the clients from email marketing, Function requirement as given: ...

Function requirement as given: 1> manage fans and likes and followings those information from facebook. twitter. google+ and linkedin etc 2> Organize the clients from email m

How is oracle used in pl/sql, How is Oracle used in PL/SQL? Define the feat...

How is Oracle used in PL/SQL? Define the features of process and how they are defined? PL/SQL - PL/SQL is Oracle's procedural language (PL) superset of the Structured

Explain thomas write rule, Explain Thomas' Write rule.  Show how it is diff...

Explain Thomas' Write rule.  Show how it is different from timestamp ordering protol Ans: In timestamp-based concurrency control the thomas Write rule is a rule. Given a Timest

Dirty reads-problems of concurrent transactions, Dirty Reads: T10 reads a ...

Dirty Reads: T10 reads a value which is updated by T9. This update has not been committed and T9 aborts. T9 T10 Value of x old value = 200

A table joined with itself is called, A table joined with itself is called ...

A table joined with itself is called ? A table joined with itself is known as self join table. Normal 0 false false false EN-IN X-NONE X-NONE

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd