Database and Data Science

[Back to full publication list]

  • 2025:
    [11] Pkd-tree: Parallel kd-tree with Batch Updates (To Appear)
    Ziyang Men, Zheqi Shen, Yan Gu, and Yihan Sun
    SIGMOD
     ACM Special Interest Group on Management of Data (SIGMOD), 2025   
    parallel kdtree for kNN search
    Paper   
  • 2024:
    [10] ParlayANN: Scalable and Deterministic Parallel Graph-Based Algorithms for Approximate Nearest Neighbor Search
    Magdalen Dobson, Zheqi Shen, Guy Blelloch, Laxman Dhulipala, Yan Gu, Harsha Simhadri, and Yihan Sun
    PPoPP
     ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), 2024   
    efficient approximate nearest neighbor search
    Paper   ArXiV  Code  
  • [9] Fast and Space-Efficient Parallel Algorithms for Influence Maximization
    Letong Wang, Xiangyun Ding, Yan Gu, and Yihan Sun
    VLDB
     Proceedings of the VLDB Endowment (VLDB), 2024   
    HOPC
     Poster and oral presentation at the Highlights of Parallel Computing (HOPC@SPAA), 2024
    influence maximization
    Paper   ArXiV  Code  
  • 2023:
    [8] Parallel Strong Connectivity Based on Faster Reachability
    Letong Wang, Xiaojun Dong, Yan Gu, and Yihan Sun
    SIGMOD
     ACM Special Interest Group on Management of Data (SIGMOD), 2023   
    ACDA
     Poster presented at the SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), 2023
    HOPC
     Poster presented at the Highlights of Parallel Computing (HOPC@SPAA), 2023
    efficient SCC
    Paper   ArXiV  Code  Slides  
  • 2022:
    [7] Bi-directional Log-Structured Merge Tree
    Xin Zhang, Qizhong Mao, Ahmed Eldawy, Vagelis Hristidis, and Yihan Sun
    SSDBM
     International Conference on Scientific and Statistical Database Management (SSDBM), 2022   
    LSM tree
    Paper   Video  
  • [6] Parallel Cover Trees and Applications
    Yan Gu, Zachary Napier, Yihan Sun, and Letong Wang
    SPAA
     ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022   
    K-nearest neighbor, agglomerative clustering using parallel cover trees
    Paper   Slides  
  • 2021:
    [5] ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
    Shangdi Yu, Yiqiu Wang, Yan Gu, Laxman Dhulipala, and Julian Shun
    VLDB
     Proceedings of the VLDB Endowment (VLDB), 2021   
    hierarchical agglomerative clustering
    Paper   
  • [4] Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
    Yiqiu Wang, Shangdi Yu, Yan Gu, and Julian Shun
    SIGMOD
     ACM Special Interest Group on Management of Data (SIGMOD), 2021   
    Euclidean MST and hierarchical clustering
    Paper   Video  ArXiV  Code  
  • 2020:
    [3] Theoretically-Efficient and Practical Parallel DBSCAN
    Yiqiu Wang, Yan Gu, and Julian Shun
    SIGMOD
     ACM Special Interest Group on Management of Data (SIGMOD), 2020   
    Density-based clustering
    Paper   Video  ArXiV  Code  Page  
  • 2019:
    [2] On Supporting Efficient Snapshot Isolation for Hybrid Workloads with Multi-Versioned Indexes
    Yihan Sun, Guy E. Blelloch, Wan Shen Lim, and Andrew Pavlo
    VLDB
     Proceedings of the VLDB Endowment (VLDB), 2019   
    Using P-trees for in-memory database systems
    Paper   Video  Code  
  • 2013:
    [1] Influence Maximization in Dynamic Social Networks
    Honglei Zhuang, Yihan Sun, Jie Tang, Zhang Jialin, and Xiaoming Sun
    ICDM
     IEEE International Conference on Data Mining (ICDM), 2013   
    Influence maximization on social networks
    Paper   ArXiV  Slides