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 often add arithmetic to extend the expressiveness of query languages andstudy the complexity of problems such as testing query containment and findingcertain answers in the framework of answering queries using views. When addingarithmetic comparisons, the complexity of such problems is higher than thecomplexity of their counterparts without them. It has been observed that we canachieve lower complexity if we restrict some of the comparisons in thecontaining query to be closed or open semi-interval comparisons. Here, focusinga) on the problem of containment for conjunctive queries with arithmeticcomparisons (CQAC queries, for short), we prove upper bounds on itscomputational complexity and b) on the problem of computing certain answers, wefind large classes of CQAC queries and views where this problem is polynomial.

On the complexity of query containment and computing certain answers in the presence of ACs