From relation algebra to semi-join algebra: an approach for graph query optimization

    Catherine L. Pilachowski
    Catherine L. Pilachowski

    DBPL, pp. 5:1-5:10, 2017.

    Cited by: 1|Bibtex|Views1|Links
    EI

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments