liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Cost Model to Optimize Queries over Heterogeneous Federations of RDF Data Sources
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-4363-0654
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-1741-2090
2023 (English)In: Joint Proceedings of the ESWC 2023 Workshops and Tutorials co-located with 20th European Semantic Web Conference (ESWC 2023), 2023Conference paper, Published paper (Refereed)
Abstract [en]

Federated processing of queries over RDF data sources offers significant potential when a SPARQL query cannot be answered by a single data source alone. However, finding efficient plans to execute a queryover a federation is challenging, especially if different federation members provide different types of data access interfaces. Different interfaces imply different request types, different forms of responses, and different physical algorithms that can be used, each of which consumes varying amounts of resources during query execution. This heterogeneity poses additional obstacles to the task of planning query executions, in addition to the inherent complexity arising from numerous possible join orderings andvarious physical algorithms. As a first step to address these challenges, we propose a cost model that captures the resource requirements of different operators depending on the type of federation member,allowing us to estimate cost of a given query execution plan without actually executing it. To evaluate our approach, we conduct experiments on FedBench with our cost model and compare it to the current state-of-the-art approach to query planning for heterogeneous federations of RDF data sources.

Place, publisher, year, edition, pages
2023.
Series
CEUR Workshop Proceedings, E-ISSN 1613-0073 ; 3443
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-198001OAI: oai:DiVA.org:liu-198001DiVA, id: diva2:1799183
Conference
1st International Workshop on Data Management for Knowledge Graphs (DMKG), colocated with ESWC, Hersonissos, Greece, May 28-29, 2023
Funder
Swedish Research Council, 2019-05655CUGS (National Graduate School in Computer Science)Available from: 2023-09-21 Created: 2023-09-21 Last updated: 2024-11-25Bibliographically approved

Open Access in DiVA

fulltext(513 kB)95 downloads
File information
File name FULLTEXT01.pdfFile size 513 kBChecksum SHA-512
400abc14f9c56930361e8e317886a9d4ecc346be998eeb6f715d072bc3e1da3b3f3d2af06a95c6af416e2d9de78738dede4152e3606ab3500e77bbe8161365ae
Type fulltextMimetype application/pdf

Other links

Paper from publisher

Authority records

Cheng, SijinHartig, Olaf

Search in DiVA

By author/editor
Cheng, SijinHartig, Olaf
By organisation
Database and information techniquesFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 98 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 235 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf