File Organization

Question 1

Indexed Sequential file Access

Answer 1

Ordered data within an index

Question 2

Sequential Access

Answer 2

One record after another

Question 3

Hashing algorithms

Answer 3

Direct computation of storage location

Question 4

Direct/Random Access

Answer 4

Efficient data retrieval using hash function

Question 5

How to compare hashing algorithms

Answer 5

Compare the number of collisions that occur when given an example data set

Question 6

How is The overall efficiency of a hashing algorithm determined

Answer 6

It’s determined by the number of records placed in the same block

Question 7

How do indexed sequential files work

Answer 7

They contain an index that groups the data into logical chunks. So when searching for a file you first only have to search for the chunk.

Question 8

How does indexing files make the addition of files more complicated

Answer 8

Each time a record is added to a group then the start position of all subsequent chunks will be different, this means that all subsequent points will need to be updated

Question 9

How would you make indexed files more efficient if it takes a long time to search through the index

Answer 9

Add another layer of indexing

Question 10

What is the ultimate goal of multi-level index sequences

Answer 10

To limit the number of times a file is accessed