Query optimization through the looking glass, and what we found running the Join Order Benchmark. | 5 | 0.41 | 2018 |
Cardinality Estimation Done Right: Index-Based Join Sampling. | 8 | 0.51 | 2017 |
How Good Are Query Optimizers, Really? | 0 | 0.34 | 2016 |
Some Thoughts on OWL-Empowered SPARQL Query Optimization. | 1 | 0.34 | 2016 |
How Good Are Query Optimizers, Really? | 57 | 1.56 | 2015 |
Hochperformante Analyse von Graph-Datenbanken. | 1 | 0.37 | 2015 |
The LDBC Social Network Benchmark: Interactive Workload | 65 | 2.28 | 2015 |
Exploiting the query structure for efficient join ordering in SPARQL queries. | 16 | 0.68 | 2014 |
Graph Pattern Matching: Do We Have to Reinvent the Wheel? | 8 | 0.52 | 2014 |
How to generate query parameters in RDF benchmarks? | 0 | 0.34 | 2014 |
The Linked Data Benchmark Council Project. | 8 | 0.54 | 2013 |
Efficient Computation of Relationship-Centrality in Large Entity-Relationship Graphs. | 1 | 0.35 | 2013 |
Sparqling kleene: fast property paths in RDF-3X | 3 | 0.42 | 2013 |
Fast approximation of steiner trees in large graphs | 3 | 0.39 | 2012 |
Path Query Processing on Very Large RDF Graphs. | 10 | 0.69 | 2011 |
Fast and accurate estimation of shortest paths in large graphs | 77 | 2.17 | 2010 |