Graph search is an important research topic with many applications. Because of the hardness of subgraph isomorphism, current approaches follow the filter-and-verification paradigm, where indexes play the main role. In this talk, I will be focusing on the existing indexing approaches especially the feature-based ones, highlighting their strengths and weakness and presenting our contributions.