Dear all, in the context of the Linked Data Benchmark Council project (http://www.ldbc.eu), benchmarks for graph and RDF databases will be proposed to the community. The benchmarks in current design are oriented to the applications domains of social network analysis and semantic publishing. If anyone is interested in the evaluation of features that must be supported by graph and RDF databases, in particular queries with high execution complexity (e.g., recursive queries), uses-cases and recommendations are welcome.
Best regards, Renzo Angles Postdoc, Vrije University Amsterdam Assistent Professor, Universidad de Talca (Chile)
