Back to authors
Davide Mottin
- Author ID
- 1982
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Aarhus University
- Pagerank
- 0.1145642
- Overall Rank
- 555 | 97.37%
- Paper Count
- 16
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 16 of 16 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 1,897 |
Exemplar Queries: Give me an Example of What You Need |
2014 |
VLDB |
9.5243334e-05 |
| 3,828 |
FREDE: Anytime Graph Embeddings |
2021 |
VLDB |
7.0903874e-05 |
| 4,076 |
A Probabilistic Optimization Framework for the Empty-Answer Problem |
2013 |
VLDB |
6.9221203e-05 |
| 6,200 |
New Trends on Exploratory Methods for Data Analytics |
2017 |
VLDB |
5.9457282e-05 |
| 6,303 |
X2Q: Your Personal Example-based Graph Explorer |
2018 |
VLDB |
5.9213518e-05 |
| 7,837 |
Searching with XQ: the eXemplar Query Search Engine |
2014 |
SIGMOD |
5.5344136e-05 |
| 8,218 |
Sofos: Demonstrating the Challenges of Materialized View Selection on Knowledge Graphs |
2021 |
SIGMOD |
5.4644639e-05 |
| 8,358 |
Exploring the Data Wilderness through Examples |
2019 |
SIGMOD |
5.4446041e-05 |
| 8,520 |
Knowledge Graph Exploration Systems: are we lost? |
2022 |
CIDR |
5.4119882e-05 |
| 8,602 |
Marigold: Efficient k-means Clustering in High Dimensions |
2023 |
VLDB |
5.404485e-05 |
| 10,037 |
Graph Exploration: From Users to Large Graphs |
2017 |
SIGMOD |
5.1729561e-05 |
| 10,246 |
Geld: Load-balanced D-Core Decomposition for Consumer GPUs |
2026 |
SIGMOD |
5.093636e-05 |
| 10,294 |
Sublime: Selecting Subgraph Matching Algorithms via Machine Learning |
2026 |
SIGMOD |
5.093636e-05 |
| 10,538 |
Structural Normalization of Property Graphs |
2026 |
VLDB |
5.093636e-05 |
| 11,075 |
Mix & Match: Subgraph Matching for Absolute Coverage |
2025 |
VLDB |
5.093636e-05 |
| 13,597 |
IQR: An Interactive Query Relaxation System for the Empty-Answer Problem |
2014 |
SIGMOD |
- |
Frequent Co-authors
Co-authored at least 5 papers.