File Organisation Amd Access Flashcards

1
Q

Serial file organisation

A
  • Records of data are physically stored in a file, one after another, in the order they were added to the file
  • Suitable for temporary files storing transactions.
  • Used for real time processing
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Sequential file organization

A
  • Records are stored one after another, in a given order
  • Appropriate for files with high hit rate
  • Order is usually based on the primary field of the records as this is a unique identifier
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Random file organization

A
  • Records are stored in a file in any available position.
  • Real time transaction processing
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Hashing algorithm

A

A mathematical formula used to perform calculations on the key field of the record, the result gives the address where record should be found.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Sequential file

A
  • If a particular record is being searched for, every record needs to be checked until the record is found or the key field of the current record being checked is greater than the key field of the record being searched for
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Serial file

A
  • If a particular record is being searched for, every record need to be checked until that record is found or the whole file has been searchers and that record has not been found
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Direct access

A
  • Jump to a specific record in the file without accessing other records
  • Required when only an individual record from a file need to be processed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly