For a given query, we filter the whole graph through the index to get a smaller candidate set.Thus, high time-complexity subgraph isomorphism matching operations are reduced. 對於給定的查詢，我們使用這些索引過濾圖資料庫，得到較小的候選集，減少需要進行的高時間複雜度的子圖同構匹配。
In the second phase, we search the index and extract those candidate blocks whose distance to the feature vector of the query sequence is less than a predefined threshold. 在第二階段中，我們搜尋整個索引，找出與待查詢序列的特徵向量之間的距離小於某個門檻值的候選子序列。
