Fast Neural Ranking on Bipartite Graph Indices
Summary: Introduces BEGIN, a bipartite graph index linking base objects with sampled queries under non-convex, asymmetric neural ranking measures. Extends graph-based ANN search beyond metric assumptions, enabling efficient online neural ranking. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shulong Tan (Baidu)
- 2. Weijie Zhao (Baidu)
- 3. Ping Li (Baidu)
BibTeX Citation
@article{tan_vldb22,
title = {{Fast Neural Ranking on Bipartite Graph Indices}},
author = {Tan, Shulong and Zhao, Weijie and Li, Ping},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {4},
pages = {794--803},
doi = {10.14778/3503585.3503589},
url = {https://doi.org/10.14778/3503585.3503589},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,116 | RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search | 2024 | VLDB | 6.892012e-05 |
| 11,285 | Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous Graphs | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00056760516 |
| 93 | Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph | 2019 | VLDB | 0.00034701237 |
| 1,628 | Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs | 2014 | SIGMOD | 0.00010186757 |
Previous
Page 1 / 1
Next