Estimating the Cost of Executing Link Traversal based SPARQL Queries
Antonis Sklavos, Pavlos Fafalios, Yannis Tzitzikas

TL;DR
This paper introduces methods to estimate the execution cost of link traversal SPARQL queries, aiming to optimize query strategies and improve the efficiency and reliability of semantic web data retrieval.
Contribution
It proposes baseline cost estimation methods for link traversal queries and provides a publicly available dataset for evaluation.
Findings
Baseline methods can effectively estimate query costs
Cost estimation aids in selecting optimal query execution strategies
Dataset enables benchmarking and further research
Abstract
An increasing number of organisations in almost all fields have started adopting semantic web technologies for publishing their data as open, linked and interoperable (RDF) datasets, queryable through the SPARQL language and protocol. Link traversal has emerged as a SPARQL query processing method that exploits the Linked Data principles and the dynamic nature of the Web to dynamically discover data relevant for answering a query by resolving online resources (URIs) during query evaluation. However, the execution time of link traversal queries can become prohibitively high for certain query types due to the high number of resources that need to be accessed during query execution. In this paper we propose and evaluate baseline methods for estimating the evaluation cost of link traversal queries. Such methods can be very useful for deciding on-the-fly the query execution strategy to follow…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Biomedical Text Mining and Ontologies · Data Quality and Management
