Back to authors
Tingjian Ge
- Author ID
- u288
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- University of Massachusetts Lowell
- Pagerank
- 0.10021176
- Overall Rank
- 693 | 96.81%
- Paper Count
- 13
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 all 13 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 2,355 |
Answering Aggregation Queries in a Secure System Model |
2007 |
VLDB |
6 |
8.5719834e-05 |
| 2,477 |
One Size Fits All? – Part 2: Benchmarking Results |
2007 |
CIDR |
14 |
8.392837e-05 |
| 3,116 |
Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers |
2009 |
SIGMOD |
9 |
7.6157273e-05 |
| 4,601 |
Event Pattern Matching over Graph Streams |
2015 |
VLDB |
8 |
6.4964963e-05 |
| 6,248 |
Imminence Monitoring of Critical Events: A Representation Learning Approach |
2021 |
SIGMOD |
2 |
5.8194416e-05 |
| 8,314 |
Approximate Substring Matching over Uncertain Strings |
2011 |
VLDB |
3 |
5.3410298e-05 |
| 8,526 |
History is a mirror to the future: Best-effort approximate complex event matching with insufficient resources |
2017 |
VLDB |
3 |
5.3086658e-05 |
| 8,737 |
Online Windowed Subsequence Matching over Probabilistic Sequences |
2012 |
SIGMOD |
2 |
5.2705676e-05 |
| 9,352 |
Stochastic Data Acquisition for Answering Queries as Time Goes by |
2017 |
VLDB |
1 |
5.1755194e-05 |
| 10,022 |
A Skip-list Approach for Efficiently Processing Forecasting Queries |
2008 |
VLDB |
2 |
5.082155e-05 |
| 10,158 |
A*-tree: A Structure for Storage and Modeling of Uncertain Multidimensional Arrays |
2010 |
VLDB |
1 |
5.0597449e-05 |
| 12,147 |
Data Stream Event Prediction Based on Timing Knowledge and State Transitions |
2020 |
VLDB |
0 |
4.9605343e-05 |
| 12,580 |
E-Matching: Event Processing over Noisy Sequences in Real Time |
2013 |
SIGMOD |
0 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.