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. 對于給定的查詢(xún)，我們使用這些索引過(guò)濾圖數據庫，得到較小的候選集，減少需要進(jìn)行的高時(shí)間復雜度的子圖同構匹配。
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. 在第二階段中，我們搜尋整個(gè)索引，找出與待查詢(xún)序列的特徵向量之間的距離小于某個(gè)門(mén)檻值的候選子序列。
