Back to authors
Henning Köhler
- Author ID
- o0000-0002-4688-920X
- ORCID
-
0000-0002-4688-920X
- Links
-
(found by gpt-5.6-luna on jul 26 2026)
- Most Frequent Institution
- Massey University
- Pagerank
- 0.088611992
- Overall Rank
- 799 | 96.32%
- Paper Count
- 12
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 12 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 4,361 |
Possible and Certain SQL Keys |
2015 |
VLDB |
8 |
6.6271978e-05 |
| 5,893 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
6 |
5.9394451e-05 |
| 5,899 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
9 |
5.9376618e-05 |
| 6,609 |
Efficient Parallel Skyline Processing using Hyperplane Projections |
2011 |
SIGMOD |
3 |
5.718077e-05 |
| 6,988 |
Sampling Dirty Data for Matching Attributes |
2010 |
SIGMOD |
3 |
5.6110503e-05 |
| 7,323 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
5 |
5.5392408e-05 |
| 8,695 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
3 |
5.2717835e-05 |
| 10,007 |
SQL Schema Design: Foundations, Normal Forms, and Normalization |
2016 |
SIGMOD |
8 |
5.0845476e-05 |
| 10,481 |
Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 11,271 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
0 |
4.9605343e-05 |
| 11,373 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks |
2025 |
VLDB |
0 |
4.9605343e-05 |
| 11,467 |
Mining Meaningful Keys and Foreign Keys with High Precision and Recall |
2025 |
VLDB |
0 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.