From relation algebra to semi-join algebra: an approach for graph query optimization
DBPL, pp. 5:1-5:10, 2017.
Many graph query languages rely on the composition operator to navigate graphs and select nodes of interests, even though evaluating compositions of relations can be costly. Often, this need for composition can be reduced by rewriting towards queries that use semi-joins instead. In this way, the cost of evaluating queries can be significa...More
Full Text (Upload PDF)
PPT (Upload PPT)