TurboISO: Towards Ultrafast and Robust Subgraph Isomorphism Search

90-minute presentation for the Advanced topics in Data Management course at KAUST, on "Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
" by Wook-Shin Han et al, published in SIGMOD '13.

Transcript

1. TurboISO W.S. Han, J. Lee, J.H. Lee., SIGMOD, 2013. Presented by Emaad Ahmed Manzoor
13. Final recursive routine Q1: Which data vertices should NEC(u') be mapped to? Lemma: Any data vertex NEC(u') matches must be present in all CR(u', V_m_i), V_m_i are the vertices to which NEC(Parent(u')) have been mapped. Show example Q2: How to handle edges between vertices in NEC(u')? If there are edges between NEC(u'), then it is a clique Candidate data vertices must also form a clique