Not long ago we showed off the new capabilities of GraphDB 2.1 (to be released at the end of 2011) regarding the visualization of data. Now we extended that capabilities and added another Output Plug-In to the Community Edition. It’s called GraphVis.
And you can download it now with our source-code package from our GitHub repository.
The best way to show-off the new functionality is by literally showing it:
A good start for the documentation of the new visualization options is our ever growing wiki.
For many scenarios it’s important to know how a database performs. Especially these days when the number of databases seem to grow by the day and a choice is hard to make.
To demonstrate how sones GraphDB performs at given use-cases we created a benchmark framework and tool which basically divides benchmarking into two steps:
Generate and/or Import use-case specific data and measure the performance
Execute use-case specific algorithms on the graph and measure the performance
Because there are many different use-cases these both steps are made up by plug-ins which can be adressed using the commandline which is integrated into the benchmark tool.
The framework, tool and plug-ins are released as AGPLv3 licensed OpenSource software and can be downloaded here.
We distribute the source code mainly because it’s the best way for you to reproduce the results and take a look at what actually is being tested, the other main cause is that we want everybody to be able to benchmark and test their own algorithms on GraphDB.
Because of the high interest on our CeBit 2010 demo, here some pictures, videos and background information:
Together with UID – a company specialized on user interface design – we created a graph database demo for the Microsoft Surface table. The demo showed the German Corpus based on one million sentences, 812K words and 118K sources and is described in detail here. For the visualization we used our VisualGraph Tool described here. Each day during the CeBit we presented it at MSDN Developer Kino.
More Background information available here, here and here