PJsim: Towards Precise and Scalable Graph Similarity
Summary: PJsim eliminates SimRank’s zero-similarity pathology with an exact closed-form formulation as Sylvester equations. Block transformations yield scalable computation, outperforming zero-similarity variants by up to 3.22× while improving accuracy. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Prajjwal Nijhara (Indian Institute of Technology Jodhpur)
- 2. Jainan Tandel (Indian Institute of Technology Jodhpur)
- 3. Rohit Prajapati (Indian Institute of Technology Jodhpur)
- 4. Dip Sankar Banerjee (Indian Institute of Technology Jodhpur)
BibTeX Citation
@inproceedings{nijhara_sigmod26,
title = {{PJsim: Towards Precise and Scalable Graph Similarity}},
author = {Nijhara, Prajjwal and Tandel, Jainan and Prajapati, Rohit and Banerjee, Dip Sankar},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802100},
url = {https://dl.acm.org/doi/10.1145/3802100},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 653 | Accuracy Estimate and Optimization Techniques for SimRank Computation | 2008 | VLDB | 0.00015302705 |
| 758 | Simrank++: Query Rewriting through Link Analysis of the Click Graph | 2008 | VLDB | 0.00014277369 |
| 1,588 | More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks | 2014 | VLDB | 0.0001026895 |
| 1,812 | Efficient SimRank-based Similarity Join Over Large Graphs | 2013 | VLDB | 9.6948178e-05 |
| 2,291 | Efficient Partial-Pairs SimRank Search on Large Networks | 2015 | VLDB | 8.7973939e-05 |
| 3,951 | READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank | 2017 | VLDB | 6.9974506e-05 |
| 4,061 | Efficient Top-K SimRank-based Similarity Join | 2015 | VLDB | 6.9319591e-05 |
| 6,446 | Exact Single-Source SimRank Computation on Large Graphs | 2020 | SIGMOD | 5.8763523e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,826 | Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs | 2020 | VLDB |
| 2 | 1,588 | More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks | 2014 | VLDB |
| 3 | 9,471 | Efficient and Accurate SimRank-based Similarity Joins: Experiments, Analysis, and Improvement | 2024 | VLDB |
| 4 | 2,291 | Efficient Partial-Pairs SimRank Search on Large Networks | 2015 | VLDB |
| 5 | 1,812 | Efficient SimRank-based Similarity Join Over Large Graphs | 2013 | VLDB |
| 6 | 8,303 | Efficient Top-K SimRank-based Similarity Join | 2014 | SIGMOD |
| 7 | 8,212 | PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs | 2019 | SIGMOD |
| 8 | 1,365 | Scalable Similarity Search for SimRank | 2014 | SIGMOD |
| 9 | 6,446 | Exact Single-Source SimRank Computation on Large Graphs | 2020 | SIGMOD |
| 10 | 4,061 | Efficient Top-K SimRank-based Similarity Join | 2015 | VLDB |