PRoST: Distributed Execution of SPARQL Queries Using Mixed Partitioning Strategies
Matteo Cossu, Michael F\"arber, Georg Lausen

TL;DR
PRoST is a distributed RDF store on Apache Spark that combines vertical partitioning and property tables, achieving faster query runtimes without extensive precomputing.
Contribution
It introduces a novel mixed partitioning strategy for RDF data that outperforms existing systems in distributed query processing.
Findings
Outperforms state-of-the-art systems in query runtime
No extensive precomputing required for efficient processing
Effective for a wide range of RDF query types
Abstract
The rapidly growing size of RDF graphs in recent years necessitates distributed storage and parallel processing strategies. To obtain efficient query processing using computer clusters a wide variety of different approaches have been proposed. Related to the approach presented in the current paper are systems built on top of Hadoop HDFS, for example using Apache Accumulo or using Apache Spark. We present a new RDF store called PRoST (Partitioned RDF on Spark Tables) based on Apache Spark. PRoST introduces an innovative strategy that combines the Vertical Partitioning approach with the Property Table, two preexisting models for storing RDF datasets. We demonstrate that our proposal outperforms state-of-the-art systems w.r.t. the runtime for a wide range of query types and without any extensive precomputing phase.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Data Quality and Management · Graph Theory and Algorithms
