| How good are query optimizers, really? V Leis, A Gubichev, A Mirchev, P Boncz, A Kemper, T Neumann Proceedings of the VLDB Endowment 9 (3), 204-215, 2015 | 779 | 2015 |
| The LDBC social network benchmark: Interactive workload O Erling, A Averbuch, J Larriba-Pey, H Chafi, A Gubichev, A Prat, ... Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015 | 371 | 2015 |
| Fast and accurate estimation of shortest paths in large graphs A Gubichev, S Bedathur, S Seufert, G Weikum Proceedings of the 19th ACM international conference on Information and …, 2010 | 231 | 2010 |
| Query optimization through the looking glass, and what we found running the join order benchmark V Leis, B Radke, A Gubichev, A Mirchev, P Boncz, A Kemper, T Neumann The VLDB Journal 27, 643-668, 2018 | 189 | 2018 |
| Cardinality Estimation Done Right: Index-Based Join Sampling. V Leis, B Radke, A Gubichev, A Kemper, T Neumann Cidr, 2017 | 179 | 2017 |
| Exploiting the query structure for efficient join ordering in SPARQL queries. A Gubichev, T Neumann EDBT 14, 439-450, 2014 | 107 | 2014 |
| Sparqling kleene: fast property paths in RDF-3X A Gubichev, SJ Bedathur, S Seufert First International Workshop on Graph Data Management Experiences and …, 2013 | 64 | 2013 |
| The LDBC social network benchmark R Angles, JB Antal, A Averbuch, A Birler, P Boncz, M Búr, O Erling, ... arXiv preprint arXiv:2001.02299, 2020 | 57 | 2020 |
| Path Query Processing on Very Large RDF Graphs. A Gubichev, T Neumann WebDB, 2011 | 42 | 2011 |
| Graph pattern matching: do we have to reinvent the wheel? A Gubichev, M Then Proceedings of Workshop on GRAph Data management Experiences and Systems, 1-7, 2014 | 41 | 2014 |
| The linked data benchmark council project P Boncz, I Fundulaki, A Gubichev, J Larriba-Pey, T Neumann Datenbank-Spektrum 13, 121-129, 2013 | 34 | 2013 |
| F1 query: Declarative querying at scale B Samwel, J Cieslewicz, B Handy, J Govig, P Venetis, C Yang, K Peters, ... Proceedings of the VLDB Endowment 11 (12), 1835-1848, 2018 | 31 | 2018 |
| Fast approximation of steiner trees in large graphs A Gubichev, T Neumann Proceedings of the 21st ACM international conference on Information and …, 2012 | 28 | 2012 |
| Query processing and optimization in graph databases A Gubichev Technische Universität München, 2015 | 26 | 2015 |
| Parameter curation for benchmark queries A Gubichev, P Boncz Performance Characterization and Benchmarking. Traditional to Big Data: 6th …, 2015 | 23 | 2015 |
| Some thoughts on OWL-empowered SPARQL query optimization V Papakonstantinou, G Flouris, I Fundulaki, A Gubichev The Semantic Web: ESWC 2016 Satellite Events, Heraklion, Crete, Greece, May …, 2016 | 3 | 2016 |
| Hochperformante analyse von graph-datenbanken M Kaufmann, T Mühlbauer, M Then, A Gubichev, A Kemper, T Neumann Gesellschaft für Informatik eV, 2015 | 2 | 2015 |
| Efficient Computation of Relationship-Centrality in Large Entity-Relationship Graphs. S Seufert, SJ Bedathur, J Hoffart, A Gubichev, K Berberich ISWC (Posters & Demos), 265-268, 2013 | 1 | 2013 |
| Online-routing on the butterfly network: probabilistic analysis A Gubichev | 1 | 2008 |
| How to generate query parameters in RDF benchmarks? A Gubichev, R Angles, P Boncz 2014 IEEE 30th International Conference on Data Engineering Workshops, 272-274, 2014 | | 2014 |
