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

The Web of Linked Data is composed of tons of RDF documents interlinked toeach other forming a huge repository of distributed semantic data. Effectivelyquerying this distributed data source is an important open problem in theSemantic Web area. In this paper, we propose LDQL, a declarative language toquery Linked Data on the Web. One of the novelties of LDQL is that it expressesseparately (i) patterns that describe the expected query result, and (ii) Webnavigation paths that select the data sources to be used for computing theresult. We present a formal syntax and semantics, prove equivalence rules, andstudy the expressiveness of the language. In particular, we show that LDQL isstrictly more expressive than the query formalisms that have been proposedpreviously for Linked Data on the Web. The high expressiveness allows LDQL todefine queries for which a complete execution is not computationally feasibleover the Web. We formally study this issue and provide a syntactic sufficientcondition to avoid this problem; queries satisfying this condition are ensuredto have a procedure to be effectively evaluated over the Web of Linked Data.

LDQL: A Query Language for the Web of Linked Data (Extended Version)