Optimizing SPARQL Queries over Decentralized Knowledge Graphs

Christian Tovgaard Aebeloe*, Gabriela Montoya, Katja Hose

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

1 Downloads (Pure)

Abstract

While the Web of Data in principle offers access to a wide range of interlinked data, the architecture of the Semantic Web today relies mostly on the data providers to maintain access to their data through SPARQL endpoints. Several studies, however, have shown that such endpoints often experience downtime, meaning that the data they maintain becomes inaccessible. While decentralized systems based on Peer-to-Peer (P2P) technology have previously shown to increase the availability of knowledge graphs, even when a large proportion of the nodes fail, processing queries in such a setup can be an expensive task since data necessary to answer a single query might be distributed over multiple nodes. In this paper, we therefore propose an approach to optimizing SPARQL queries over decentralized knowledge graphs, called Lothrok. While there are potentially many aspects to consider when optimizing such queries, we focus on three aspects: cardinality estimation, locality awareness, and data fragmentation. We empirically show that Lothbrok is able to achieve significantly faster query processing performance compared to the state of the art when processing challenging queries as well as when the network is under high load.
Original languageEnglish
JournalSemantic Web
Volume14
Issue number6
Pages (from-to)1121-1165
Number of pages45
ISSN1570-0844
DOIs
Publication statusPublished - 13 Dec 2023

Keywords

  • Decentralization
  • Knowledge Graphs
  • Peer-to-Peer
  • Query Optimization
  • RDF
  • SPARQL
  • cardinality estimation
  • data locality
  • query optimization
  • decentralization
  • knowledge graphs

Fingerprint

Dive into the research topics of 'Optimizing SPARQL Queries over Decentralized Knowledge Graphs'. Together they form a unique fingerprint.

Cite this