A Lattice-based Graph Index for Subgraph Search


Given a query graph q, a “subgraph-search” algorithm retrieves from a graph database D all graphs that have q as a subgraph, D(q). Subgraph search is costly because of its involvement of a subgraph-isomorphism test, which is a NPcomplete problem. Graph indexes are used to improve the algorithm efficiency by first filtering out a set of false answers and… (More)

5 Figures and Tables


  • Presentations referencing similar topics