Please enable JavaScript.

Coggle requires JavaScript to display documents.

DBMS File Organisation (Types (Hash (Hash function is used to calculate…

- - - - Records in a file are physically ordered based on the value of the ordering fields(s)
      - Binary search is used to search the file system
      - More efficient than a linear search
    - - problematic as order needs to be maintained
      - Possibility of cascading effect if there is not sufficient space in the required page
      - Overflow or transaction file can be used, periodically merged with the main file. Efficient for insertions, inefficient for retrievals
  - - - no particular order so linear search is required to access a record
      - very inefficient
    - - new records are inserted in the last page of the file - very efficient
      - records are stored in in the order in which they are inserted
    - - physical deletion leave unused space in the block
      - available disk space and performance will progressively deteriorate as deletions occur