Supported Cypher
NamiDB implements a large, strict subset of openCypher 9 and GQL (ISO/IEC 39075:2024), with Neo4j 5 spellings accepted where they exist. “Strict” means that anything the parser accepts either runs with standard semantics or fails with a typed error; it never runs with silently different meaning.
Everything in the tables below was checked against engine 3.2.0; 3.2.1 and 3.3.0 do not change the Cypher surface. The same surface is served by the Python client, the HTTP API, Bolt and the CLI.
Clauses
| Clause | Supported | Notes |
|---|---|---|
MATCH, OPTIONAL MATCH | yes | Comma-separated pattern parts; several MATCH clauses in a row. An OPTIONAL MATCH matches its whole pattern or yields NULLs. |
WHERE | yes | On MATCH, OPTIONAL MATCH and WITH. |
RETURN, RETURN DISTINCT, RETURN * | yes | Columns come back in RETURN order. |
WITH, WITH DISTINCT, WITH * | yes | With WHERE, ORDER BY, SKIP, LIMIT. |
ORDER BY … ASC / DESC | yes | Any expression; ASCENDING / DESCENDING accepted. NULLS FIRST/LAST is not. |
SKIP, LIMIT | yes | A non-negative integer literal or a $parameter; not an arbitrary expression. |
UNWIND | yes | UNWIND null and UNWIND [] produce no rows. |
UNION, UNION ALL | yes | Every branch must return the same column names in the same order. |
CREATE | yes | Nodes, relationships, chains, several parts; property maps from literals, expressions or a $map. |
MERGE | yes | Node or relationship pattern, ON CREATE SET, ON MATCH SET. |
SET | yes | n.p = v, n = {…} (replace), n += {…} (merge), n:Label[:Label2], several items. |
REMOVE | yes | Properties and labels, several items. |
DELETE, DETACH DELETE | yes | Nodes and relationships. DELETE of a node that still has relationships fails (HTTP 409). |
FOREACH (x IN list | …) | yes | Body may contain CREATE, MERGE, SET, REMOVE, DELETE, or a nested FOREACH. |
CALL { … } | yes | Uncorrelated, and correlated with an importing WITH a, b. Write subqueries allowed. UNION inside an uncorrelated subquery. |
CALL proc(…) YIELD … | yes | Built-in db.*, search.* and algo.* procedures only. The CALL must be the first clause of the query. Filter yields with a following WITH … WHERE. |
EXPLAIN [RAW] [VERBOSE] | yes | Returns the plan instead of running the query (HTTP, Bolt, CLI, Python). |
SHOW CONSTRAINTS, SHOW INDEXES | yes | Bare form only (no YIELD, BRIEF, VERBOSE). |
CREATE CONSTRAINT, CREATE INDEX, CREATE VECTOR INDEX, CREATE FULLTEXT INDEX, DROP INDEX, DROP VECTOR INDEX | yes | Must be the only statement in the request. See Schema. |
PROFILE | no | Use EXPLAIN VERBOSE. |
LOAD CSV | no | Bulk-load through Python (put_nodes, load_parquet_*) or UNWIND $rows. |
USE <graph> | no | Choose the namespace with the connection instead (URI, HTTP path / header, Bolt database). |
CALL { … } IN TRANSACTIONS | no | |
DROP CONSTRAINT | no | |
BEGIN / COMMIT in Cypher | no | Each statement auto-commits. Bolt drivers can run explicit transactions. |
Patterns
| Element | Supported | Notes |
|---|---|---|
(n), (n:Label), (:A:B), (n {k: v}) | yes | Multiple labels mean “all of them”. Inline property maps take literals or parameters. |
Label disjunction (n:A|B) | yes | A few OPTIONAL MATCH shapes reject it with an explicit “not supported yet” error. |
WHERE n:Label, WHERE NOT n:Label | yes | Label predicates in expressions. |
(n:A&B), (n:!A), (n:%) | no | GQL label expressions. Use :A:B or WHERE. |
-[r:T]->, <-[r:T]-, -[r:T]-, -->, <--, -- | yes | |
Type alternation -[r:A|B]-> | yes | |
Inline relationship properties -[r:T {k: v}]-> | yes | Also on variable-length hops (applies to every hop). |
Variable length *, *n, *n..m, *..m, *n.., *0..m | yes | Bounds may be $parameters (*1..$hops). Open-ended * is allowed. A relationship variable on a variable-length hop binds the list of relationships. |
Path variable p = (a)-[…]->(b) | yes | In MATCH, including variable-length. Not in CREATE or MERGE. |
shortestPath(…), allShortestPaths(…) | yes | MATCH p = shortestPath((a)-[:T*..15]-(b)): path variable required, one relationship hop with a finite upper bound, both endpoints bound by an earlier MATCH. |
{_id: $x} lookup | yes | Needs a label: MATCH (n:Person {_id: $x}). |
$map spread in a MATCH pattern | no | List the keys explicitly, e.g. in WHERE. |
Quantified path patterns ((a)-[]->(b)){1,3} | no | Use variable-length relationships. |
A MATCH never binds the same relationship twice within one pattern.
Expressions
| Category | Supported |
|---|---|
| Literals | integers, floats (1.5, .5, 1e3), strings in '…' or "…" with \ escapes (\', \", \n, \uXXXX), true / false / null, lists, maps |
| Parameters | $name anywhere a value is allowed |
| Property access | n.prop, map.key, n._id (the node id) |
| Arithmetic | + - * / % ^; integer / truncates; ^ returns a float |
| String concat | 'a' + 1 → 'a1'; 'a' + {…} / lists / nodes is a type error |
| List ops | + concat, [i], negative index, slices [a..b], [..b], [a..], IN |
| Comparison | = <> < > <= >=; 1 = 1.0 is true; comparing incompatible types yields NULL |
| Boolean | AND OR XOR NOT with three-valued logic |
| Null tests | IS NULL, IS NOT NULL |
| String predicates | STARTS WITH, ENDS WITH, CONTAINS, =~ (full-match regex, (?i) for case-insensitive) |
CASE | simple (CASE x WHEN …) and searched (CASE WHEN …) |
| List comprehension | [x IN list WHERE pred | expr] |
| Quantifiers | any(…), all(…), none(…), single(…) |
| Fold | reduce(acc = init, x IN list | expr) |
| Pattern comprehension | [(a)-[:T]->(b) | b.name], as a top-level projection item |
| Existential | EXISTS { MATCH … [WHERE …] }, EXISTS { (a)-->() }, exists((a)-->()), bare pattern predicate WHERE (a)-[:T]->() |
| Not supported | map projection n {.a, .b}, COUNT { … } / COLLECT { … } subqueries, size((a)-->()), exists(n.prop) (use IS NOT NULL), type predicates x IS :: INTEGER, hexadecimal literals, '' quote doubling (use \') |
The full function list is in Operators and functions.
Types
| Type | Notes |
|---|---|
INTEGER | 64-bit signed. Arithmetic overflow wraps around; keep values well inside the range. |
FLOAT | 64-bit IEEE 754. |
STRING, BOOLEAN, NULL | |
LIST | Heterogeneous. A list of floats stored on a property covered by a vector index becomes a VECTOR. |
MAP | String keys. |
BYTES | From Python bytes parameters; base64 in JSON. |
VECTOR | Dense f32 vector (vector([…]), or a float list under a vector index). size(v) is its dimension. |
DATE | date(), date('YYYY-MM-DD'). Comparable; component access (d.year) returns NULL. |
DATETIME | UTC, microsecond precision. datetime(), datetime('…ISO-8601…') (offsets are converted to UTC); localdatetime(…) is treated as UTC. |
NODE, RELATIONSHIP, PATH | |
| Not supported | DURATION, TIME, LOCALTIME, zoned date-times, POINT |
NULL semantics are three-valued: null = null is null,
null AND false is false, null OR true is true, and WHERE drops rows
whose predicate is null. Aggregates skip nulls (count(n.missing) is
0, avg of no values is null).
Procedures
CALL runs only built-in procedures; unknown namespaces such as apoc.* or
dbms.* fail with a list of what is available.
| Procedure | Purpose | Page |
|---|---|---|
db.labels(), db.relationshipTypes(), db.propertyKeys(), db.schema.visualization() | Schema introspection | Schema |
search.vector, db.index.vector.queryNodes, search.bm25, search.hybrid | Vector, full-text and hybrid retrieval | Search |
algo.wcc, algo.scc, algo.pagerank, algo.degree, algo.triangle_count, algo.label_propagation, algo.louvain, algo.betweenness, algo.shortest_path, algo.fastRP | Graph algorithms | Algorithms |
Transactions and visibility
- Every statement is its own transaction: it commits entirely or not at all.
- A statement sees its own earlier clauses:
CREATE (a:T) WITH a MATCH (b:T) RETURN count(b)counts the new node. - Every statement sees all writes acknowledged before it started.
- Bolt drivers can group several statements in an explicit transaction
(
session.execute_write(…)); see Bolt.
Errors
An unsupported construct fails before anything runs, with a typed error:
parse_error for syntax the parser does not accept, unsupported or
plan_error for constructs it parses but cannot run. Over HTTP these are
400 responses; see the error taxonomy.