2Rrel

2Rrel is a term used in discussions of graph data models to denote a two-relational encoding scheme for binary relations. The approach distinguishes two component relations, typically labeled R_left and R_right, which jointly specify a relation between two entities. Instead of storing a single binary edge, a 2Rrel representation encodes the connection as a pair of related edges that together imply a directed relationship under a defined interpretation. The exact semantics of a 2Rrel assertion vary by variant, but common designs treat a fact about x and y as valid only if the corresponding patterns on both components hold in the data graph.

Structure and variants of 2Rrel vary, but a common design uses an intermediate anchor node to connect the two components. In one variant, an assertion about x and y is represented as a path x --R_left--> m --R_right--> y, where m is an intermediate node that carries additional context or provenance. Another variant treats the pair of edges as separate, with a join-like condition that links the two edges to express the composite relation.

Rationale for this approach centers on modularity and expressiveness. Proponents argue that separating semantics into two relations can capture contextual roles, provenance, or temporal aspects more naturally than a single edge. It can also influence query planning by enabling targeted indexing on each component. Criticism focuses on increased modeling and query complexity, potential performance overhead, and the lack of unified standards across implementations.

Example: encoding “author wrote book” with an intermediate node T, where author --R_left--> T and T --R_right--> book together imply authorship.