3 citations · 8 across the 9 of their papers we have counts for
9 papers · 1 filter
Does SRL Pave the Road to Explainable Reasoning? Lessons Learned from an Implementer's Perspective
Lander Maes, Bryan-Elliott Tam, Jitse De Smet +3
The Shape Rules Language (SRL) Working Draft defines how to derive new RDF triples from an RDF graph using inference rules. Each rule matches graph patterns and instantiates triple…
Strengthening LargeRDFBench for Interoperable Federated SPARQL Evaluation
Bryan-Elliott Tam, Muhammad Saleem, Ruben Taelman
LargeRDFBench is one of the most comprehensive benchmarks for evaluating federated SPARQL query engines, combining real, interlinked datasets with a rich query suite that has made…
Demonstrating Online Schema Alignment in Decentralized Knowledge Graphs Querying
Bryan-Elliott Tam, Pieter Colpaert, Ruben Taelman
Decentralized Knowledge Graphs querying enables integrating distributed data without centralization, but is highly sensitive to vocabulary heterogeneity. Query issuers cannot reali…
Optimizing Traversal Queries of Sensor Data Using a Rule-Based Reachability Approach
Bryan-Elliott Tam, Ruben Taelman, Julián Rojas Meléndez +1
Link Traversal queries face challenges in completeness and long execution time due to the size of the web. Reachability criteria define completeness by restricting the links follow…
Opportunities for Shape-based Optimization of Link Traversal Queries
Bryan-Elliott Tam, Ruben Taelman, Pieter Colpaert +1
Data on the web is naturally unindexed and decentralized. Centralizing web data, especially personal data, raises ethical and legal concerns. Yet, compared to centralized query app…
Distributed Subweb Specifications for Traversing the Web
Bart Bogaerts, Bas Ketsman, Younes Zeboudj +3
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 interestin…
Evaluation of Link Traversal Query Execution over Decentralized Environments with Structural Assumptions
Ruben Taelman, Ruben Verborgh
To counter societal and economic problems caused by data silos on the Web, efforts such as Solid strive to reclaim private data by storing it in permissioned documents over a large…
Towards Querying in Decentralized Environments with Privacy-Preserving Aggregation
Ruben Taelman, Simon Steyskal, Sabrina Kirrane
The Web is a ubiquitous economic, educational, and collaborative space. However, it also serves as a haven for personal information harvesting. Existing decentralised Web-based eco…
Guided Link-Traversal-Based Query Processing
Ruben Verborgh, Ruben Taelman
Link-Traversal-Based Query Processing (LTBQP) is a technique for evaluating queries over a web of data by starting with a set of seed documents that is dynamically expanded through…