Please enable JavaScript.

Coggle requires JavaScript to display documents.

Indexing and Association - Coggle Diagram

- - - - Types of access.
      - Access time.
      - Insert time.
      - erase time
      - Additional space required
- - - - dense indices
        
        An index record appears for each
        lookup key value in the file.
      - Sparse indices
        
        Only one index record is created
        for some of the values
      - Multilevel indices
        
        indices with two or more levels
      - Index update
        
        Insertion
        
        A lookup is first performed using the value of the registry lookup key a insert
        
        Erased
        
        The Index to be delete is searched
  - - - Dense
      - with one entry in the index for each value of the search key
      - A pointer to each record in the file.
- - - - multilevel index but with a different Structure
    - - To process a query, you have to traverse a path in the tree from the root to some leaf node.
    - - Are more complicated because can requiere
        
        Split a node if too large
        
        Fusion if too short
    - - the leaf nodes of
        tree store records, rather than store pointers to records
- - - - Distribución uniforme.
      - Distribución aleatoria.
    - - Association functions.
      - Drawer overflow management.
      - get the address of the disk block containing the
        desired record by directly calculating a function on the value of the registry search ke
- - - - Bitmap indexes.
        
        Efficient implementation of bitmap operations.
        
        Bitmaps and B+ trees.