Query Processing and Optimization in Graph Databases
Andrey Gubichev · mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) · 2015
Graph data management has received a lot of attention in the last decade, fueled by rapid development of two vertical domains, Linked Data and Social Media. This thesis deals with the database aspects of graph processing problems in these two domains. We present both the new query processing techniques (e.g., efficient shortest path estimation) and the novel query optimization methods (in particular, for join ordering and cardinality estimation) for a broad range of graph databases.