Class/Object

com.seancheatham.graph.adapters.bigtable

BigtableGraph

Related Docs: object BigtableGraph | package bigtable

Permalink

class BigtableGraph extends HBaseGraph

An adapter which turns a Google Big Table into a graph database. Though databases like Bigtable are extremely performant across large datasets for fast individual record reads, they are less performant for graph pathing algorithms. As such, Big Table is best suited for data which best leverages "Graph Representation", but not necessarily the accompanying algorithms to traverse them.

Linear Supertypes
HBaseGraph, LazyLogging, Graph, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BigtableGraph
  2. HBaseGraph
  3. LazyLogging
  4. Graph
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BigtableGraph(connection: Connection, nodesTableName: String = "nodes", edgesTableName: String = "edges")

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def ++(other: Graph): Graph

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef → Any

  5. def addEdge[E <: Edge](label: String, _1: Node, _2: Node, data: Map[String, JsValue]): E

    Permalink
    Definition Classes
    HBaseGraph → Graph

  6. def addEdge[E <: Edge](e: ((Node, String), Node), data: Map[String, JsValue]): E

    Permalink
    Definition Classes
    Graph

  7. def addNode[N <: Node](label: String, data: Map[String, JsValue]): N

    Permalink
    Definition Classes
    HBaseGraph → Graph

  8. val admin: Admin

    Permalink
    Definition Classes
    HBaseGraph

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  10. def clone(): AnyRef

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

  11. val eTName: TableName

    Permalink
    Definition Classes
    HBaseGraph

  12. implicit def edgeFactory: Factory

    Permalink
    Definition Classes
    Graph

  13. val edgesTable: Table

    Permalink
    Definition Classes
    HBaseGraph

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

    Permalink
    Definition Classes
    AnyRef

  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  16. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  18. def getEdge[E <: Edge](id: String): Option[E]

    Permalink
    Definition Classes
    HBaseGraph → Graph

  19. def getEdges[E <: Edge](label: Option[String], data: Map[String, JsValue]): TraversableOnce[E]

    Permalink
    Definition Classes
    HBaseGraph → Graph

  20. def getEgressEdges[E <: Edge](node: Node, edgeLabel: Option[String], edgeData: Map[String, JsValue]): TraversableOnce[E]

    Permalink
    Definition Classes
    HBaseGraph → Graph

  21. def getIngressEdges[E <: Edge](node: Node, edgeLabel: Option[String], edgeData: Map[String, JsValue]): TraversableOnce[E]

    Permalink
    Definition Classes
    HBaseGraph → Graph

  22. def getNode[N <: Node](id: String): Option[N]

    Permalink
    Definition Classes
    HBaseGraph → Graph

  23. def getNodes[N <: Node](label: Option[String], data: Map[String, JsValue]): TraversableOnce[N]

    Permalink
    Definition Classes
    HBaseGraph → Graph

  24. implicit def graph: Graph

    Permalink
    Definition Classes
    Graph

  25. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  26. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  27. lazy val logger: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    LazyLogging

  28. val nTName: TableName

    Permalink
    Definition Classes
    HBaseGraph

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

    Permalink
    Definition Classes
    AnyRef

  30. implicit def nodeFactory: Factory

    Permalink
    Definition Classes
    Graph

  31. val nodesTable: Table

    Permalink
    Definition Classes
    HBaseGraph

  32. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  33. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  34. def pathsTo(start: Node, end: Node, nodeLabels: Seq[String], edgeLabels: Seq[String]): TraversableOnce[Path]

    Permalink
    Definition Classes
    HBaseGraph → Graph

  35. def removeEdge(edge: Edge): Graph

    Permalink
    Definition Classes
    HBaseGraph → Graph

  36. def removeNode(node: Node): Graph

    Permalink
    Definition Classes
    HBaseGraph → Graph

  37. def removeNodes(label: Option[String], data: Map[String, JsValue]): Graph

    Permalink
    Definition Classes
    HBaseGraph → Graph

  38. def shutdown(): Unit

    Permalink
    Definition Classes
    HBaseGraph

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

    Permalink
    Definition Classes
    AnyRef

  40. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  41. def updateEdge[E <: Edge](edge: E)(changes: (String, JsValue)*): E

    Permalink
    Definition Classes
    HBaseGraph → Graph

  42. def updateNode[N <: Node](node: N)(changes: (String, JsValue)*): N

    Permalink
    Definition Classes
    HBaseGraph → Graph

  43. final def wait(): Unit

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

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

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

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

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

Inherited from HBaseGraph

Inherited from LazyLogging

Inherited from Graph

Inherited from AnyRef

Inherited from Any

Ungrouped