ReadonlynameThe name of the store (e.g. 'mongodb', 'redis', 'dynamodb')
ReadonlylibraryThe client library being used
Returns the underlying GraphTraversalSource (g) for building traversals not wrapped below.
Access to the raw DriverRemoteConnection, e.g. to inspect isOpen directly.
Runs an arbitrary traversal built against g and Gremlin's anonymous
traversal statics (gremlin.process.statics, e.g. statics.V(id) for
nested traversals like .to(statics.V(id))), returning the fully
materialized, normalized result list. This is the escape hatch for any
Gremlin step this store doesn't wrap in a dedicated helper.
Submits a raw Gremlin script string via the driver's script-eval
Client (as opposed to the fluent bytecode traversal g used
elsewhere in this class), with bindings substituted server-side for
named parameters in the script (e.g. 'g.V(id)' with
{ id: '1' }) — the standard way to parameterize Gremlin script text
without string-concatenating untrusted values into it.
addV(label) + a property(key, value) step per entry in properties, returning the created vertex via elementMap().
g.V(id).elementMap().next() — returns undefined if no vertex with that ID exists.
g.V() filtered by options.label/options.has/options.limit, projected with elementMap().
Same filters as findVertices(), terminated with count() instead of materializing elements.
g.V(id) + a property(key, value) step per entry in properties (existing properties keep their value unless overwritten here), returning the updated vertex.
g.V(id).drop().iterate() — also drops any incident edges (Neptune cascades edge drops when their vertex is dropped). No-op (does not throw) if the vertex doesn't exist.
g.V(fromId).addE(label).to(statics.V(toId)) + a property(key, value)
step per entry in properties, returning the created edge via
elementMap(). Throws a NeptuneError if fromId/toId don't
resolve to existing vertices (same as real Gremlin addE/to).
g.E(id).elementMap().next() — returns undefined if no edge with that ID exists.
g.E() filtered by options.label/options.has/options.limit, projected with elementMap().
g.E(id).drop().iterate(). No-op (does not throw) if the edge doesn't exist.
g.V(id).out(edgeLabel) (or .in_()/.both() per options.direction,
default 'out'), projected with elementMap(). The common
"one-hop neighbors" query — for multi-hop traversals, path-finding, or
anything else Gremlin's step library covers beyond one hop, use
traversal() directly.
NeptuneStorewraps thegremlinpackage'sDriverRemoteConnection(fluent, bytecode-based traversals via aGraphTraversalSource, i.e.g) andClient(raw Gremlin script submission) to talk to Amazon Neptune, implementing the minimalNoSqlStoremarker interface. Vertex/ edge CRUD helpers below are convenience wrappers built on top of real Gremlin steps (addV/addE/has/hasLabel/drop/...) — for anything they don't cover, usegetClient()(the rawGraphTraversalSource),traversal()(build an arbitrary traversal againstg), orsubmit()(raw parameterized Gremlin script text).