Algebra of RDF Graphs for Querying Large-Scale Distributed Triple-Store - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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

(1) , (2)
1
2
Iztok Savnik
  • Function : Author
  • PersonId : 1006208
Kiyoshi Nitta
  • Function : Author
  • PersonId : 1022789

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.
Fichier principal
Vignette du fichier
430962_1_En_1_Chapter.pdf (187.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01635004 , version 1 (14-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
35 View
150 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More