Xi Zhao

Orcid: 0000-0002-3240-8225

Affiliations:
  • Hong Kong University of Science and Technology, Department of Computer Science and Engineering
  • Huazhong University of Science and Technology, China (former)


According to our database1, Xi Zhao authored at least 17 papers between 2020 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
LDPGuard: Defenses Against Data Poisoning Attacks to Local Differential Privacy Protocols.
IEEE Trans. Knowl. Data Eng., July, 2024

TED$^+$+: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database.
IEEE Trans. Knowl. Data Eng., May, 2024

DB-LSH 2.0: Locality-Sensitive Hashing With Query-Based Dynamic Bucketing.
IEEE Trans. Knowl. Data Eng., March, 2024

A Just-In-Time Framework for Continuous Routing.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

FRESH: Towards Efficient Graph Queries in an Outsourced Graph.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Efficient Approximate Maximum Inner Product Search Over Sparse Vectors.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023
A Learned Index for Exact Similarity Search in Metric Spaces.
IEEE Trans. Knowl. Data Eng., August, 2023

FARGO: Fast Maximum Inner Product Search via Global Multi-Probing.
Proc. VLDB Endow., 2023

Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces.
Proc. VLDB Endow., 2023

VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines.
Proc. VLDB Endow., 2023

Approximate Nearest Neighbor Search in High Dimensional Vector Databases: Current Research and Future Directions.
IEEE Data Eng. Bull., 2023

2022
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search.
VLDB J., 2022

VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases.
Proc. VLDB Endow., 2022

DB-LSH: Locality-Sensitive Hashing with Query-based Dynamic Bucketing.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

2020
PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search.
Proc. VLDB Endow., 2020

Adaptive Top-k Overlap Set Similarity Joins.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020


  Loading...