field respectively. As this paper studies the shortest path
discovery, only TE table is used in the following
operations.
Fig. 1 Relational representation of graph.
They abstract three key operators, namely F, E and M
operator, and then provide a generic graph searching
framework FEM. They find new features, such as window
function and merge statement introduced by recent SQL
standards, can simplify the expression and improve the
performance."[3]