smart-KG: Partition-Based Linked Data Fragments for Querying Knowledge Graphs. Azzam, A., Polleres, A., Fernandez, J. D., & Acosta, M. Semantic Web – Interoperability, Usability, Applicability (SWJ), 15(5):1791–1835, 2024. ![smart-KG: Partition-Based Linked Data Fragments for Querying Knowledge Graphs [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex RDF and SPARQL provide a uniform way to publish and query billions of triples in open knowledge graphs (KGs) on the Web. Yet, provisioning of a fast, reliable, and responsive live querying solution for open KGs is still hardly possible through SPARQL endpoints alone: while such endpoints provide a remarkable performance for single queries, they typically can not cope with highly concurrent query workloads by multiple clients. To mitigate this, the Linked Data Fragments (LDF) framework sparked the design of different alternative low-cost interfaces such as Triple Pattern Fragments (TPF), that partially offload the query processing workload to the client side. On the downside, such interfaces still come with the expense of unnecessarily high network load due to the necessary transfer of intermediate results to the client, leading to query performance degradation compared with endpoints. To address this problem, in the present work, we investigate alternative interfaces, refining and extending the original TPF idea, which also aims at reducing server-resource consumption, by shipping query-relevant partitions of KGs from the server to the client. To this end, first, we align formal definitions and notations of the original LDF framework to uniformly present existing LDF implements and such “partition-based” LDF approaches. These novel LDF interfaces retrieve, instead of the exact triples matching a particular query pattern, a subset of pre-materialized, compressed, partitions of the original graph, containing all answers to a query pattern, to be further evaluated on the client side. As a concrete representative of partition-based LDF, we present smart-KG+, extending and refining our prior work [1] in several respects. Our proposed approach is a step forward towards a better-balanced share of the query processing load between clients and servers by shipping graph partitions driven by the structure of RDF graphs to group entities described with the same sets of properties and classes, resulting in significant data transfer reduction. Our experiments demonstrate that the smart-KG+ significantly outperforms existing Web SPARQL interfaces on both pre-existing benchmarks for highly concurrent query execution as well as an accustomed query workload inspired by query logs of existing SPARQL endpoints.
@article{azza-etal-2024SWJ,
author = {Amr Azzam and Axel Polleres and Javier D. Fernandez and Maribel Acosta},
title = {{smart-KG}: Partition-Based Linked Data Fragments for Querying Knowledge Graphs},
journal = SWJ,
volume = 15,
number = 5,
pages = {1791--1835},
doi = {10.3233/SW-243571},
year = 2024,
abstract = {RDF and SPARQL provide a uniform way to publish and query billions of triples in open knowledge graphs (KGs) on the Web. Yet, provisioning of a fast, reliable, and responsive live querying solution for open KGs is still hardly possible through SPARQL endpoints alone: while such endpoints provide a remarkable performance for single queries, they typically can not cope with highly concurrent query workloads by multiple clients. To mitigate this, the Linked Data Fragments (LDF) framework sparked the design of different alternative low-cost interfaces such as Triple Pattern Fragments (TPF), that partially offload the query processing workload to the client side. On the downside, such interfaces still come with the expense of unnecessarily high network load due to the necessary transfer of intermediate results to the client, leading to query performance degradation compared with endpoints. To address this problem, in the present work, we investigate alternative interfaces, refining and extending the original TPF idea, which also aims at reducing server-resource consumption, by shipping query-relevant partitions of KGs from the server to the client. To this end, first, we align formal definitions and notations of the original LDF framework to uniformly present existing LDF implements and such “partition-based” LDF approaches. These novel LDF interfaces retrieve, instead of the exact triples matching a particular query pattern, a subset of pre-materialized, compressed, partitions of the original graph, containing all answers to a query pattern, to be further evaluated on the client side. As a concrete representative of partition-based LDF, we present smart-KG+, extending and refining our prior work [1] in several respects. Our proposed approach is a step forward towards a better-balanced share of the query processing load between clients and servers by shipping graph partitions driven by the structure of RDF graphs to group entities described with the same sets of properties and classes, resulting in significant data transfer reduction. Our experiments demonstrate that the smart-KG+ significantly outperforms existing Web SPARQL interfaces on both pre-existing benchmarks for highly concurrent query execution as well as an accustomed query workload inspired by query logs of existing SPARQL endpoints.},
url = {https://www.semantic-web-journal.net/content/smart-kg-partition-based-linked-data-fragments-querying-knowledge-graphs-1},
}
Downloads: 0
{"_id":"EftT2MgzqFHzYnbgT","bibbaseid":"azzam-polleres-fernandez-acosta-smartkgpartitionbasedlinkeddatafragmentsforqueryingknowledgegraphs-2024","author_short":["Azzam, A.","Polleres, A.","Fernandez, J. D.","Acosta, M."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Amr"],"propositions":[],"lastnames":["Azzam"],"suffixes":[]},{"firstnames":["Axel"],"propositions":[],"lastnames":["Polleres"],"suffixes":[]},{"firstnames":["Javier","D."],"propositions":[],"lastnames":["Fernandez"],"suffixes":[]},{"firstnames":["Maribel"],"propositions":[],"lastnames":["Acosta"],"suffixes":[]}],"title":"smart-KG: Partition-Based Linked Data Fragments for Querying Knowledge Graphs","journal":"Semantic Web – Interoperability, Usability, Applicability (SWJ)","volume":"15","number":"5","pages":"1791–1835","doi":"10.3233/SW-243571","year":"2024","abstract":"RDF and SPARQL provide a uniform way to publish and query billions of triples in open knowledge graphs (KGs) on the Web. Yet, provisioning of a fast, reliable, and responsive live querying solution for open KGs is still hardly possible through SPARQL endpoints alone: while such endpoints provide a remarkable performance for single queries, they typically can not cope with highly concurrent query workloads by multiple clients. To mitigate this, the Linked Data Fragments (LDF) framework sparked the design of different alternative low-cost interfaces such as Triple Pattern Fragments (TPF), that partially offload the query processing workload to the client side. On the downside, such interfaces still come with the expense of unnecessarily high network load due to the necessary transfer of intermediate results to the client, leading to query performance degradation compared with endpoints. To address this problem, in the present work, we investigate alternative interfaces, refining and extending the original TPF idea, which also aims at reducing server-resource consumption, by shipping query-relevant partitions of KGs from the server to the client. To this end, first, we align formal definitions and notations of the original LDF framework to uniformly present existing LDF implements and such “partition-based” LDF approaches. These novel LDF interfaces retrieve, instead of the exact triples matching a particular query pattern, a subset of pre-materialized, compressed, partitions of the original graph, containing all answers to a query pattern, to be further evaluated on the client side. As a concrete representative of partition-based LDF, we present smart-KG+, extending and refining our prior work [1] in several respects. Our proposed approach is a step forward towards a better-balanced share of the query processing load between clients and servers by shipping graph partitions driven by the structure of RDF graphs to group entities described with the same sets of properties and classes, resulting in significant data transfer reduction. Our experiments demonstrate that the smart-KG+ significantly outperforms existing Web SPARQL interfaces on both pre-existing benchmarks for highly concurrent query execution as well as an accustomed query workload inspired by query logs of existing SPARQL endpoints.","url":"https://www.semantic-web-journal.net/content/smart-kg-partition-based-linked-data-fragments-querying-knowledge-graphs-1","bibtex":"@article{azza-etal-2024SWJ,\nauthor = {Amr Azzam and Axel Polleres and Javier D. Fernandez and Maribel Acosta},\ntitle = {{smart-KG}: Partition-Based Linked Data Fragments for Querying Knowledge Graphs},\njournal = SWJ,\nvolume = 15,\nnumber = 5,\npages = {1791--1835},\ndoi = {10.3233/SW-243571},\nyear = 2024,\nabstract = {RDF and SPARQL provide a uniform way to publish and query billions of triples in open knowledge graphs (KGs) on the Web. Yet, provisioning of a fast, reliable, and responsive live querying solution for open KGs is still hardly possible through SPARQL endpoints alone: while such endpoints provide a remarkable performance for single queries, they typically can not cope with highly concurrent query workloads by multiple clients. To mitigate this, the Linked Data Fragments (LDF) framework sparked the design of different alternative low-cost interfaces such as Triple Pattern Fragments (TPF), that partially offload the query processing workload to the client side. On the downside, such interfaces still come with the expense of unnecessarily high network load due to the necessary transfer of intermediate results to the client, leading to query performance degradation compared with endpoints. To address this problem, in the present work, we investigate alternative interfaces, refining and extending the original TPF idea, which also aims at reducing server-resource consumption, by shipping query-relevant partitions of KGs from the server to the client. To this end, first, we align formal definitions and notations of the original LDF framework to uniformly present existing LDF implements and such “partition-based” LDF approaches. These novel LDF interfaces retrieve, instead of the exact triples matching a particular query pattern, a subset of pre-materialized, compressed, partitions of the original graph, containing all answers to a query pattern, to be further evaluated on the client side. As a concrete representative of partition-based LDF, we present smart-KG+, extending and refining our prior work [1] in several respects. Our proposed approach is a step forward towards a better-balanced share of the query processing load between clients and servers by shipping graph partitions driven by the structure of RDF graphs to group entities described with the same sets of properties and classes, resulting in significant data transfer reduction. Our experiments demonstrate that the smart-KG+ significantly outperforms existing Web SPARQL interfaces on both pre-existing benchmarks for highly concurrent query execution as well as an accustomed query workload inspired by query logs of existing SPARQL endpoints.},\nurl = {https://www.semantic-web-journal.net/content/smart-kg-partition-based-linked-data-fragments-querying-knowledge-graphs-1},\n}\n\n\n\n","author_short":["Azzam, A.","Polleres, A.","Fernandez, J. D.","Acosta, M."],"key":"azza-etal-2024SWJ","id":"azza-etal-2024SWJ","bibbaseid":"azzam-polleres-fernandez-acosta-smartkgpartitionbasedlinkeddatafragmentsforqueryingknowledgegraphs-2024","role":"author","urls":{"Paper":"https://www.semantic-web-journal.net/content/smart-kg-partition-based-linked-data-fragments-querying-knowledge-graphs-1"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"www.polleres.net/mypublications.bib","dataSources":["gixxkiKt6rtWGoKSh"],"keywords":[],"search_terms":["smart","partition","based","linked","data","fragments","querying","knowledge","graphs","azzam","polleres","fernandez","acosta"],"title":"smart-KG: Partition-Based Linked Data Fragments for Querying Knowledge Graphs","year":2024}