• Corpus ID: 17541455

FishMark: A Linked Data Application Benchmark

@inproceedings{Bail2012FishMarkAL,
  title={FishMark: A Linked Data Application Benchmark},
  author={Samantha Bail and Sandra Alkiviadous and Bijan Parsia and David Workman and Mark van Harmelen and Rafael S Gonçalves and Cristina Garilao},
  booktitle={SSWS+HPCSW@ISWC},
  year={2012}
}
FishBase is an important species data collection produced by the FishBase Information and Research Group Inc (FIN), a not-forprofit NGO with the aim of collecting comprehensive information (from the taxonomic to the ecological) about all the world’s finned fish species. FishBase is exposed as a MySQL backed website (supporting a range of canned, although complex queries) and serves over 33 million hits per month. FishDelish is a transformation of FishBase into LinkedData weighing in at 1.38… 

Tables from this paper

The NPD Benchmark for OBDA Systems

This work proposes a novel benchmark for OBDA systems based on the Norwegian Petroleum Directorate (NPD), and comes with novel techniques to generate, from available data, datasets of increasing size, taking into account the requirements dictated by the OBDA setting.

A Scalable Benchmark for OBDA Systems: Preliminary Report

A novel benchmark for OBDA systems based on a real world use-case adopted in the EU project Optique is proposed, and is validated on the system Ontop, showing that it is more adequate than previous benchmarks not tailored for OBda.

WDBench: A Wikidata Graph Query Benchmark

WDBench is proposed: a query benchmark for knowledge graphs based on Wikidata, featuring real-world queries extracted from the public query logs of theWikidata SPARQL endpoint, and performance results for evaluating queries using Blazegraph, Jena/Fuseki, Virtuoso and Neo4j are presented.

The NPD Benchmark: Reality Check for OBDA Systems

A novel benchmark for OBDA systems based on real data coming from the oil industry: the Norwegian Petroleum Directorate (NPD) FactPages is proposed, with novel techniques to generate, from the NPD data, datasets of increasing size, taking into account the requirements dictated by the OBDA setting.

A survey of RDF stores & SPARQL engines for querying knowledge graphs

This survey paper provides a comprehensive review of techniques and systems for querying RDF knowledge graphs, including state-of-the-art storage, indexing and query processing techniques for efficiently evaluating SPARQL queries in a local setting.

Including Co-referent URIs in a SPARQL Query

This paper argues that dataset links should be stored in a stand-off fashion, thus enabling different assumptions to be applied to the data links during query execution and presents the infrastructure developed for the Open PHACTS Discovery Platform to enable this.

When is the Peak Performance Reached? An Analysis of RDF Triple Stores

The authors' experiments revealed the maximum query processing capabilities of well-known triple stores after which point they lead to service shutdowns and it is hoped this analysis will help triple store developers to design workload-aware RDF engines to improve the availability of their public endpoints with high throughput.

ForBackBench: A Benchmark for Chasing vs. Query-Rewriting

Preliminary results show that, indeed, chase can compete and might overcome query rewriting even in the face of large data especially for complex mapping languages.

References

SHOWING 1-10 OF 67 REFERENCES

DBpedia SPARQL Benchmark - Performance Assessment with Real Queries on Real Data

It is argued that a pure SPARQL benchmark is more useful to compare existing triple stores and provide results for the popular triple store implementations Virtuoso, Sesame, Jena-TDB, and BigOWLIM.

SP2Bench: A SPARQL Performance Benchmark

SP^2Bench, a publicly available, language-specific SPARQL performance benchmark, which comprises both a data generator for creating arbitrarily large DBLP-like documents and a set of carefully designed benchmark queries.

The Berlin SPARQL Benchmark

The Berlin SPARQL Benchmark (BSBM) is introduced, built around an e-commerce use case in which a set of products is offered by different vendors and consumers have posted reviews about products, and emulates the search and navigation pattern of a consumer looking for a product.

Quest, an OWL 2 QL Reasoner for Ontology-based Data Access

Quest is presented, a new system for OBDA focused on fast and efficient reasoning with large ontologies and large volumes of data, and uses query rewriting techniques as the inference mechanism in both modes.

Implementing SPARQL Support for Relational Databases and Possible Enhancements

This paper presents the PHP implementation of the SPARQL standard directly interacting with an underlying database system based on the rationale of pushing as much work into the RDBMS as possible in order to profit most from the query optimization techniques developed for relational database systems.

LUBM: A benchmark for OWL knowledge base systems

The Combined Approach to Ontology-Based Data Access

The combined approach is described, which incorporates the information given by the ontology into the data and employs query rewriting to eliminate spurious answers in ontology-based data access.

Towards a Complete OWL Ontology Benchmark

The extended benchmark, named University Ontology Benchmark (UOBM), includes both OWL Lite and OWL DL ontologies covering a complete set of OWLlite and DL constructs, respectively, and adds necessary properties to construct effective instance links and improve instance generation methods to make the scalability testing more convincing.

The DL-Lite Family and Relations

This article carries out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes, by adding the Boolean connectives and number restrictions to concept constructs and adopting or dropping the unique name assumption.

SP^2Bench: A SPARQL Performance Benchmark

SP^2Bench, a publicly available, language-specific SPARQL performance benchmark, which comprises both a data generator for creating arbitrarily large DBLP-like documents and a set of carefully designed benchmark queries.
...