In the subgraph querying problem, given a query graph and a dataset of graphs, we want to locate which graphs in the dataset contain the query and/or find all its occurrences. Over the years, numerous methods, fragmented in 2 categories, were proposed to tackle the problem. In the first category, methods follow the filter-then-verify (FTV) paradigm where an index is used to filter out graphs th...