scalation.graphalytics

DualSim

class DualSim extends PatternMatcher

The 'DualSim' classs provides an implementation for Dual Graph Simulation.

Linear Supertypes
PatternMatcher, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. DualSim
  2. PatternMatcher
  3. AnyRef
  4. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DualSim(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 EMPTY: Array[ISet]

    Attributes
    protected
    Definition Classes
    PatternMatcher

  8. val LIMIT: Double

    Attributes
    protected
    Definition Classes
    PatternMatcher

  9. val SELF_LOOPS: Boolean

    Attributes
    protected
    Definition Classes
    PatternMatcher

  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. 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
    DualSim → PatternMatcher

  12. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  14. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  15. 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

  16. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  18. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  20. 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
    DualSim → PatternMatcher

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

    Definition Classes
    AnyRef

  22. def nisarDualSim(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 }

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  25. val ns_per_ms: Double

    Attributes
    protected
    Definition Classes
    PatternMatcher

  26. val qRange: Range

    Attributes
    protected
    Definition Classes
    PatternMatcher

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

    Definition Classes
    AnyRef

  28. def time[R](block: ⇒ R): R

    Print the elapsed time in milliseconds (ms) for the execution of an arbitrary block of code: 'time { block }'.

    Print the elapsed time in milliseconds (ms) for the execution of an arbitrary block of code: 'time { block }'.

    block

    the block of code to be executed

    Definition Classes
    PatternMatcher
    See also

    http://stackoverflow.com/questions/9160001/how-to-profile-methods-in-scala

  29. def toString(): String

    Definition Classes
    AnyRef → Any

  30. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from PatternMatcher

Inherited from AnyRef

Inherited from Any