Please enable JavaScript.

Coggle requires JavaScript to display documents.

Inquiry Processing - Coggle Diagram

- - - - disk accesses.
        
        are usually the
        most important cost
      - CPU time to execute a query.
      - The cost of communication
- - - - You can implement piping by building a single, complex operation that combines the operations that make up the piping.
- - - - A1(linear search)
      - A2(binary search)
    - - A3(primary index, equality based on key)
        
        A4 (primary index, equality based on a non-key attribute).
        
        A5(secondary index, equality)
    - - A6 (primary index, comparison).
      - A7 (secondary index, comparison)
    - - A8 (conjunctive selection using an index).
        
        A9 (conjunctive selection using a compound index).
        
        A10 (conjunctive selection by intersection of identifiers).
        
        A11 (disjunctive selection by union of identifiers).
- - - - recursive division
        
        Overflow Management
        
        Cost of a meeting per association
        
        Meeting by hybrid association
- - - - You can easily implement the using sort
    - - Can be easily implemented by performing the projection of each tuple,
    - - Can be implemented by first ordering both relations and then examining each relation to produce the result
    - - Can be implemented by
        
        Modify meeting algorithms.
        
        Compute the corresponding join, and then add more tuples to the join result until you get the outer join result.
    - - can be implemented from a similar way to removing duplicates.