A path algebra for multi-relational graphs
Data Engineering Workshops（2011）
摘要
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.
更多查看译文
关键词
formal language theoretic foundation,multi-relational graph traversal engine,vertex set,tensor-based multi-relational algebra,n-ary relational algebra,concatenative single-relational path algebra,multi-relational graph,algorithm design,relation algebra,computer model,automata theory,graph theory,computational modeling,formal languages,tensors,engines,group theory,automata,relational algebra,algorithm design and analysis,algebra,generators,discrete mathematics,formal language,monoid
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要