%0 Conference Proceedings
%T Algebra of RDF Graphs for Querying Large-Scale Distributed Triple-Store
%+ University of Primorska
%+ Yahoo! JAPAN Research
%A Savnik, Iztok
%A Nitta, Kiyoshi
%Z Part 1: The International Cross Domain Conference (CD-ARES 2016)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B International Conference on Availability, Reliability, and Security (CD-ARES)
%C Salzburg, Austria
%Y Francesco Buccafurri
%Y Andreas Holzinger
%Y Peter Kieseberg
%Y A Min Tjoa
%Y Edgar Weippl
%I Springer International Publishing
%3 Availability, Reliability, and Security in Information Systems
%V LNCS-9817
%P 3-18
%8 2016-08-31
%D 2016
%R 10.1007/978-3-319-45507-5_1
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%Z TC 5
%Z WG 8.4
%Z WG 8.9
%2 https://inria.hal.science/hal-01635004/document
%2 https://inria.hal.science/hal-01635004/file/430962_1_En_1_Chapter.pdf
%L hal-01635004
%U https://inria.hal.science/hal-01635004
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-9817