English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider query answering using views on graph databases, i.e. databasesstructured as edge-labeled graphs. We mainly consider views and queriesspecified by Regular Path Queries (RPQ). These are queries selecting pairs ofnodes in a graph database that are connected via a path whose sequence of edgelabels belongs to some regular language. We say that a view V determines aquery Q if for all graph databases D, the view image V(D) always containsenough information to answer Q on D. In other words, there is a well definedfunction from V(D) to Q(D). Our main result shows that when this function ismonotone, there exists a rewriting of Q as a Datalog query over the viewinstance V(D). In particular the rewriting query can be evaluated in timepolynomial in the size of V(D). Moreover this implies that it is decidablewhether an RPQ query can be rewritten in Datalog using RPQ views.

Datalog Rewritings of Regular Path Queries using Views