Search Shortcut cmd + k | ctrl + k

- Overview
- Documentation
- Development
- Download Metrics
- FAQ
- Core Extensions
- List of Community Extensions

- faiss
- pivot_table
- duckpgq
- sheetreader
- evalexpr_rhai

duckpgq
Downloads 2345this week

Extension that adds support for SQL/PGQ and graph algorithms

Extension repository on GitHub
Extension descriptor (YAML)

### Installing and Loading

    INSTALL duckpgq FROM community;
    LOAD duckpgq;

### Example

    CREATE TABLE Person AS SELECT * FROM 'https://gist.githubusercontent.com/Dtenwolde/2b02aebbed3c9638a06fda8ee0088a36/raw/8c4dc551f7344b12eaff2d1438c9da08649d00ec/person-sf0.003.csv';
    CREATE TABLE Person_knows_person AS SELECT * FROM 'https://gist.githubusercontent.com/Dtenwolde/81c32c9002d4059c2c3073dbca155275/raw/8b440e810a48dcaa08c07086e493ec0e2ec6b3cb/person_knows_person-sf0.003.csv';

    CREATE PROPERTY GRAPH snb
      VERTEX TABLES (
        Person
      )
      EDGE TABLES (
        Person_knows_person SOURCE KEY (Person1Id) REFERENCES Person (id)
                            DESTINATION KEY (Person2Id) REFERENCES Person (id)
        LABEL knows
      );

    FROM GRAPH_TABLE (snb
      MATCH (a:Person)-[k:knows]->(b:Person)
      COLUMNS (a.id, b.id)
    )
    LIMIT 1;

    FROM GRAPH_TABLE (snb
      MATCH p = ANY SHORTEST (a:person)-[k:knows]->{1,3}(b:Person)
      COLUMNS (a.id, b.id, path_length(p))
    )
    LIMIT 1;

    FROM local_clustering_coefficient(snb, person, knows);

    DROP PROPERTY GRAPH snb;

### About duckpgq

The DuckPGQ extension supports the SQL/PGQ syntax as part of the official SQL:2023 standard developed by ISO.

It introduces visual graph pattern matching and a more concise syntax for path-finding. For more information, please see the DuckPGQ documentation.

Disclaimer: As this extension is part of an ongoing research project by the Database Architectures group at CWI, some features may still be under development. We appreciate your understanding and patience as we continue to improve it.

### Added Functions

function_name | function_type | description | comment | example
--- | --- | --- | --- | ---
cheapest_path_length | scalar |  |  |
create_csr_edge | scalar |  |  |
create_csr_vertex | scalar |  |  |
create_property_graph | table |  |  |
csr_get_w_type | scalar |  |  |
delete_csr | scalar |  |  |
describe_property_graph | table |  |  |
drop_property_graph | table |  |  |
duckpgq_match | table |  |  |
get_csr_e | table |  |  |
get_csr_ptr | table |  |  |
get_csr_v | table |  |  |
get_csr_w | table |  |  |
get_pg_ecolnames | table |  |  |
get_pg_etablenames | table |  |  |
get_pg_vcolnames | table |  |  |
get_pg_vtablenames | table |  |  |
iterativelength | scalar |  |  |
iterativelength2 | scalar |  |  |
iterativelengthbidirectional | scalar |  |  |
local_clustering_coefficient | scalar |  |  |
local_clustering_coefficient | table |  |  |
pagerank | scalar |  |  |
pagerank | table |  |  |
reachability | scalar |  |  |
shortestpath | scalar |  |  |
show_property_graphs | pragma |  |  |
weakly_connected_component | scalar |  |  |
weakly_connected_component | table |  |  |