default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXi Zhao 0006
Person information
- affiliation: Hong Kong University of Science and Technology, Department of Computer Science and Engineering
- affiliation (former): Huazhong University of Science and Technology, China
Other persons with the same name
- Xi Zhao — disambiguation page
- Xi Zhao 0001
![[0000-0001-9983-6366]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-9983-6366")
— Xi'an Jiaotong University, School of Management, China (and 2 more) - Xi Zhao 0002 — Xi'an Jiaotong University, Department of Computer Science and Technology, China (and 1 more)
- Xi Zhao 0003 — Wuhan University, Chinese Antarctic Center of Surveying and Mapping, China (and 1 more)
- Xi Zhao 0004 — Tianjin University of Science and Technology, School of Computer Science and Information Engineering, China (and 1 more)
- Xi Zhao 0005 — Wuhan University of Technology, School of Automation, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Yao Tian, Xi Zhao, Xiaofang Zhou:
DB-LSH 2.0: Locality-Sensitive Hashing With Query-Based Dynamic Bucketing. IEEE Trans. Knowl. Data Eng. 36(3): 1000-1015 (2024)- [j10]Kai Huang, Yue Cui, Qingqing Ye, Yan Zhao, Xi Zhao, Yao Tian, Kai Zheng, Haibo Hu, Xiaofang Zhou:
TED$^+$+: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database. IEEE Trans. Knowl. Data Eng. 36(5): 2224-2238 (2024) - [j9]Kai Huang, Gaoya Ouyang, Qingqing Ye, Haibo Hu, Bolong Zheng, Xi Zhao, Ruiyuan Zhang, Xiaofang Zhou:
LDPGuard: Defenses Against Data Poisoning Attacks to Local Differential Privacy Protocols. IEEE Trans. Knowl. Data Eng. 36(7): 3195-3209 (2024) - [c6]Xi Zhao, Zhonghan Chen, Kai Huang, Ruiyuan Zhang, Bolong Zheng, Xiaofang Zhou:
Efficient Approximate Maximum Inner Product Search Over Sparse Vectors. ICDE 2024: 3961-3974 - [c5]Kai Huang, Yunqi Li, Qingqing Ye, Yao Tian, Xi Zhao, Yue Cui, Haibo Hu, Xiaofang Zhou:
FRESH: Towards Efficient Graph Queries in an Outsourced Graph. ICDE 2024: 4545-4557 - [c4]Jing Zhao, Lei Li, Mengxuan Zhang, Zihan Luo, Xi Zhao, Xiaofang Zhou:
A Just-In-Time Framework for Continuous Routing. ICDE 2024: 4600-4613 - [i5]Zhonghan Chen, Ruiyuan Zhang, Xi Zhao, Xiaojun Cheng, Xiaofang Zhou:
Exploring the Meaningfulness of Nearest Neighbor Search in High-Dimensional Space. CoRR abs/2410.05752 (2024) - 2023
- [j8]Yao Tian, Ziyang Yue, Ruiyuan Zhang, Xi Zhao, Bolong Zheng, Xiaofang Zhou:
Approximate Nearest Neighbor Search in High Dimensional Vector Databases: Current Research and Future Directions. IEEE Data Eng. Bull. 46(3): 39-54 (2023) - [j7]Xi Zhao, Bolong Zheng, Xiaomeng Yi, Xiaofan Luan, Charles Xie, Xiaofang Zhou, Christian S. Jensen:
FARGO: Fast Maximum Inner Product Search via Global Multi-Probing. Proc. VLDB Endow. 16(5): 1100-1112 (2023) - [j6]Xi Zhao, Yao Tian, Kai Huang, Bolong Zheng, Xiaofang Zhou:
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces. Proc. VLDB Endow. 16(8): 1979-1991 (2023) - [j5]Kai Huang, Houdong Liang, Chongchong Yao, Xi Zhao, Yue Cui, Yao Tian, Ruiyuan Zhang, Xiaofang Zhou:
VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines. Proc. VLDB Endow. 16(12): 4010-4013 (2023) - [j4]Yao Tian, Tingyun Yan, Xi Zhao, Kai Huang, Xiaofang Zhou:
A Learned Index for Exact Similarity Search in Metric Spaces. IEEE Trans. Knowl. Data Eng. 35(8): 7624-7638 (2023) - 2022
- [j3]Kai Huang, Qingqing Ye, Jing Zhao, Xi Zhao, Haibo Hu, Xiaofang Zhou:
VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases. Proc. VLDB Endow. 15(12): 3634-3637 (2022) - [j2]Bolong Zheng, Xi Zhao, Lianggui Weng, Quoc Viet Hung Nguyen, Hang Liu, Christian S. Jensen:
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search. VLDB J. 31(6): 1339-1363 (2022) - [c3]Yao Tian, Xi Zhao, Xiaofang Zhou:
DB-LSH: Locality-Sensitive Hashing with Query-based Dynamic Bucketing. ICDE 2022: 2250-2262 - [i4]Yao Tian, Tingyun Yan, Xi Zhao, Kai Huang, Xiaofang Zhou:
A Learned Index for Exact Similarity Search in Metric Spaces. CoRR abs/2204.10028 (2022) - [i3]Yao Tian, Xi Zhao, Xiaofang Zhou:
DB-LSH: Locality-Sensitive Hashing with Query-based Dynamic Bucketing. CoRR abs/2207.07823 (2022) - 2021
- [c2]Bolong Zheng, Lianggui Weng, Xi Zhao, Kai Zeng, Xiaofang Zhou, Christian S. Jensen:
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries. ICDE 2021: 708-719 - [i2]Bolong Zheng, Lianggui Weng, Xi Zhao, Kai Zeng, Xiaofang Zhou, Christian S. Jensen:
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries. CoRR abs/2101.08929 (2021) - [i1]Bolong Zheng, Xi Zhao, Lianggui Weng, Nguyen Quoc Viet Hung, Hang Liu, Christian S. Jensen:
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search. CoRR abs/2107.05537 (2021) - 2020
- [j1]Bolong Zheng, Xi Zhao, Lianggui Weng, Nguyen Quoc Viet Hung, Hang Liu, Christian S. Jensen:
PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search. Proc. VLDB Endow. 13(5): 643-655 (2020) - [c1]Zhong Yang, Bolong Zheng, GuoHui Li, Xi Zhao, Xiaofang Zhou, Christian S. Jensen:
Adaptive Top-k Overlap Set Similarity Joins. ICDE 2020: 1081-1092
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
