Efficient SimRank-based similarity join

DOI10.1145/3083899MaRDI QIDQ5012583zbMATH OpenOpenAlexFDO

Authors Weiguo Zheng, Lei Zou, Lei Chen, Dongyan Zhao

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3083899

zbMATH Keywords

index-based computationsimilaritySimRankupper bound

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast top-\(k\) similarity join for SimRank
• A matrix sampling approach for efficient SimRank computation
• Fast, memory-efficient low-rank approximation of SimRank
• SQL-based solution for fast graph similarity search
• Probabilistic SimRank computation over uncertain graphs

Cited in

(7)

• A matrix sampling approach for efficient SimRank computation
• Fast top-\(k\) similarity join for SimRank
• I/O-efficient similarity join
• Fast, memory-efficient low-rank approximation of SimRank
• An uncertain graph oriented SimRank algorithm
• Probabilistic SimRank computation over uncertain graphs
• Method for similarity join on uncertain graph database

This page was built for publication: Efficient SimRank-based similarity join

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012583)