The document proposes Grafil, a graph similarity search technique that models query graphs as feature sets to filter candidate matches. Grafil indexes feature occurrences and estimates maximum possible feature misses to filter dissimilar graphs. It selects discriminative features and groups them into filters to balance coverage and selectivity. An evaluation on chemical and synthetic graphs shows Grafil outperforms techniques using individual edges or full query graphs as features.