Dr. Andrey Gubichev
|
Research Area
- Graph query processing
- Query optimization
- Benchmarking
Publications
- The LDBC Social Network Benchmark: Interactive Workload (pdf) SIGMOD 2015. Melbourne, Australia
- Parameter Curation for Benchmark Queries (pdf) TPCTC 2014. Hangzhou, China
- Graph pattern matching -- do we have to reinvent the wheel? (pdf) GRADES Workshop @ SIGMOD 2014. Snowbird, USA
- Exploiting the query structure for efficient join ordering in SPARQL queries (pdf) EDBT 2014. Athens, Greece
- How to generate query parameters in RDF benchmarks? (pdf) DESWEB Workshop @ ICDE 2014. Chicago, USA
- Sparqling Kleene -- Fast Property Paths in RDF-3X (pdf) GRADES Workshop @ SIGMOD 2013. NYC, USA
- Fast Approximation of Steiner Trees in Large Graphs (pdf) CIKM 2012. Hawaii, USA.
- Path Query Processing on Very Large RDF Graphs (pdf) WebDB 2011. Athens, Greece.
- Fast and Accurate Estimation of Shortest Paths in Large Graphs (pdf) CIKM 2010. Toronto, Canada
Short CV
Education: | |
October 2010 - present | PhD student at the TU München |
September 2004 - July 2009 | Diploma in Computer Science with honors at the School of Mathematics and Mechanics, St.Petersburg University, Russia |
Recent positions: | |
June 2012 - September 2012 | Research Intern at Qatar Computing Research Institute, Doha, Qatar |
June 2010 - September 2010 | Research Intern at Telefonica Research, Barcelona |
October 2009 - April 2010 | Research Intern at the Max-Planck Institute for Informatics, Saarbrücken, Germany |