scalation.graphalytics

TightSimulation

class TightSimulation extends AnyRef

The 'TightSimulation' class provides an implementation for graph pattern matching.

See also

http://hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf

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

Instance Constructors

  1. new TightSimulation(printSetting: String)

    printSetting

    '0' for match and '1' for ball

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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  5. def calculateBallDiameterMetrics(balls: HashMap[Int, Ball]): Statistic

    Calculate statistics (e.

    Calculate statistics (e.g., min, max, avg diameter and standard deviation) on the balls left after postprocessing.

    balls

    mappings from a center vertex to the Ball B(Graph, Center, Radius)

  6. def calculateTotalEdges(g: Graph, balls: HashMap[Int, Ball], matchCenters: Set[Int]): Int

    Count distinct edges left after post processing.

    Count distinct edges left after post processing.

    g

    the data graph G(V, E, l)

    balls

    mappings from a center vertex to the Ball B(Graph, Center, Radius)

    matchCenters

    set of all vertices which are considered as center

  7. def calculateTotalVertices(): Int

    Count distinct vertices left after post processing.

  8. def checkInsertOfMatch(str: Set[String]): Boolean

    Check whether a ball is subset or superset of any other ball and add its entry accordingly in listofDistinctReduceSet and return true, if added in the list else false.

    Check whether a ball is subset or superset of any other ball and add its entry accordingly in listofDistinctReduceSet and return true, if added in the list else false.

    str

    set of vertices of a ball in string format

  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def dualFilter(query: Graph, sim: Array[ISet], ball: Ball): Array[ISet]

    Perform dual simulation onto the ball.

    Perform dual simulation onto the ball.

    query

    the query graph Q(U, D, k)

    sim

    mappings from a query vertex u_q to { graph vertices v_g }

    ball

    the Ball B(Graph, Center, Radius)

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

    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  13. def filterGraph(g: Graph, q: Graph, sim: Array[ISet]): Graph

    Prune the data graph by consider only those vertices and edges which are part of feasible matches after performing initial dual simulation.

    Prune the data graph by consider only those vertices and edges which are part of feasible matches after performing initial dual simulation.

    g

    the data graph G(V, E, l)

    q

    the query graph Q(U, D, k)

    sim

    mappings from a query vertex u_q to { graph vertices v_g }

  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  21. def performPostProcessing(g: Graph, balls: HashMap[Int, Ball], matchCenters: Set[Int]): Unit

    Perform post processing after computing all the matches.

    Perform post processing after computing all the matches.

    g

    the data graph G(V, E, l)

    balls

    mappings from a center vertex to the Ball B(Graph, Center, Radius)

    matchCenters

    set of all vertices which are considered as center

  22. def printDualSimMatch(sim: HashMap[Int, Set[Int]]): Unit

    Print the dual sim match set.

    Print the dual sim match set.

    sim

    mappings from a query vertex u_q to { graph vertices v_g }

  23. def selectivityCriteria(qmet: GraphMetrics): Int

    Return the vertex from an array of central vertices, those which have highest adj set size and lowest frequency of label in the query graph, i.

    Return the vertex from an array of central vertices, those which have highest adj set size and lowest frequency of label in the query graph, i.e. highest ratio.

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

    Definition Classes
    AnyRef
  25. def tightSim(q: Graph, g: Graph, queryName: String, dataName: String): Array[ISet]

    Performs tight simulation.

    Performs tight simulation.

    q

    the query graph Q(U, D, k)

    g

    the data graph G(V, E, l)

    queryName

    the query graph relative file name

    dataName

    the data graph relative file name

  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 AnyRef

Inherited from Any

Ungrouped