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/

Zendy Plus

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

Zendy Tools

Zendy Open

We investigate the computational complexity of minimizing the sourceside-effect in order to remove a given number of tuples from the output of aconjunctive query. This is a variant of the well-studied {\em deletionpropagation} problem, the difference being that we are interested in removingthe smallest subset of input tuples to remove a given number of output tuples}while deletion propagation focuses on removing a specific output tuple. We callthis the {\em Aggregated Deletion Propagation} problem. We completelycharacterize the poly-time solvability of this problem for arbitraryconjunctive queries without self-joins. This includes a poly-time algorithm todecide solvability, as well as an exact structural characterization of NP-hardinstances. We also provide a practical algorithm for this problem (a heuristicfor NP-hard instances) and evaluate its experimental performance on real andsynthetic datasets.

Aggregated Deletion Propagation for Counting Conjunctive Query Answers