Download now Free registration required
It is increasingly common to find real-life data represented as networks of labeled, heterogeneous entities. To query these networks, one often needs to identify the matches of a given query graph in a (typically large) network modeled as a target graph. Due to noise and the lack of fixed schema in the target graph, the query graph can substantially differ from its matches in the target graph in both structure and node labels, thus bringing challenges to the graph querying tasks. In this paper, the authors propose NeMa (Network Match), a neighborhood-based subgraph matching technique for querying real-life networks.
- Format: PDF
- Size: 326.03 KB