DocumentCode
3141366
Title
A path algebra for multi-relational graphs
Author
Rodriguez, Marko A. ; Neubauer, Peter
Author_Institution
AT&T Interactive, Santa Fe, NM, USA
fYear
2011
fDate
11-16 April 2011
Firstpage
128
Lastpage
131
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.
Keywords
automata theory; formal languages; graph theory; group theory; relational algebra; tensors; automata; formal language; monoid; multirelational graph traversal engine; n-ary relational algebra; path algebra; tensor-based multirelational algebra; Algebra; Algorithm design and analysis; Automata; Computational modeling; Engines; Generators; Joints;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering Workshops (ICDEW), 2011 IEEE 27th International Conference on
Conference_Location
Hannover
Print_ISBN
978-1-4244-9195-7
Electronic_ISBN
978-1-4244-9194-0
Type
conf
DOI
10.1109/ICDEW.2011.5767613
Filename
5767613
Link To Document