scalation.graphalytics

DualSim2

class DualSim2 extends PatternMatcher

The DualSim2 class provides a second implementation for Dual Graph Simulation. It differs from DualSim by not using inverse adjacency sets ('par') in order to save space.

Linear Supertypes
PatternMatcher, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DualSim2
  2. PatternMatcher
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DualSim2(g: Graph, q: Graph)

    g

    the data graph G(V, E, l)

    q

    the query graph Q(U, D, k)

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  6. val CHECK: Int

    Attributes
    protected
    Definition Classes
    PatternMatcher

  7. val LIMIT: Double

    Attributes
    protected
    Definition Classes
    PatternMatcher

  8. val SELF_LOOPS: Boolean

    Attributes
    protected
    Definition Classes
    PatternMatcher

  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  10. def bijections(): Set[Array[Int]]

    Dual Graph Simulation by itself can not produce bijections.

    Dual Graph Simulation by itself can not produce bijections.

    Definition Classes
    DualSim2 → PatternMatcher

  11. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  14. def feasibleMates(): Array[ISet]

    Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's.

    Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's.

    Definition Classes
    PatternMatcher

  15. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. def mappings(): Array[ISet]

    Apply the Dual Graph Simulation pattern matching algorithm to find the mappings from the query graph 'q' to the data graph 'g'.

    Apply the Dual Graph Simulation pattern matching algorithm to find the mappings from the query graph 'q' to the data graph 'g'. These are represented by a multi-valued function 'phi' that maps each query graph vertex 'u' to a set of data graph vertices '{v}'.

    Definition Classes
    DualSim2 → PatternMatcher

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

    Definition Classes
    AnyRef

  21. final def notify(): Unit

    Definition Classes
    AnyRef

  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  23. val qRange: Range

    Attributes
    protected
    Definition Classes
    PatternMatcher

  24. def saltzDualSim(phi: Array[ISet]): Array[ISet]

    Given the mappings 'phi' produced by the 'feasibleMates' method, eliminate mappings 'u -> v' when (1) v's children fail to match u's or (2) v's parents fail to match u's.

    Given the mappings 'phi' produced by the 'feasibleMates' method, eliminate mappings 'u -> v' when (1) v's children fail to match u's or (2) v's parents fail to match u's.

    phi

    array of mappings from a query vertex u to { graph vertices v }

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

    Definition Classes
    AnyRef

  26. def toString(): String

    Definition Classes
    AnyRef → Any

  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from PatternMatcher

Inherited from AnyRef

Inherited from Any

Ungrouped