Using LDBC-SPB to Find OWLIM (GraphDB™) Performance Issues

ldbc_logoThe Ontotext GraphDB™ (formerly OWLIM) development team integrated the LDBC Semantic Publishing Benchmark (LDBC-SPB) into the development and release process. In this blog post, available on the Linked Data Benchmark Council website, Ontotext staffer Venelin Kotsev describes the benchmark parameters that the team used and the performance results.  Two different local hardware configurations were benchmarked with differing CPUs, memory and storage configurations (SSD vs HDD).  In addition, benchmark results were produced for two Amazon EC2 instances with differing CPUs and SSD storage capabilities.  Full details and the benchmark results can be found on LDBCouncil.org.

Milena Yankova

Milena Yankova

Director Global Marketing at Ontotext
A bright lady with a PhD in Computer Science, Milena's path started in the role of a developer, passed through project and quickly led her to product management.For her a constant source of miracles is how technology supports and alters our behaviour, engagement and social connections.
Milena Yankova

Related Posts

  • Introduction to Linked Data and the Semantic Web Online Course

    How the Self-Service Semantic Suite Is Helping a Linked Data MOOC

    An “Introduction to Linked Data & the Semantic Web” MOOC On Apr 11th the University of Southampton started a new MOOC called “Introduction to Linked Data and the Semantic Web”. The MOOC is free to attend, and…

  • GraphDB - a semantic graph database

    Choosing the Right Graph Database for Your Project

    Back in February we had a webinar on the topic of “Choosing the right graph database for your project”. The purpose of the webinar was to: Outline typical advantages of graph databases (and semantic graph databases in…

  • thinking outside the table slide presentation

    Thinking Outside the Table

    Outside the tables there lie another paths which enable managing highly connected data, working with complex queries and having readily available relationships, without the need to express them explicitly. These are the paths of a graph database.

Back to top