Dingheng Mo

Orcid: 0000-0002-9588-1036

According to our database1, Dingheng Mo authored at least 12 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice.
Proc. ACM Manag. Data, June, 2025

LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search.
CoRR, May, 2025

Aster: Enhancing LSM-structures for Scalable Graph Database.
Proc. ACM Manag. Data, February, 2025

2024
Scalable decoupling graph neural network with feature-oriented optimization.
VLDB J., May, 2024

Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in a Colossal Configuration Space.
Proc. ACM Manag. Data, 2024

Personalized PageRanks over Dynamic Graphs - The Case for Optimizing Quality of Service.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023
Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads.
Proc. ACM Manag. Data, September, 2023

Single-Source Personalized PageRanks With Workload Robustness.
IEEE Trans. Knowl. Data Eng., June, 2023

Example Searcher: A Spatial Query System via Example.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization.
Proc. VLDB Endow., 2022

VC-Tune: Tuning and Exploring Distributed Vertex-Centric Graph Systems.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Agenda: Robust Personalized PageRanks in Evolving Graphs.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021


  Loading...