3 citations · 3 across the 4 of their papers we have counts for
4 papers
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…