Please enable JavaScript.

Coggle requires JavaScript to display documents.

Indexing and Hashing - Coggle Diagram

- - - - The pointer to a record consists of the identifier of a disk block
    - - An index entry appears for only some of the search-key values
      - Use only if the relation is stored in sorter order.
    - - An index entry appears for every search-key value
      - Too the index record contains the search-key value and a pointer to the first data record only.
- - - - Nonleaf nodes also referred to internal nodes
- - - - Space efficiency