Skip to Main content Skip to Navigation
Conference papers

PFed: Recommending Plausible Federated SPARQL Queries

Abstract : Federated SPARQL queries allow to query multiple inter-linked datasets hosted by remote SPARQL endpoints. However, finding federated queries over a growing number of datasets is challenging. In this paper, we propose PFed, an approach to recommend plausible fed-erated queries based on real query logs of different datasets. The problem is not to find similar federated queries, but plausible complementary queries over different datasets. Starting with a real SPARQL query from a given log, PFed stretches the query with real queries from different logs. To prune the research space, PFed proposes semantic summary to prune the query logs. Experimental results with real logs of DBpedia and SWDF demonstrate that PFed is able to prune drastically the logs and recommend plausible federated queries.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02278260
Contributor : Hala Skaf-Molli <>
Submitted on : Wednesday, September 4, 2019 - 11:30:42 AM
Last modification on : Wednesday, June 24, 2020 - 4:19:40 PM
Long-term archiving on: : Thursday, February 6, 2020 - 9:03:39 AM

File

PFEDCameraReadydexa2019.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02278260, version 1

Citation

Florian Hacques, Hala Skaf-Molli, Pascal Molli, Sara El Hassad. PFed: Recommending Plausible Federated SPARQL Queries. 30th International Conference on Database and Expert Systems Applications - DEXA 2019, Aug 2019, Linz, Austria. ⟨hal-02278260⟩

Share

Metrics

Record views

196

Files downloads

156