Back to authors
Chao Tian
- Author ID
- 17913
- ORCID
-
-
- Most Frequent Institution
- Alibaba
- Pagerank
- 0.12876735
- Overall Rank
- 445 | 97.91%
- Paper Count
- 17
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 17 of 17 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 444 |
Parallelizing Sequential Graph Computations |
2017 |
SIGMOD |
0.00022987918 |
| 3,287 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
7.2739447e-05 |
| 3,394 |
Incremental Graph Computations: Doable and Undoable |
2017 |
SIGMOD |
7.1480446e-05 |
| 3,694 |
Keys for Graphs |
2015 |
VLDB |
6.8345712e-05 |
| 5,292 |
Incrementalizing Graph Algorithms |
2021 |
SIGMOD |
5.5816687e-05 |
| 6,193 |
Incrementalization of Graph Partitioning Algorithms |
2020 |
VLDB |
5.1632545e-05 |
| 6,690 |
Parallel Discrepancy Detection and Incremental Detection |
2021 |
VLDB |
4.9621556e-05 |
| 7,287 |
Discovering Association Rules from Big Graphs |
2022 |
VLDB |
4.7762276e-05 |
| 7,641 |
Extending Graph Patterns with Conditions |
2020 |
SIGMOD |
4.6902655e-05 |
| 8,133 |
Towards Event Prediction in Temporal Graphs |
2022 |
VLDB |
4.5784634e-05 |
| 8,211 |
Capturing Associations in Graphs |
2020 |
VLDB |
4.5581054e-05 |
| 8,422 |
Deducing Certain Fixes to Graphs |
2019 |
VLDB |
4.5167705e-05 |
| 9,487 |
Making It Tractable to Catch Duplicates and Conflicts in Graphs |
2023 |
SIGMOD |
4.3341665e-05 |
| 9,564 |
Catching Numeric Inconsistencies in Graphs |
2018 |
SIGMOD |
4.3254416e-05 |
| 9,802 |
Automating Incremental Graph Processing with Flexible Memoization |
2021 |
VLDB |
4.2807806e-05 |
| 11,001 |
Capturing More Associations by Referencing External Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,209 |
Enriching Recommendation Models with Logic Conditions |
2023 |
SIGMOD |
4.1945683e-05 |
Frequent Co-authors
Co-authored at least 5 papers.