Skip to content

gsql2rsql

Query your Delta Tables as a Graph

No need for a separate graph database. Write intuitive OpenCypher queries, get Databricks SQL automatically.

Why Databricks?

Databricks provides tables designed for massive scale, enabling efficient storage and querying of tens of billions of triples with features like time travel No ETL or migration needed—just query your data lake as a graph. Recently, Databricks released support for recursive queries, unlocking the use of SQL warehouses for graph-type queries.


Why gsql2rsql?

Challenge Solution
Graph queries require complex SQL with WITH RECURSIVE Write 5 lines of Cypher instead
Need to maintain a separate graph database Query Delta Lake directly
LLM-generated complex SQL is hard to audit Human-readable Cypher + deterministic transpilation (optionally pass to LLM for final optimization)
Scaling to tens of billions of triples is costly in graph DBs Delta Lake stores billions of triples efficiently, with Spark scalability

See It in Action

Bash
pip install gsql2rsql
Python
from gsql2rsql import GraphContext

# Point to your existing Delta tables - no migration needed
graph = GraphContext(
    nodes_table="catalog.fraud.nodes",
    edges_table="catalog.fraud.edges",
)

# Write graph queries with familiar Cypher syntax
sql = graph.transpile("""
    MATCH path = (origin:Person {id: 12345})-[:TRANSACTION*1..4]->(dest:Person)
    WHERE dest.risk_score > 0.8
    RETURN dest.id, dest.name, dest.risk_score, length(path) AS depth
    ORDER BY depth, dest.risk_score DESC
    LIMIT 3
""")

print(sql)

5 lines of Cypher → optimized Databricks SQL with recursive CTEs

Click to see the generated SQL (auto-generated from transpiler)
SQL
WITH RECURSIVE
  paths_1 AS (
    -- Base case: direct edges (depth = 1)
    SELECT
      e.src AS start_node,
      e.dst AS end_node,
      1 AS depth,
      ARRAY(e.src, e.dst) AS path,
      ARRAY(NAMED_STRUCT('src', e.src, 'dst', e.dst, 'relationship_type', e.relationship_type, 'amount', e.amount, 'timestamp', e.timestamp)) AS path_edges,
      ARRAY(e.src) AS visited
    FROM catalog.fraud.edges e
    JOIN catalog.fraud.nodes src ON src.id = e.src
    WHERE (relationship_type = 'TRANSACTION') AND (src.id) = (12345)

    UNION ALL

    -- Recursive case: extend paths
    SELECT
      p.start_node,
      e.dst AS end_node,
      p.depth + 1 AS depth,
      CONCAT(p.path, ARRAY(e.dst)) AS path,
      ARRAY_APPEND(p.path_edges, NAMED_STRUCT('src', e.src, 'dst', e.dst, 'relationship_type', e.relationship_type, 'amount', e.amount, 'timestamp', e.timestamp)) AS path_edges,
      CONCAT(p.visited, ARRAY(e.src)) AS visited
    FROM paths_1 p
    JOIN catalog.fraud.edges e
      ON p.end_node = e.src
    WHERE p.depth < 4
      AND NOT ARRAY_CONTAINS(p.visited, e.dst)
      AND (relationship_type = 'TRANSACTION')
  )
SELECT 
   _gsql2rsql_dest_id AS id
  ,_gsql2rsql_dest_name AS name
  ,_gsql2rsql_dest_risk_score AS risk_score
  ,(SIZE(_gsql2rsql_path_id) - 1) AS depth
FROM (
  SELECT
     sink.id AS _gsql2rsql_dest_id
    ,sink.type AS _gsql2rsql_dest_type
    ,sink.name AS _gsql2rsql_dest_name
    ,sink.risk_score AS _gsql2rsql_dest_risk_score
    ,source.id AS _gsql2rsql_origin_id
    ,source.type AS _gsql2rsql_origin_type
    ,source.name AS _gsql2rsql_origin_name
    ,source.risk_score AS _gsql2rsql_origin_risk_score
    ,p.start_node
    ,p.end_node
    ,p.depth
    ,p.path AS _gsql2rsql_path_id
    ,p.path_edges AS _gsql2rsql_path_edges
  FROM paths_1 p
  JOIN catalog.fraud.nodes sink
    ON sink.id = p.end_node
  JOIN catalog.fraud.nodes source
    ON source.id = p.start_node
  WHERE p.depth >= 1 AND p.depth <= 4 AND sink.type = 'Person' AND source.type = 'Person' AND (sink.risk_score) > (0.8)
) AS _proj
ORDER BY depth ASC, risk_score DESC
LIMIT 3

Early Stage Project — Not for OLTP or end-user queries

This project is in early development. APIs may change, features may be incomplete, and bugs are expected. Contributions and feedback are welcome!

This transpiler is for internal analytics and exploration (data science, engineering, analysis). It obviously makes no sense for OLTP! If you plan to expose transpiled queries to end users, be careful: implement validation, rate limiting, and security. Use common sense.

Real-World Examples

Cypher
-- Find fraud rings: accounts connected through suspicious transactions
MATCH (a:Account)-[:TRANSFER*2..4]->(b:Account)
WHERE a.flagged = true AND b.flagged = true
RETURN DISTINCT a.id, b.id, length(path) AS hops

See more fraud detection queries →

Cypher
-- Analyze credit exposure through guarantor chains
MATCH path = (borrower:Customer)-[:GUARANTEES*1..3]->(guarantor:Customer)
WHERE borrower.credit_score < 600
RETURN borrower.id, COLLECT(guarantor.id) AS chain

See more credit analysis queries →

Cypher
-- Friends of friends who work at tech companies
MATCH (me:Person {id: 123})-[:KNOWS*1..2]->(friend)-[:WORKS_AT]->(c:Company)
WHERE c.industry = 'Technology'
RETURN DISTINCT friend.name, c.name

See all feature examples →


That's it! No schema boilerplate, no complex setup.

Full User Guide →


Low-Level API (Without GraphContext)

For advanced use cases or non-Triple-Store schemas, use the components directly:

Python
from gsql2rsql import OpenCypherParser, LogicalPlan, SQLRenderer
from gsql2rsql.common.schema import NodeSchema, EdgeSchema, EntityProperty
from gsql2rsql.renderer.schema_provider import SimpleSQLSchemaProvider, SQLTableDescriptor

# 1. Define schema (SimpleSQLSchemaProvider)
schema = SimpleSQLSchemaProvider()

person = NodeSchema(
    name="Person",
    node_id_property=EntityProperty("id", int),
    properties=[EntityProperty("name", str)],
)
schema.add_node(
    person,
    SQLTableDescriptor(table_name="people", node_id_columns=["id"]),
)

knows = EdgeSchema(
    name="KNOWS",
    source_node_id="Person",
    sink_node_id="Person",
)
schema.add_edge(
    knows,
    SQLTableDescriptor(table_name="friendships"),
)

# 2. Transpile
parser = OpenCypherParser()
ast = parser.parse("MATCH (p:Person)-[:KNOWS]->(f:Person) RETURN p.name, f.name")
plan = LogicalPlan.process_query_tree(ast, schema)
plan.resolve(original_query="...")

renderer = SQLRenderer(db_schema_provider=schema)
sql = renderer.render_plan(plan)

Key Features

Feature Description
Variable-length paths [:REL*1..5] via WITH RECURSIVE
Cycle detection Automatic ARRAY_CONTAINS checks
Path functions length(path), nodes(path), relationships(path)
No-label nodes (a)-[:REL]->(b:Label) matches any node type for a
Inline filters (n:Person {id: 123}) pushes predicates to source
Undirected edges (a)-[:KNOWS]-(b) via optimized UNION ALL
Aggregations COUNT, SUM, AVG, COLLECT, etc.
Type safety Schema validation before SQL generation

Architecture

gsql2rsql uses a 4-phase pipeline for correctness:

Text Only
OpenCypher → Parser → Planner → Resolver → Renderer → SQL
  1. Parser: Cypher → AST (syntax only, no schema)
  2. Planner: AST → Logical operators (semantics)
  3. Resolver: Validate columns & types against schema
  4. Renderer: Operators → Databricks SQL

This separation ensures each phase has clear responsibilities and can be tested independently.


Documentation

Section Description
User Guide Getting started, GraphContext, schema setup
Examples queries with generated SQL

Project Status

Research Project

Contributions welcome!


License

MIT License - see LICENSE


Inspiration and Design Differences

gsql2rsql was inspired by the Microsoft openCypherTranspiler, a C# project for transpiling OpenCypher to T-SQL (now discontinued). While the core idea is similar—translating Cypher graph queries to SQL—gsql2rsql introduces several key architectural differences:

  • Stricter Phase Separation: gsql2rsql enforces a much stronger separation between the phases of the transpiler pipeline (Parser, Planner, Resolver, Renderer). Each phase has a single responsibility, and the renderer is intentionally kept as "dumb" as possible, only emitting SQL from fully-resolved logical plans. This separation makes the codebase easier to maintain, test, and extend.

  • Human-Friendly Debugging: The architecture is designed for transparency and developer experience. For example, error messages during development are rich and actionable, showing available variables, suggestions, and hints. See the example below:

    Text Only
    Makefile:55: warning: ignoring old recipe for target 'test-pyspark-quick'
    Testing recursive query transpilation...
    ╔══════════════════════════════════════════════════════════════════════════════╗
    ║ ColumnResolutionError: Variable 'rels' is not defined                        ║
    ╚══════════════════════════════════════════════════════════════════════════════╝
    
    ━━━ Query ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
    
        1 │ MATCH path = (root:Vertex)-[rels:REL*1..5]-(n:Vertex) WHERE root.node_id = '1234_algo' AND n.node_type = 'node_type' AND NONE(r IN rels WHERE r.relationship_type IN ['a', 'b']) RETURN rels AS edges, n AS vertex_info
          │                             ▲
          │                             └── ERROR: Variable 'rels' is not defined
        2 │
    
    ━━━ Available Variables (Scope Level 0) ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
    
      Name         Type      Data Type   Defined At              Properties
      ───────────────────────────────────────────────────────────────────────────
      root         entity   Vertex       MATCH (root:Vertex)      node_type, metadata, node_id
      path         path     PATH         MATCH path = ...         -
      n            entity   Vertex       MATCH (n:Vertex)         node_type, metadata, node_id
      edges        value    unknown      RETURN/WITH AS edges     -
      vertex_info  value    Vertex       RETURN/WITH AS vertex_info -
    
    ━━━ Suggestions ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
    
      • Did you mean 'root'? (3 characters difference)
    
    ━━━ Hints ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
    
      💡 Make sure 'rels' is defined in a MATCH clause before use.
         Variables must be defined before they can be referenced in WHERE, WITH, or RETURN clauses.
    
    ━━━ Debug Information ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
    
      Operator:         ProjectionOperator (id=6)
      Resolution Phase: expression_resolution
      Symbol Table:
        Symbol Table Dump:
          Scope 0 (global):
            root: entity(Vertex) @ scope 0
            path: path(PATH) @ scope 0
            n: entity(Vertex) @ scope 0
            edges: value(unknown) @ scope 0
            vertex_info: value(Vertex) @ scope 0