A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
From relation algebra to semi-join algebra
2017
Proceedings of The 16th International Symposium on Database Programming Languages - DBPL '17
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 signi cantly reduced. We study techniques to recognize and apply such rewritings. Concretely, we study the relationship between the expressive power of the relation
doi:10.1145/3122831.3122833
dblp:conf/dbpl/HellingsPGGW17
fatcat:4f2ytnvfprdc7le3e44kbp6njq