一种基于双哈希编码的超图集合查询方法

A SUPERGRAPH SET QUERY METHOD BASED ON DOUBLE HASH CODE

图数据查询就是在图数据库中查询出满足查询条件的图数据集,索引的构建和查询算法是影响查询效率的关键因素。为在超图查询过程快速、有效得到被查询图q包含的索引项,提出基于双哈希编码的超图集合查询方法。该方法主要利用双哈希的探查序列,让关键字均匀散列在表中各位置,避免存储过程存在的冲突,实现索引的快速查找。实验结果表明,该方法能够减少候选集生成时间和规模,提高查询效率。

Graph data querying is to check out the graph data set from graph database that satisfying the query conditions.Index construction and query algorithm are the key factors that affect the efficiency of the querying.In order to obtain the index item contained in the graph querying swiftly,we propose an approach for supergraph set query based on double hashing code.This approach mainly uses the search sequence of double hashing to make the Keywords well-distributed in hashtable,which would avoid the collision during the storing process and achieve quick search of index.Experimental results show that this approach can reduce the generation time and scale of candidate set,hence increase the efficiency of query.