Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/15574
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Spasić, Mirko | en_US |
dc.contributor.author | Jovanovik, Milos | en_US |
dc.date.accessioned | 2021-12-02T11:28:22Z | - |
dc.date.available | 2021-12-02T11:28:22Z | - |
dc.date.issued | 2017-10 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12188/15574 | - |
dc.description.abstract | The Mighty Storage Challenge (MOCHA) aims to test the performance of solutions for SPARQL processing, in several aspects relevant for modern Linked Data applications. Virtuoso, by OpenLink Software, is a modern enterprise-grade solution for data access, integration, and relational database management, which provides a scalable RDF Quad Store. In this paper, we present a short overview of Virtuoso with a focus on RDF triple storage and SPARQL query execution. Furthermore, we showcase the final results of the MOCHA 2017 challenge and its tasks, along with a comparison between the performance of our system and the other participating systems. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer International Publishing | en_US |
dc.subject | Virtuoso | en_US |
dc.subject | Social Network Benchmark | en_US |
dc.subject | Benchmarking | en_US |
dc.subject | Mighty Storage Challenge | en_US |
dc.subject | MOCHA | en_US |
dc.subject | Data Storage | en_US |
dc.subject | Linked Data | en_US |
dc.subject | RDF | en_US |
dc.subject | SPARQL | en_US |
dc.title | MOCHA 2017 as a Challenge for Virtuoso | en_US |
dc.type | Book chapter | en_US |
dc.type | Proceeding article | en_US |
dc.relation.conference | Semantic Web Challenges | en_US |
dc.relation.conference | ESWC 2017 | en_US |
dc.identifier.doi | 10.1007/978-3-319-69146-6_3 | - |
dc.identifier.url | http://link.springer.com/content/pdf/10.1007/978-3-319-69146-6_3 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Faculty of Computer Science and Engineering | - |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.