| PM-LSH: A fast and accurate LSH framework for high-dimensional approximate NN search B Zheng, Z Xi, L Weng, NQV Hung, H Liu, CS Jensen Proceedings of the VLDB Endowment 13 (5), 643-655, 2020 | 98 | 2020 |
| Towards efficient index construction and approximate nearest neighbor search in high-dimensional spaces X Zhao, Y Tian, K Huang, B Zheng, X Zhou Proceedings of the VLDB Endowment 16 (8), 1979-1991, 2023 | 29 | 2023 |
| DB-LSH 2.0: Locality-sensitive hashing with query-based dynamic bucketing Y Tian, X Zhao, X Zhou IEEE Transactions on Knowledge and Data Engineering, 2023 | 25 | 2023 |
| Adaptive top-k overlap set similarity joins Z Yang, B Zheng, G Li, X Zhao, X Zhou, CS Jensen 2020 IEEE 36th International Conference on Data Engineering (ICDE), 1081-1092, 2020 | 22 | 2020 |
| A learned index for exact similarity search in metric spaces Y Tian, T Yan, X Zhao, K Huang, X Zhou IEEE Transactions on Knowledge and Data Engineering 35 (8), 7624-7638, 2022 | 20 | 2022 |
| Repose: distributed top-k trajectory similarity search with local reference point tries B Zheng, L Weng, X Zhao, K Zeng, X Zhou, CS Jensen 2021 IEEE 37th international conference on data engineering (ICDE), 708-719, 2021 | 19 | 2021 |
| PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search B Zheng, X Zhao, L Weng, QVH Nguyen, H Liu, CS Jensen The VLDB Journal 31 (6), 1339-1363, 2022 | 11 | 2022 |
| FARGO: Fast maximum inner product search via global multi-probing X Zhao, B Zheng, X Yi, X Luan, C Xie, X Zhou, CS Jensen Proceedings of the VLDB Endowment 16 (5), 1100-1112, 2023 | 7 | 2023 |
| LDPGuard: Defenses against data poisoning attacks to local differential privacy protocols K Huang, G Ouyang, Q Ye, H Hu, B Zheng, X Zhao, R Zhang, X Zhou IEEE Transactions on Knowledge and Data Engineering, 2024 | 4 | 2024 |
| Approximate Nearest Neighbor Search in High Dimensional Vector Databases: Current Research and Future Directions. Y Tian, Z Yue, R Zhang, X Zhao, B Zheng, X Zhou IEEE Data Eng. Bull. 46 (3), 39-54, 2023 | 4 | 2023 |
| VINCENT: towards efficient exploratory subgraph search in graph databases K Huang, Q Ye, J Zhao, X Zhao, H Hu, X Zhou Proceedings of the VLDB Endowment 15 (12), 3634-3637, 2022 | 4 | 2022 |
| VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines K Huang, H Liang, C Yao, X Zhao, Y Cui, Y Tian, R Zhang, X Zhou Proceedings of the VLDB Endowment 16 (12), 4010-4013, 2023 | 1 | 2023 |
| Exploring the Meaningfulness of Nearest Neighbor Search in High-Dimensional Space Z Chen, R Zhang, X Zhao, X Cheng, X Zhou arXiv preprint arXiv:2410.05752, 2024 | | 2024 |
| FRESH: Towards Efficient Graph Queries in an Outsourced Graph K Huang, Y Li, Q Ye, Y Tian, X Zhao, Y Cui, H Hu, X Zhou 2024 IEEE 40th International Conference on Data Engineering (ICDE), 4545-4557, 2024 | | 2024 |
| Efficient Approximate Maximum Inner Product Search Over Sparse Vectors X Zhao, Z Chen, K Huang, R Zhang, B Zheng, X Zhou 2024 IEEE 40th International Conference on Data Engineering (ICDE), 3961-3974, 2024 | | 2024 |
| A Just-In-Time Framework for Continuous Routing J Zhao, L Li, M Zhang, Z Luo, X Zhao, X Zhou 2024 IEEE 40th International Conference on Data Engineering (ICDE), 4600-4613, 2024 | | 2024 |
