Class/Object

com.datastax.bdp.graph.spark.graphframe

DseGraphFrameBuilder

Related Docs: object DseGraphFrameBuilder | package graphframe

Permalink

class DseGraphFrameBuilder extends AnyRef

Helper class to create GraphFrame from C* backend. The GraphFrame caches dataframes on creation. It is recommended to call withVertex method to create subgraph prior graph frame creation to reduce memory footprint

Usage: val dataFrame = DseGraphFrameBuilder("graph", spark).dseGraph()

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DseGraphFrameBuilder
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DseGraphFrameBuilder(dabaseName: String, vertexLabels: Seq[String], schema: SerializableSchema, spark: SparkSession)

    Permalink
    Attributes
    protected

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def copy(vertexLabels: Seq[String] = vertexLabels): DseGraphFrameBuilder

    Permalink

  7. val dabaseName: String

    Permalink

  8. def edges(): DataFrame

    Permalink

    DSE Graph store 2 copy of each edge, as "IN" and "OUT", it also can "cache" partition one of the direction in local C* table, in this case only one copy of the edge available in general table.

    DSE Graph store 2 copy of each edge, as "IN" and "OUT", it also can "cache" partition one of the direction in local C* table, in this case only one copy of the edge available in general table. Thus following algorithm is used to gather edges 1. If requested vertices has no partition edges or only "IN" vertices were partitioned, select all "OUT" vertices for given vertexLabels. 2. if only "OUT" vertices were partitioned select all "IN" vertices 3. in case both IN and OUT partition exists, select both and then call distinct on them, to remove duplicates that is slower on startup but spark-repartition edges DF for beter join performance in the future.

    Note: If subset of vertex label was passed to the Builder, some edges could point to non-existent vertices.

    returns

    GraphFrame compatible non-cached edge DataFrame

  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  13. def graphFrame(): DseGraphFrame

    Permalink

    returns

    graph frame

  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. val schema: SerializableSchema

    Permalink

  20. val spark: SparkSession

    Permalink

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  23. val vertexLabels: Seq[String]

    Permalink

  24. def vertices(): DataFrame

    Permalink

    returns

    GraphFrame compatible non-cached vertex DataFrame

  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  28. def withVertexLabels(labels: String*): DseGraphFrameBuilder

    Permalink

    Sub graph that contains only vertexes with given labels.

    Sub graph that contains only vertexes with given labels.

    Attributes
    protected

Inherited from AnyRef

Inherited from Any

Ungrouped