Ruben Verborgh’s data

Matches in Ruben’s data for { ?s ?p ?o }

• publication topic nanopublications.
• publication topic access_control.
• publication topic SHACL.
• publication topic publication.
• publication topic interoperability.
• publication topic Solid.
• publication topic Linked_Data.
• publication topic Semantic_Web.
• publication topic RDF.
• publication topic World_Wide_Web.
• publication subject nanopublications.
• publication subject access_control.
• publication subject SHACL.
• publication subject publication.
• publication subject interoperability.
• publication subject Solid.
• publication subject Linked_Data.
• publication subject Semantic_Web.
• publication subject RDF.
• publication subject World_Wide_Web.
• publication authorList b0_b2035.
• publication topic nanopublications.
• publication topic access_control.
• publication topic SHACL.
• publication topic publication.
• publication topic interoperability.
• publication topic Solid.
• publication topic Linked_Data.
• publication topic Semantic_Web.
• publication topic RDF.
• publication topic World_Wide_Web.
• publication abstract "As the building industry is rapidly catching up with digital advancements, and Web technologies grow in both maturity and security, a data- and Web-based construction practice comes within reach. In such an environment, private project information and open online data can be combined to allow cross-domain interoperability at data level, using Semantic Web technologies. As construction projects often feature complex and temporary networks of stakeholder firms and their employees, a property-based access control mechanism is necessary to enable a flexible and automated management of distributed building projects. In this article, we propose a method to facilitate such mechanism using existing Web technologies: RDF, SHACL, WebIDs, nanopublications and the Linked Data Platform. The proposed method will be illustrated with an extension of a custom Node.js Solid server. The potential of the Solid ecosystem has been put forward earlier as a basis for a Linked Data-based Common Data Environment: its decentralised setup, connection of both RDF and non-RDF resources and fine-grained access control mechanisms are considered an apt foundation to manage distributed digital twins.".
• publication datePublished "2020".
• publication mainEntityOfPage werbrouck_ldac_2020.
• publication sameAs publication.
• publication isPrimaryTopicOf werbrouck_ldac_2020.
• publication page werbrouck_ldac_2020.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf author me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf author ruben_eschauzier.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf author me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf creator me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf creator ruben_eschauzier.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf creator me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf about query_processing.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf about Solid.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf author me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf author ruben_eschauzier.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf author me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf coparticipatesWith me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf coparticipatesWith ruben_eschauzier.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf coparticipatesWith me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type ScholarlyArticle.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type Article.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type Document.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type Q386724.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type CreativeWork.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type Document.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type Work.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf type Document.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf P50 me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf P50 ruben_eschauzier.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf P50 me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf maker me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf maker ruben_eschauzier.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf maker me.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf title "How Does the Link Queue Evolve during Traversal-Based Query Processing?".
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf isPartOf proceedings_of_the_7th_workshop_on_storing_querying_and_benchmarking_knowledge_graphs.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf name "How Does the Link Queue Evolve during Traversal-Based Query Processing?".
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf label "How Does the Link Queue Evolve during Traversal-Based Query Processing?".
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf name "How Does the Link Queue Evolve during Traversal-Based Query Processing?".
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf topic query_processing.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf topic Solid.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf subject query_processing.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf subject Solid.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf authorList b0_b1833.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf topic query_processing.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf topic Solid.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf abstract "Link Traversal-based Query Processing (LTQP) is an integrated querying approach that allows the query engine to start with zero knowledge of the data to query and discover data sources on the fly. The query engine starts with some seed documents and dynamically discovers new data sources by dereferencing hyperlinks in previously ingested data. Given the dynamic nature of source discovery, query processing tends to be relatively slow. Optimization techniques exist, such as exploiting existing structural information, but they depend on a deep understanding of the link queue during LTQP. To this end, we investigate the evolution of the types of link sources in the link queue and introduce metrics that describe key link queue characteristics. This paper analyses the link queue to guide future work on LTQP query optimization approaches that exploit structural information within a Solid environment. We find that queries exhibit two different execution patterns, one where the link queue is primarily empty and the other where the link queue fills faster than the engine can process. Our results show that the link queue is not functioning optimally and that our current approach to link discovery is not sufficiently selective.".
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf datePublished "2023".
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf mainEntityOfPage eschauzier_quweda_2023.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf sameAs QuWeDa_2023_Link_Queue_Analysis_Final.pdf.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf isPrimaryTopicOf eschauzier_quweda_2023.
• QuWeDa_2023_Link_Queue_Analysis_Final.pdf page eschauzier_quweda_2023.
• article-ldtraversal-security-short author me.
• article-ldtraversal-security-short author me.
• article-ldtraversal-security-short creator me.
• article-ldtraversal-security-short creator me.
• article-ldtraversal-security-short about Big_Data.
• article-ldtraversal-security-short about Research.
• article-ldtraversal-security-short about Decentralization.
• article-ldtraversal-security-short about personal_data.
• article-ldtraversal-security-short author me.
• article-ldtraversal-security-short author me.
• article-ldtraversal-security-short coparticipatesWith me.
• article-ldtraversal-security-short coparticipatesWith me.
• article-ldtraversal-security-short type PublicationVolume.
• article-ldtraversal-security-short type ScholarlyArticle.
• article-ldtraversal-security-short type Article.
• article-ldtraversal-security-short type Document.
• article-ldtraversal-security-short type Q386724.

• first
• previous
• next