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

Explain the relational completeness, Explain the Relational Completeness ...

Explain the Relational Completeness Codd described the term relational completeness to consider to a language that is complete with respect to first-order predicate calculus ex

Define the concept of object diagram, Define the concept of Object Diagram ...

Define the concept of Object Diagram An object diagram shows a set of the objects and their relationships with each other at a point of time. In a static view, object diagram

The natural join is equal to which product, The natural join is equal to wh...

The natural join is equal to which product? The natural join is equal to Combination of projection and Cartesian product

Project, I need help in doing my dbms project

I need help in doing my dbms project

Unrepeatable reads-problems of concurrent transactions, Unrepeatable reads ...

Unrepeatable reads : Assume T7 reads X twice during its implementation. If it did not update X itself it could be very disturbing to see a dissimilar value of X in its next read. B

What is sql?, What Is Sql?  Structured Query Language (SQL) is a standa...

What Is Sql?  Structured Query Language (SQL) is a standard query language. It is usually used with all relational databases for data manipulation and definition. All the re

What is the full form of ddl, What is the full form of DDL? DDL is stan...

What is the full form of DDL? DDL is stand for Data Definition Language.

What is database files , The database files accept the actual data and ...

The database files accept the actual data and are typically the biggest in size. Depending on their shape, the tables for all the user operation can go in one database file-but

Explain the fundamental concepts of object-orientation, Explain the Fundame...

Explain the Fundamental concepts of object-orientation Software developers, data base administrators (DBAs) need to be familiar with fundamental concepts of object-orientation.

Distributed database management system, Question (a) Differentiate betw...

Question (a) Differentiate between the following terms: (i) Distributed Database v/s Distributed Database management System (ii) Homogeneous Distributed Database v/s Hete

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