Andrey Gubichev

According to our database1, Andrey Gubichev authored at least 20 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
The LDBC Social Network Benchmark.
CoRR, 2020

2018
Query optimization through the looking glass, and what we found running the Join Order Benchmark.
VLDB J., 2018

F1 Query: Declarative Querying at Scale.
Proc. VLDB Endow., 2018

2017
Cardinality Estimation Done Right: Index-Based Join Sampling.
Proceedings of the 8th Biennial Conference on Innovative Data Systems Research, 2017

2016
Some Thoughts on OWL-Empowered SPARQL Query Optimization.
Proceedings of the Semantic Web - ESWC 2016 Satellite Events, Heraklion, Crete, Greece, May 29, 2016

2015
Query Processing and Optimization in Graph Databases.
PhD thesis, 2015

How Good Are Query Optimizers, Really?
Proc. VLDB Endow., 2015

The LDBC Social Network Benchmark: Interactive Workload.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Hochperformante Analyse von Graph-Datenbanken.
Proceedings of the Datenbanksysteme für Business, 2015

2014
Parameter Curation for Benchmark Queries.
Proceedings of the Performance Characterization and Benchmarking. Traditional to Big Data, 2014

Graph Pattern Matching - Do We Have to Reinvent the Wheel?
Proceedings of the Second International Workshop on Graph Data Management Experiences and Systems, 2014

How to generate query parameters in RDF benchmarks?
Proceedings of the Workshops Proceedings of the 30th International Conference on Data Engineering Workshops, 2014

Exploiting the query structure for efficient join ordering in SPARQL queries.
Proceedings of the 17th International Conference on Extending Database Technology, 2014

Efficient Query Processing in RDF Databases.
Proceedings of the Linked Data Management., 2014

2013
The Linked Data Benchmark Council Project.
Datenbank-Spektrum, 2013

Sparqling kleene: fast property paths in RDF-3X.
Proceedings of the First International Workshop on Graph Data Management Experiences and Systems, 2013

Efficient Computation of Relationship-Centrality in Large Entity-Relationship Graphs.
Proceedings of the ISWC 2013 Posters & Demonstrations Track, 2013

2012
Fast approximation of steiner trees in large graphs.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Path Query Processing on Very Large RDF Graphs.
Proceedings of the 14th International Workshop on the Web and Databases 2011, 2011

2010
Fast and accurate estimation of shortest paths in large graphs.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010


  Loading...