Algebra of RDF Graphs for Querying Large-Scale Distributed Triple-Store

Abstract : Large-scale RDF graph databases stored in shared-nothing clusters require query processing engine that can effectively exploit highly parallel computation environment. We propose algebra of RDF graphs and its physical counterpart, physical algebra of RDF graphs, designed to implement queries as distributed dataflow programs that run on cluster of servers. Operations of algebra reflect the characteristic features of RDF graph data model while they are tied to the technology provided by relational query execution systems. Algebra of RDF graphs allows for the expression of pipelined and partitioned parallelism. Preliminary experimental results show that proposed algebra and architecture of query execution system scale well with large clusters of data servers.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01635004
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 14, 2017 - 4:06:27 PM
Last modification on : Wednesday, November 15, 2017 - 1:15:13 AM
Long-term archiving on : Thursday, February 15, 2018 - 2:25:14 PM

File

430962_1_En_1_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Iztok Savnik, Kiyoshi Nitta. Algebra of RDF Graphs for Querying Large-Scale Distributed Triple-Store. International Conference on Availability, Reliability, and Security (CD-ARES), Aug 2016, Salzburg, Austria. pp.3-18, ⟨10.1007/978-3-319-45507-5_1⟩. ⟨hal-01635004⟩

Share

Metrics

Record views

49

Files downloads

31