SWI-Prolog -- Manual

Documentation
- Reference manual
- Packages
  - Constraint Query Language A high level interface to SQL databases
    - library(cql/cql): CQL - Constraint Query Language
      - Examples
        
        Simple INSERT
        
        Simple INSERT with retrieval of identity of the inserted
        
        Simple DELETE
        
        Simple SELECT
        
        Simple UPDATE
        
        WHERE with arithmetic comparison
        
        Simple INNER JOIN
        
        Arithmetic UPDATE with an INNER JOIN and a WHERE restriction
        
        Confirm row does not exist
        
        Aggregation - Count
        
        Aggregation - Sum
        
        Aggregation - Average
        
        Maximum Value
        
        Minimum Value
        
        Aggregation requiring GROUP BY
        
        INNER JOIN with an aggregation sub-query where the sub-query is constrained by a shared variable from the main query
        
        INNER JOIN in an aggregation sub-query
        
        Negation
        
        EXISTS
        
        Left Outer Join
        
        List-based Restrictions
        
        Compile time in-list constraint
        
        Disjunction resulting in OR in WHERE clause
        
        Disjunction resulting in different joins (implemented as a SQL UNION)
        
        Disjunction resulting in different SELECT attributes (implemented as separate ODBC queries)
        
        ORDER BY
        
        DISTINCT
        
        SELECT with NOT NULL restriction
        
        First N
        
        Self JOIN
        
        Removing null comparisions
        
        Three table JOIN
        
        Three table JOIN with NOLOCK locking hint
        
        SELECT with LIKE
        
        Writing exceptions directly to the database
        
        TOP N is Parametric
        
        Using compile_time_goal/1
        
        ON
        
        Expressions In Where Restrictions
        
        Explicitly avoid the "No WHERE restriction" message
        
        HAVING
        
        INSERT and UPDATE value in-line formatting
        
        Negations in WHERE Clauses
        
        Predicate-generated Attribute Values
        
        INSERT from SELECT

1.7.4 Simple SELECT

{[],
 se_lt_x :: [a-A, b-B]}

This query will either:

If A is bound, and B are bound, fail if there are no such rows, or succeed (without binding anything) the same number of times as there are matching rows in se_lt_x.
If A is bound and B is unbound, bind B to each of the values in se_lt_x.b where se_lt_x.a = A
If B is bound and A is unbound, bind A to each of the values in se_lt_x.a where se_lt_x.b = B
If A and B are both unbound, bind A and B to each of the tuples in se_lt_x