While being eminently useful in a wide variety of application domains, the high expressiveness of graph queries makes them hard to optimize and, hence, challenging to process efficiently. We discuss a number of state-of-the-art approaches which aim to overcome these challenges, focusing specifically on planning, optimization, and execution of two commonly used types of declarative graph queries: subgraph queries and regular path queries.
|Title of host publication||Encyclopedia of Big Data Technologies|
|Editors||Sherif Sakr, Albert Y. Zomaya|
|Place of Publication||Berlin|
|Number of pages||9|
|Publication status||Published - 20 Feb 2019|