Answering pattern match queries in large graph databases via graph embedding

The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern matching. Among these, a pattern match query is more flexible compared to a subgraph search and more informative compared to a shortest path or a reachability query. In this paper, we address distance-based pattern match queries over a large data graph G. Due to the huge search space, we adopt a filter-and-refine framework to answer a pattern match query over a large graph. We first find a set of candidate matches by a graph embedding technique and then evaluate these to find the exact matches. Extensive experiments confirm the superiority of our method.

• Type: Journal
• Year: 2012
• Where: VLDB
• Authors: Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongyan Zhao
• Keywords: Database, Graph Databases, Search Space, Shortest Path, VLDB 2012