Please enable JavaScript.

Coggle requires JavaScript to display documents.

SQL&DBM - Coggle Diagram

- - - - DISTINCT
    - - LIKE
      - IN
      - BETWEEN
      - AND
      - OR
      - NOT
      - ANY
      - ALL
      - EXISTS
      - =, <>, <, >, <=, >=
      - IS NULL
      - IS NOT NULL
    - - ORDER BY column ASC
      - ORDER BY column DESC
    - - HAVING
    - - INNER JOIN
      - FULL JOIN
      - RIGHT JOIN
      - LEFT JOIN
      - CROSS JOIN
      - OUTER JOIN
    - - MIN
      - MAX
      - COUNT
      - AVG
      - SUM
    - - column AS alias
- - - - Relational
      - Graph
      - Key-value
      - Document
      - In-memory
      - Ledger
      - Wide-column
      - Time-series
  - - - Object-based data model - is data model that use concepts such as entities, attributes, and relationships.
        
        Entity-Relationship
        
        Semantic
        
        Functional
        
        Object-Oriented
      - Physical data model - is a data model that describes the implementation details of how data is stored in a database. It specifies the storage structure, access methods, file organization, and indexing techniques.
      - Record-based data model - is a data model that organizes data into fixed-format records, with each record typically consisting of a set of fields or attributes.
        
        Relational data model - is a data model that organizes data into relations consisting of tuples and attributes, using keys to establish relationships between them.
        
        Relational keys - are one or more attributes that uniquely identifies each tuple in a
        relation.
        
        Superkey - is an attribute or set of attributes in a relational database that uniquely identifies a tuple within a relation, possibly containing additional attributes not necessary for uniqueness.
        
        Candidate key - is a minimal superkey, meaning it uniquely identifies each tuple in a relation and contains no unnecessary attributes.
        
        Primary key - is the candidate key that is selected to identify tuples uniquely within the
        relation.
        
        Foreign key - is an attribute, or set of attributes, within one relation that matches the candidate key of some (possibly the same) relation.
        
        Relation - is a table with columns and
        rows.
        
        Domain - is the set of allowable values for one or more attributes.
        
        Attribute - is a named column of a relation.
        
        Degree - is the number of attributes relation contains.
        
        Tuple - is a row of a relation.
        
        Cardinality - is the number of tuples relation contains.
        
        Constraint - is a rule or restriction applied to ensure data integrity, consistency, and validity across all instances of the database.
        
        Domain constraints - are restrictions on the set of values allowed for the attributes of relations.
        
        Entity integrity - is a constraint ensuring that each table has a unique primary key, and no part of the primary key can be null.
        
        Referential integrity - is an integrity constraint that ensures foreign key values in a database match primary key values in the referenced table, maintaining consistent and valid relationships between tables.
        
        Network
        
        Hierachical
  - - - Data storage, retrieval, and update - ability to store, retrieve, and update data in the database.
      - A user-accessible catalog - catalog in which descriptions of data items are stored and which is
        accessible to users. The “data about the data” or the metadata (dictionary, information_schema -> data catalog).
      - Transaction support - mechanism that will ensure either that all the updates corresponding to a
        given transaction are made or that none of them is made.
      - Concurrency control services - mechanism to ensure that the database is updated correctly when
        multiple users are updating the database concurrently
      - Recovery services - mechanism for recovering the database in the event that the database is
        damaged in any way.
      - Authorization services - mechanism to ensure that only authorized users can access the database
      - Support for data communication - integration of communication software.
      - Integrity services - means to ensure that both the data in the database and changes to the data
        follow certain rules.
      - Services to promote data indepeence - supportion of the independence of programs from the actual structure
        of the database.
      - Utility services
- - - - Inner
        
        Theta. The Theta Join operation defines a relation that contains tuples satisfying the predicate F from the Cartisian Product of R and S.
        
        Natural. The Natural join is an Equijoin of the two relations R and S over all common attributes
        x. It eliminates duplicate columns in the result, keeping only one column for the shared attributes.
        
        Equi. The Equi Join operation defines a relation that contains tuples satisfying equality predicate from th Cartisian Product of R and S.
      - Outer
        
        Full. The Full Join operation combines the results of the Left Outer Join and Right Outer Join.
        
        Right. The Right Outer Join is a join in which tuples fromS that do not have matching values
        in the common attributes of R are also included in the result relation.
        
        Left. The Left Outer Join is a join in which tuples from R that do not have matching values
        in the common attributes of S are also included in the result relation.
        
        Semi. The Semi Join operation defines a relation that contains the tuples of R participate in the Theta Join of R and S satisfying the predicate.