Problem
Research questions and friction points this paper is trying to address.
Link Traversal Query Processing
Decentralized networks
RDF Shapes
Search space reduction
Data-model selective queries
Traveling with a Map: Reducing the Search Space of Link Traversal Queries Using RDF Shapes
🤖 AI Summary
In decentralized networks, link-traversal queries suffer from high latency and transmission overhead due to redundant HTTP requests. This paper addresses this issue for selective queries by proposing a pruning mechanism based on RDF shape indexes. By incorporating shape metadata and designing a query-shape containment algorithm, the approach precisely narrows the search space while preserving fault tolerance. Evaluations on the SolidBench benchmark demonstrate that the proposed method significantly reduces both query execution time and time-to-first-result, substantially lowering network overhead with negligible performance impact on non-selective queries.
📝 Abstract
The centralization of web information raises legal and ethical concerns, particularly in social, healthcare, and education applications. Decentralized architectures offer a promising alternative by keeping data closer to its source, yet efficient query processing remains a significant challenge. Link Traversal Query Processing (LTQP) enables querying across decentralized networks but often suffers from long execution times and high data transfer costs due to the large number of HTTP requests involved. Many queries are highly selective with respect to the data model objects distributed across the network. For example, in a social media application where users store heterogeneous data, a query may target only users' posts and comments, ignoring their other information. We refer to such queries as data-model selective. We propose a shape-based pruning approach that relies on shape indexes and a query-shape subsumption algorithm to reduce the search space and thus the number of HTTP requests. We formalize this approach as a link pruning mechanism for LTQP and evaluate it on social media queries from the SolidBench benchmark across multiple metrics. Our results show that shape-based pruning substantially improves query execution time, first-result arrival time, diefficiency, and network usage for data-model selective queries, while having a negligible impact on non-selective data-model queries. These gains cost only a minor increase in triples per shape-index instance. Our approach is also resilient, retaining its benefits even when some data providers do not supply shape indexes. This work demonstrates that shape-based metadata can significantly optimize LTQP in decentralized knowledge graphs for an important class of queries. By exposing such metadata, data providers not only enhance data quality and interoperability but also improve the efficiency of traversal-based query processing.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Link Traversal Query Processing
RDF Shapes
Shape-based Pruning
Decentralized Knowledge Graphs
Query Optimization
🔎 Similar Papers
No similar papers found.
