10 citations · 23 across the 8 of their papers we have counts for
8 papers
UBASE: An AI Search Engine for Trillion-Scale Vector Data Management at ByteDance
Yao Tian, Yuncheng Lu, Liyao Xiong +9
Since 2016, UBASE has been the foundation of ByteDance's search infrastructure, scaling to more than 7,000 clusters and 300 PB of indexed data. Driven by the demands of AI workload…
VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines
Kai Huang, Houdong Liang, Chongchong Yao +5
Visual Graph Query Interfaces (VQIs) empower non-programmers to query graph data by constructing visual queries intuitively. Devising efficient technologies in Graph Query Engines…
GEM: A Native Graph-based Index for Multi-Vector Retrieval
Yao Tian, Zhoujin Tian, Xi Zhao +2
In multi-vector retrieval, both queries and data are represented as sets of high-dimensional vectors, enabling finer-grained semantic matching and improving retrieval quality over…
Exploring the Meaningfulness of Nearest Neighbor Search in High-Dimensional Space
Zhonghan Chen, Ruiyuan Zhang, Xi Zhao +2
Dense high dimensional vectors are becoming increasingly vital in fields such as computer vision, machine learning, and large language models (LLMs), serving as standard representa…
DB-LSH: Locality-Sensitive Hashing with Query-based Dynamic Bucketing
Yao Tian, Xi Zhao, Xiaofang Zhou
Among many solutions to the high-dimensional approximate nearest neighbor (ANN) search problem, locality sensitive hashing (LSH) is known for its sub-linear query time and robust t…
A Learned Index for Exact Similarity Search in Metric Spaces
Yao Tian, Tingyun Yan, Xi Zhao +2
Indexing is an effective way to support efficient query processing in large databases. Recently the concept of learned index, which replaces or complements traditional index struct…
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search
Bolong Zheng, Xi Zhao, Lianggui Weng +3
Nearest neighbor (NN) search is inherently computationally expensive in high-dimensional spaces due to the curse of dimensionality. As a well-known solution, locality-sensitive has…
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries
Bolong Zheng, Lianggui Weng, Xi Zhao +3
Trajectory similarity computation is a fundamental component in a variety of real-world applications, such as ridesharing, road planning, and transportation optimization. Recent ad…