Factorization Matters in Large Graphs

Nikolay Yakovets (TU/e)

Evaluation of complex graph pattern queries on large graphs often leads to “explosion” of intermediate results (IR) which, in turn, considerably slows down query processing. In this talk, I will present WireFrame, our recent two-step factorization-based solution which aims to drastically reduce the IR during query processing. This technique is one of many graph-oriented optimization strategies implemented in the upcoming AvantGraph graph query processing engine (http://avantgraph.io).

Nikolay Yakovets is an Assistant Professor at the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). His main area of study is databases and data intensive systems. His current focus is on design and implementation of core database technologies, management of massive graph data, and efficient processing of queries on graphs.

Slides