A path algebra for multi-relational graphs

Authors:
Marko A. Rodriguez;Peter Neubauer
Affiliations:
AT&T Interactive, Santa Fe, NM 87506 USA;Neo Technology, 21119 Malmö, Sweden
Venue:
ICDEW '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering Workshops
Year:
2011

Citing 0
Cited 3

R2DF framework for ranked path queries over weighted RDF graphs

Proceedings of the International Conference on Web Intelligence, Mining and Semantics
From network mining to large scale business networks

Proceedings of the 21st international conference companion on World Wide Web
Business network reconstruction using datalog

Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an n-ary relational algebra, a concatenative single-relational path algebra, and a tensor-based multi-relational algebra. The presented algebra provides a monoid, automata, and formal language theoretic foundation for the construction of a multi-relational graph traversal engine.