com.datastax.bdp.graph.spark.graphframe
DseGraphFrame
Related Docs:
object DseGraphFrame
| package graphframe
com.datastax.bdp.graph.spark.graphframe
clean edges properties
clean edges properties
delete only selected properties not entire row
delete graph edges.
delete graph edges. 4 id columns should be passed to the method
+--------------------+--------------------+-------+--------------------+ | src| dst| ~label| id| +--------------------+--------------------+-------+--------------------+ |god:THxdAAAAAAAAAAAA|titan:J474AAAAAAA...| father|da0a9900-8fe1-11e...| +--------------------+--------------------+-------+--------------------+
data frame with edge ids: src,dst,~label, id
cache df before processing, true by default for consistence updates. two C* entries need to be deleted for one edge, so no reloads expected between this two calls.
clean vertex properties with meta properties
clean vertex properties with meta properties
property names to delete
delete all vertices with given label
delete vertices and all related edges
Utility method to generate GraphFrame compatible ids, if a mixed set of labels is in the DF.
Utility method to generate GraphFrame compatible ids, if a mixed set of labels is in the DF. It is slower than idColumn(label: String, idColumns: Column*): Column The id is added automatically when vertex is inserted, if inserted columns has the same names as in graph schema It is not possible for edges as you need to point both src and dst ids. Usage:
val updateEdgeDF = sourceDF.select( gf.idColumn(col("srcLabel"), col("srcId")) as "src", gf.idColumn(col("dstLabel"), col("dstId")) as "dst", col("label") as "~label", gf.randomEdgeIdColumn, col("property")) gf.updateEdges(updateEdgeDF)
If different labels have different id format use case statement to sort them:
when(col("srcLabel") === "1format", col("src1Id")).when(col("srcLabel") === "2format", col("src2Id")).otherwise(col("src3Id")) as "src"
Utility method to generate GraphFrame compatible ids.
Utility method to generate GraphFrame compatible ids. The id is added automatically when vertex is inserted, if inserted columns has the same names as in graph schema It is not possible for edges as you need to point both src and dst ids. Usage:
val updateEdgeDF = sourceDF.select( gf.idColumn("srcLabel", col("srcId")) as "src", gf.idColumn("dstLabel", col("dstId")) as "dst", col("label") as "~label", gf.randomEdgeIdColumn, col("property")) gf.updateEdges(updateEdgeDF)
Edge label
Source vertex id
Destination vertex id
Edge ids
Associated DataFrame schema
External ID object
String of vertex ID
External ID object
update or insert edges.
update or insert edges. this method accept natural vertex id columns. Id representation is implementation depended. Classic graph out vertex id column names should start with "out_" prefix and in names with "in_". Core graph uses DSE-DB edge table schema. the minimal df schema is: 2 id and 0 or more properties columns
+-----+------+-------------------+
|out_id|in_id| prop|
+-----+------+-------------------+
| 10| a| value|
+-----+------+-------------------+outVertexLabel->edgeLabel->inVertexLabel the df is not cached by the function. the dataframe should be persisted by the user if dynamic data source is used.
data frame with edge ids and update columns
update this graph edges.
update this graph edges. the minimal df schema is: 4 id columns and at least one property to update
+--------------------+--------------------+-------+--------------------+-------------------+ | src| dst| ~label| id| prop| +--------------------+--------------------+-------+--------------------+-------------------+ |god:THxdAAAAAAAAAAAA|titan:J474AAAAAAA...| father|da0a9900-8fe1-11e...| value| +--------------------+--------------------+-------+--------------------+-------------------+
if ID column is not present it will be generated and edges will be saved as new.
data frame with edge ids and update columns
cache df before processing, true by default for consistence updates. two C* entries need to be updated for one edge, so no reloads expected between this two calls.
update this graph vertices with properties provided in the df.
update this graph vertices with properties provided in the df. you should provide id in non encoded format
+-----------------+---------+---------+ | community_id|member_id| age| +-----------------+---------+---------+ | 1182054400| 0| 0| +-----------------+---------+---------+
the df is not cached by the function. the dataframe should be persisted by the user if dynamic data source is used.
vertex label to update
dataframe with vertex ids and columns to update
update this graph vertices with properties provided in the df.
update this graph vertices with properties provided in the df. the minimal df schema is just vertex "id" and one property to update:
+-----------------+---------+
| id| age|
+-----------------+---------+
|god:AAAAATMAAA...| 0|
+-----------------+---------+label and vertices id will be extracted from the graph frame id. for better performance it is recommended to add/leave "~label" column
+-----------------+---------+---------+
| id| ~label| age|
+-----------------+---------+---------+
|god:AAAAATMAAA...| god| 0|
+-----------------+---------+---------+you can also provide id in non encoded format
+-----------------+---------+---------+---------+ | community_id|member_id| ~label| age| +-----------------+---------+---------+---------+ | 1182054400| 0| god| 0| +-----------------+---------+---------+---------+
Note: passing both synthetic "id" and vertex Id columns is an error.
dataframe with vertex id and update columns
empty (means all) by default, it is convenient to group vertexes with the same id format. That group could be passed here, to reduce number of verification steps
cache df before processing, true by default for consistence update and performance
Return graph traversal that supports a subset of TinkerPop3 traversal steps
Return graph traversal that supports a subset of TinkerPop3 traversal steps
to start traverse with
GraphTraversal[Edge] for the filtered graph
Return graph traversal that supports a subset of TinkerPop3 traversal steps
Return graph traversal that supports a subset of TinkerPop3 traversal steps
GraphTraversal[Edge] for the graph
Return graph traversal that supports subset of TinkerPop3 traversal steps
Return graph traversal that supports subset of TinkerPop3 traversal steps
to start traverse with
GraphTraversal[Vertex] for the filtered graph
Return graph traversal that supports subset of TinkerPop3 traversal steps
Return graph traversal that supports subset of TinkerPop3 traversal steps
GraphTraversal[Vertex] for the graph
proxy call to gf.cache()
proxy call to gf.cache()
this
Remove any invalid edge entries from the database backend.
shortcut for deleteEdges(df: DataFrame, cache: Boolean = true) for Java
clean vertex properties with meta properties
clean vertex properties with meta properties
property names to delete
proxy call to gf.dropIsolatedVertices()
proxy call to gf.dropIsolatedVertices()
new filtered DseGraphFrame
proxy call to gf.filterEdges()
proxy call to gf.filterEdges()
new filtered DseGraphFrame
proxy call to gf.filterEdges()
proxy call to gf.filterEdges()
new filtered DseGraphFrame
proxy call to gf.filterVertices()
proxy call to gf.filterVertices()
new filtered DseGraphFrame
proxy call to gf.filterVertices()
proxy call to gf.filterVertices()
new filtered DseGraphFrame
Returns the graph name of this DseGraphFrame.
Returns the graph name of this DseGraphFrame.
NoSuchElementException if the graph name is not set.
Performs a read or write based operation on the Graph backing this GraphTraversalSource.
Performs a read or write based operation on the Graph backing this GraphTraversalSource. This
step can be accompanied by the Object) modulator for further configuration
and must be accompanied by a GraphTraversal#read() or GraphTraversal#write() modulator step
which will terminate the traversal.
the url of file in distributed file system or JDBC connection or the name of file in default file system for which the read or write will apply - note that the context of how this parameter is used is wholly dependent on the implementation. i.e cassandra read/writer implementation will ignore this path and read table name from parameters.
the traversal with the { @link IoStep} added
proxy call to gf.persist()
proxy call to gf.persist()
this
proxy call to gf.persist()
proxy call to gf.persist()
this
proxy call to gf.unpersist()
proxy call to gf.unpersist()
this
proxy call to gf.unpersist()
proxy call to gf.unpersist()
this
shortcut for updateEdges(df: DataFrame, cache: Boolean = true) for Java
shortcut for updateVertices(df: DataFrame, labels: Seq[String] = Seq.empty, cache: Boolean = true) for Java API
shortcut for updateVertices(df: DataFrame, labels: Seq[String] = Seq.empty, cache: Boolean = true) for Java API
dataframe with vertex id and update columns
Provides DSE Graph-specific methods on GraphFrames. A
DseGraphFramerequires agraphNamefor creating some traversal steps and for writing data back to DSE. Implicit conversions ensure thegraphNameis preserved or reassigned since it can be lost during a DseGraphFrame->GraphFrame->DseGraphFrame transition chain.