Back to authors
Chao Tian
- Author ID
- 17917
- ORCID
-
-
- Links
-
(found by gpt-5.6-terra on jul 09 2026)
- Most Frequent Institution
- Alibaba
- Pagerank
- 0.11583318
- Overall Rank
- 521 | 97.51%
- Paper Count
- 15
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 15 of 15 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 441 |
Parallelizing Sequential Graph Computations |
2017 |
SIGMOD |
0.00023172424 |
| 2,728 |
Keys for Graphs |
2015 |
VLDB |
8.2228869e-05 |
| 3,287 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
7.2689944e-05 |
| 3,439 |
Incremental Graph Computations: Doable and Undoable |
2017 |
SIGMOD |
7.0916563e-05 |
| 5,266 |
Incrementalizing Graph Algorithms |
2021 |
SIGMOD |
5.5949839e-05 |
| 6,195 |
Incrementalization of Graph Partitioning Algorithms |
2020 |
VLDB |
5.1583102e-05 |
| 6,691 |
Parallel Discrepancy Detection and Incremental Detection |
2021 |
VLDB |
4.9573939e-05 |
| 7,566 |
Extending Graph Patterns with Conditions |
2020 |
SIGMOD |
4.7047078e-05 |
| 8,145 |
Capturing Associations in Graphs |
2020 |
VLDB |
4.5724134e-05 |
| 8,363 |
Deducing Certain Fixes to Graphs |
2019 |
VLDB |
4.5311185e-05 |
| 9,489 |
Making It Tractable to Catch Duplicates and Conflicts in Graphs |
2023 |
SIGMOD |
4.3300131e-05 |
| 9,805 |
Automating Incremental Graph Processing with Flexible Memoization |
2021 |
VLDB |
4.2766788e-05 |
| 11,004 |
Capturing More Associations by Referencing External Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,211 |
Enriching Recommendation Models with Logic Conditions |
2023 |
SIGMOD |
4.1905499e-05 |
| 11,711 |
Catching Numeric Inconsistencies in Graphs |
2018 |
SIGMOD |
4.1905499e-05 |
Frequent Co-authors
Co-authored at least 5 papers.