Efficient index-free SimRank similarity search in large graphs by discounting path lengths

作者：

Highlights：

• The proposed approach supports fast query processing without preprocessing.

• A pruning algorithm is developed for further speeding up fast query processing.

• The computation time of query processing is further reduced by setting a threshold.

• Experiments on real datasets demonstrate the performance of the proposed approach.

摘要

•The proposed approach supports fast query processing without preprocessing.•A pruning algorithm is developed for further speeding up fast query processing.•The computation time of query processing is further reduced by setting a threshold.•Experiments on real datasets demonstrate the performance of the proposed approach.

论文关键词：Graph,Similarity search,SimRank,Index-free algorithm

论文评审过程：Received 24 February 2021, Revised 29 March 2022, Accepted 1 June 2022, Available online 15 June 2022, Version of Record 22 June 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.117746