Ruben Verborgh’s data

Matches in Ruben’s data for { <https://dx.doi.org/10.1017/S1471068423000054> ?p ?o }

• S1471068423000054 author me.
• S1471068423000054 author younes_zeboudj.
• S1471068423000054 author heba_aamer.
• S1471068423000054 author bas_ketsman.
• S1471068423000054 author bart_bogaerts.
• S1471068423000054 author me.
• S1471068423000054 creator me.
• S1471068423000054 creator younes_zeboudj.
• S1471068423000054 creator heba_aamer.
• S1471068423000054 creator bas_ketsman.
• S1471068423000054 creator bart_bogaerts.
• S1471068423000054 creator me.
• S1471068423000054 about query_processing.
• S1471068423000054 about trust.
• S1471068423000054 about SPARQL.
• S1471068423000054 about World_Wide_Web.
• S1471068423000054 author me.
• S1471068423000054 author younes_zeboudj.
• S1471068423000054 author heba_aamer.
• S1471068423000054 author bas_ketsman.
• S1471068423000054 author bart_bogaerts.
• S1471068423000054 author me.
• S1471068423000054 coparticipatesWith me.
• S1471068423000054 coparticipatesWith younes_zeboudj.
• S1471068423000054 coparticipatesWith heba_aamer.
• S1471068423000054 coparticipatesWith bas_ketsman.
• S1471068423000054 coparticipatesWith bart_bogaerts.
• S1471068423000054 coparticipatesWith me.
• S1471068423000054 type ScholarlyArticle.
• S1471068423000054 type Article.
• S1471068423000054 type Document.
• S1471068423000054 type Q386724.
• S1471068423000054 type CreativeWork.
• S1471068423000054 type Document.
• S1471068423000054 type Work.
• S1471068423000054 type Document.
• S1471068423000054 P50 me.
• S1471068423000054 P50 younes_zeboudj.
• S1471068423000054 P50 heba_aamer.
• S1471068423000054 P50 bas_ketsman.
• S1471068423000054 P50 bart_bogaerts.
• S1471068423000054 P50 me.
• S1471068423000054 maker me.
• S1471068423000054 maker younes_zeboudj.
• S1471068423000054 maker heba_aamer.
• S1471068423000054 maker bas_ketsman.
• S1471068423000054 maker bart_bogaerts.
• S1471068423000054 maker me.
• S1471068423000054 title "Distributed Subweb Specifications for Traversing the Web".
• S1471068423000054 isPartOf theory_and_practice_of_logic_programming.
• S1471068423000054 name "Distributed Subweb Specifications for Traversing the Web".
• S1471068423000054 label "Distributed Subweb Specifications for Traversing the Web".
• S1471068423000054 name "Distributed Subweb Specifications for Traversing the Web".
• S1471068423000054 topic query_processing.
• S1471068423000054 topic trust.
• S1471068423000054 topic SPARQL.
• S1471068423000054 topic World_Wide_Web.
• S1471068423000054 subject query_processing.
• S1471068423000054 subject trust.
• S1471068423000054 subject SPARQL.
• S1471068423000054 subject World_Wide_Web.
• S1471068423000054 authorList b0_b1860.
• S1471068423000054 topic query_processing.
• S1471068423000054 topic trust.
• S1471068423000054 topic SPARQL.
• S1471068423000054 topic World_Wide_Web.
• S1471068423000054 abstract "Link traversal–based query processing (LTQP), in which a SPARQL query is evaluated over a web of documents rather than a single dataset, is often seen as a theoretically interesting yet impractical technique. However, in a time where the hypercentralization of data has increasingly come under scrutiny, a decentralized Web of Data with a simple document-based interface is appealing, as it enables data publishers to control their data and access rights. While LTQP allows evaluating complex queries over such webs, it suffers from performance issues (due to the high number of documents containing data) as well as information quality concerns (due to the many sources providing such documents). In existing LTQP approaches, the burden of finding sources to query is entirely in the hands of the data consumer. In this paper, we argue that to solve these issues, data publishers should also be able to suggest sources of interest and guide the data consumer toward relevant and trustworthy data. We introduce a theoretical framework that enables such guided link traversal and study its properties. We illustrate with a theoretic example that this can improve query results and reduce the number of network requests. We evaluate our proposal experimentally on a virtual linked web with specifications and indeed observe that not just the data quality but also the efficiency of querying improves.".
• S1471068423000054 datePublished "2023".
• S1471068423000054 mainEntityOfPage bogaerts_tplp_2023.
• S1471068423000054 sameAs S1471068423000054.
• S1471068423000054 isPrimaryTopicOf bogaerts_tplp_2023.
• S1471068423000054 page bogaerts_tplp_2023.