Back to institutions
Massey University
- Overall Rank
- 324 | 88.82%
- Pagerank
- 0.090174677
- Paper Count
- 12
Authors at This Institution
Listed authors are those whose most frequent affiliation is this institution.
Showing 1 of 1 authors.
Papers with at Least One Affiliated Author
Showing 12 of 12 papers, sorted by pagerank.
| Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,168 |
Subgraph Matching: on Compression and Computation
|
2018 |
VLDB |
8.9292584e-05 |
| 4,342 |
Possible and Certain SQL Keys
|
2015 |
VLDB |
6.6478954e-05 |
| 5,897 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
|
2021 |
SIGMOD |
5.952769e-05 |
| 6,411 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks
|
2023 |
SIGMOD |
5.7914609e-05 |
| 7,305 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale
|
2022 |
SIGMOD |
5.5576178e-05 |
| 8,727 |
Multi-valued Dependencies in the Presence of Lists
|
2004 |
PODS |
5.2880532e-05 |
| 9,806 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
|
2025 |
SIGMOD |
5.1233734e-05 |
| 9,976 |
SQL Schema Design: Foundations, Normal Forms, and Normalization
|
2016 |
SIGMOD |
5.1014161e-05 |
| 10,415 |
Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
|
2026 |
SIGMOD |
4.9769913e-05 |
| 11,213 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks
|
2025 |
SIGMOD |
4.9769913e-05 |
| 11,319 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks
|
2025 |
VLDB |
4.9769913e-05 |
| 12,356 |
Range Thresholding on Streams
|
2016 |
SIGMOD |
4.9769913e-05 |