DualSim

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. val CHECK: Int

   

   Attributes

   protected

   Definition Classes

   PatternMatcher

5. val LIMIT: Double

   

   Attributes

   protected

   Definition Classes

   PatternMatcher

6. val SELF_LOOPS: Boolean

   

   Attributes

   protected

   Definition Classes

   PatternMatcher

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

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

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

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

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

15. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

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

    

    Definition Classes

    AnyRef

19. 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 }

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

22. val qRange: Range

    

    Attributes

    protected

    Definition Classes

    PatternMatcher

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

    

    Definition Classes

    AnyRef

24. def toString(): String

    

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )