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.10036852
- Overall Rank
- 689 | 96.82%
- 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,344 |
Answering Aggregation Queries in a Secure System Model |
2007 |
VLDB |
6 |
8.6004109e-05 |
| 2,478 |
One Size Fits All? – Part 2: Benchmarking Results |
2007 |
CIDR |
14 |
8.4063622e-05 |
| 3,107 |
Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers |
2009 |
SIGMOD |
9 |
7.640909e-05 |
| 4,585 |
Event Pattern Matching over Graph Streams |
2015 |
VLDB |
8 |
6.5156965e-05 |
| 6,237 |
Imminence Monitoring of Critical Events: A Representation Learning Approach |
2021 |
SIGMOD |
2 |
5.8387481e-05 |
| 8,300 |
Approximate Substring Matching over Uncertain Strings |
2011 |
VLDB |
3 |
5.3587491e-05 |
| 8,511 |
History is a mirror to the future: Best-effort approximate complex event matching with insufficient resources |
2017 |
VLDB |
3 |
5.3262778e-05 |
| 8,717 |
Online Windowed Subsequence Matching over Probabilistic Sequences |
2012 |
SIGMOD |
2 |
5.2880532e-05 |
| 9,327 |
Stochastic Data Acquisition for Answering Queries as Time Goes by |
2017 |
VLDB |
1 |
5.1926897e-05 |
| 9,987 |
A Skip-list Approach for Efficiently Processing Forecasting Queries |
2008 |
VLDB |
2 |
5.0989958e-05 |
| 10,121 |
A*-tree: A Structure for Storage and Modeling of Uncertain Multidimensional Arrays |
2010 |
VLDB |
1 |
5.0765311e-05 |
| 12,103 |
Data Stream Event Prediction Based on Timing Knowledge and State Transitions |
2020 |
VLDB |
0 |
4.9769913e-05 |
| 12,537 |
E-Matching: Event Processing over Noisy Sequences in Real Time |
2013 |
SIGMOD |
0 |
4.9769913e-05 |
Frequent Co-authors
Co-authored at least 5 papers.