HYBRID IN-MEMORY BFS-DFS APPROACH FOR COMPUTING GRAPH QUERIES INVOLVING COMPLEX PATH PATTERNS INCLUDING TREES AND CYCLES INSIDE RELATIONAL DATABASE SYSTEMS

摘要

An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.