%0 Journal Article %1 michael2008experimental %A Schmidt, Michael %A Hornung, Thomas %A Küchlin, Norbert %A Lausen, Georg %A Pinkel, Christoph %D 2008 %J The Semantic Web - ISWC 2008 %K semantic verticalpartitioning web %P 82--97 %T An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario %U http://dx.doi.org/10.1007/978-3-540-88564-1_6 %X Efficient RDF data management is one of the cornerstones in realizing the Semantic Web vision. In the past, different RDF storage strategies have been proposed, ranging from simple triple stores to more advanced techniques like clustering or verticalpartitioning on the predicates. We present an experimental comparison of existing storage strategies on top of the SP2Bench SPARQL performance benchmark suite and put the results into context by comparing them to a purely relational model ofthe benchmark scenario. We observe that (1) in terms of performance and scalability, a simple triple store built on top ofa column-store DBMS is competitive to the vertically partitioned approach when choosing a physical (predicate, subject, object)sort order, (2) in our scenario with real-world queries, none of the approaches scales to documents containing tens of millionsof RDF triples, and (3) none of the approaches can compete with a purely relational model. We conclude that future researchis necessary to further bring forward RDF data management.

@article{michael2008experimental, abstract = {Efficient RDF data management is one of the cornerstones in realizing the Semantic Web vision. In the past, different RDF storage strategies have been proposed, ranging from simple triple stores to more advanced techniques like clustering or verticalpartitioning on the predicates. We present an experimental comparison of existing storage strategies on top of the SP2Bench SPARQL performance benchmark suite and put the results into context by comparing them to a purely relational model ofthe benchmark scenario. We observe that (1) in terms of performance and scalability, a simple triple store built on top ofa column-store DBMS is competitive to the vertically partitioned approach when choosing a physical (predicate, subject, object)sort order, (2) in our scenario with real-world queries, none of the approaches scales to documents containing tens of millionsof RDF triples, and (3) none of the approaches can compete with a purely relational model. We conclude that future researchis necessary to further bring forward RDF data management.}, added-at = {2009-10-05T12:45:09.000+0200}, author = {Schmidt, Michael and Hornung, Thomas and Küchlin, Norbert and Lausen, Georg and Pinkel, Christoph}, biburl = {https://www.bibsonomy.org/bibtex/2560bfb762c10a123cdd611db6a265779/joergh}, description = {RDF SPARQL Comparisson}, interhash = {e1802e5abc7dd02affb61d222d6e7a06}, intrahash = {560bfb762c10a123cdd611db6a265779}, journal = {The Semantic Web - ISWC 2008}, keywords = {semantic verticalpartitioning web}, pages = {82--97}, timestamp = {2009-10-05T12:45:09.000+0200}, title = {An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario}, url = {http://dx.doi.org/10.1007/978-3-540-88564-1_6}, year = 2008 }