And(v1,v2) represents both v1 and v2
A candidate to match
Reference to a sequence of labels
reference value of this constraint
A neighbor of a node through a direct edge
Represents directed edges
Reference to an sequence of labels which are disjunctive
Fail RBE doesn't match
Generic representation of graphs
Implementation of graph as a map
Positive integers
Represents a limit of an interval.
Represents a limit of an interval. It can be either an Int or an Unbounded value
Definition of intervals (m,n) where m and n can be unbounded
A neighbor of a node through an inverse edge
A missing candidate
A negative candidate
Represents a neighbor of a node in a graph.
Represents a neighbor of a node in a graph. It can be a direct arc or an inverse arc
A node shape
Or(v1,v2) represents either v1 or v2
A candidate that is pending
Plus(v) represents 1 or more appearances of v
A positive candidate
Boolean Constraint on nodes (it has a name and a predicate).
Boolean Constraint on nodes (it has a name and a predicate).
Note: pred is defined in the 2nd parameter section to avoid equality and hashing of functions
RDF as graphs
This trait defines Single Occurrence Regular Bag Expressions (Rbe)
This trait defines Single Occurrence Regular Bag Expressions (Rbe)
The algorithm to check that a Rbe contains a bag is PTIME The algorithm has been described in [1] and is based on intervals
[1] Complexity and Expressiveness of ShEx for RDF, S. Staworko, I. Boneva, J. Labra, S. Hym, E. Prud'hommeaux, H. Solbrig
RBE exceptions
Reference to another label
Negation of a expression
Repeat(v,n,m) represents between n and m apperances of v
Defines a Schema which is a map from Labels to Shapes
A shape contains a regular bag expression, a closed modifier and a list of extras
A shape contains a regular bag expression, a closed modifier and a list of extras
regular bag expression
list of extra edges that are allowed
the shape is closed
Star(v) represents 0 or more v
Simple graphs whose nodes and edges are strings They are used for testing purposes only
Represents a symbol that is repeated between n and m times (m can be unbounded)
Empty RBE
Some common node shapes
Implementation of Regular Bag Expressions.
More details about the algorithm can be found at: ICDT paper
Overview
A Schema is defined as a map from Labels to Shape. A Shape contains a Rbe.