scalation
API
Generated with
scalation/scalation/scalation.database/scalation.database.triplegraph

scalation.database.triplegraph

package scalation.database.triplegraph

Members list

Type members

Classlikes

case class RDFTriple(s: String, p: ValueType, o: ValueType)

The RDFTriple class holds information about a triple (3 part edge). It may be viewed as a statement with a subject, predicate and object.

The RDFTriple class holds information about a triple (3 part edge). It may be viewed as a statement with a subject, predicate and object.

Value parameters

o

the tail vertex (object = IRI or literal value)

p

the relation/edge-label (predicate)

s

the head vertex (subject = International Resourse Indentifier (IRI))

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
case class Triple(h: Int, r: ValueType, t: Int)

The Triple class holds information about a triple (3 part edge).

The Triple class holds information about a triple (3 part edge).

Value parameters

h

the head vertex

r

the relation/edge-label

t

the tail vertex

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
case class TripleGraph(label: Array[ValueType], triples: ArrayBuffer[Triple], name: String, schema: Array[String]) extends Cloneable

The TripleGraph class stores vertex/edge-labeled triple graphs by maintaining bags of vertices and triples.

Value parameters

label

the array of vertex labels

name

the name of the triple-graph

schema

optional schema: map from label to label type

triples

the bag of triples in the triple-graph

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
trait Cloneable
class Object
trait Matchable
class Any
Show all
trait TripleGraphMatcher(g: TripleGraph, q: TripleGraph)

The TripleGraphMatcher trait serves as a template for implementing specific algorithms for graph pattern matching.

The TripleGraphMatcher trait serves as a template for implementing specific algorithms for graph pattern matching.

Value parameters

g

the data graph G(V, E, l) with vertices v in V

q

the query graph Q(U, D, k) with vertices u in U

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class TripleGraphSim(g: TripleGraph, q: TripleGraph) extends TripleGraphMatcher

The TripleGraphSim class provides an implementation for Simple Graph Simulation. For each vertex in a query graph q, it returns all matching vertices in the data graph g with the same vertex label and matching children.

The TripleGraphSim class provides an implementation for Simple Graph Simulation. For each vertex in a query graph q, it returns all matching vertices in the data graph g with the same vertex label and matching children.

Value parameters

g

the data graph G(V, E, l)

q

the query graph Q(U, D, k)

Attributes

See also
Supertypes
class Object
trait Matchable
class Any
final class tripleGraphSimTest

Attributes

Supertypes
class Object
trait Matchable
class Any
final class tripleGraphTest4

Attributes

Supertypes
class Object
trait Matchable
class Any

Value members

Concrete methods

def tripleGraphSimTest(): Unit

The tripleGraphSimTest main function is used to test the TripleGraphSim class.

The tripleGraphSimTest main function is used to test the TripleGraphSim class.

runMain scalation.database.triplegraph.tripleGraphSimTest

Attributes

def tripleGraphTest4(): Unit

The tripleGraphTest4 main function is used to test the TripleGraph class using the given data graph g and query graph q.

The tripleGraphTest4 main function is used to test the TripleGraph class using the given data graph g and query graph q.

runMain scalation.database.triplegraph.tripleGraphTest4

Attributes

Generated with