摘要
在对图形数据库中的几种有代表性的传统相似性搜索及索引构造方法进行总结分析的基础上,探讨了近似图包含搜索区别于传统相似性搜索的特征,并且提出了一种针对近似图包含搜索的基于覆盖率和支持度对频繁子模式进行筛选的索引构造算法。实验结果验证了该方法的有效性。
Based on profound analysis and conclusion of several typical indexing strategies towards traditional search, the unique characteristics of similar graph containment search was discussed and a coverage and support based frequent pattern filtering approach for constructing index for this kind of search was proposed as well. Experimental results show this approach is effective.
出处
《计算机应用》
CSCD
北大核心
2008年第10期2548-2552,共5页
journal of Computer Applications
基金
重庆市自然科学基金资助项目(CSTC
2007BB2178)
关键词
子图同构
频繁子图
近似图包含搜索
覆盖率
subgraph isomorphism
frequent subgraph
similar graph containment search
coverage ratio