Y
Yufei Tao
Researcher at The Chinese University of Hong Kong
Publications - 212
Citations - 16395
Yufei Tao is an academic researcher from The Chinese University of Hong Kong. The author has contributed to research in topics: Query optimization & Nearest neighbor search. The author has an hindex of 64, co-authored 202 publications receiving 15631 citations. Previous affiliations of Yufei Tao include University of Queensland & Hong Kong University of Science and Technology.
Papers
More filters
Journal ArticleDOI
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
TL;DR: This work improves LSH by proposing an access method called the Locality-Sensitive B-tree (LSB-tree) to enable fast, accurate, high-dimensional NN search in relational databases, and extends the LSB technique to solve another classic problem, called Closest Pair (CP) search, in high- dimensional space.
Proceedings ArticleDOI
Efficient historical R-trees
Yufei Tao,Dimitris Papadias +1 more
TL;DR: The HR+-tree is proposed, which occupies a small fraction of the space required for the corresponding HR-tree (for typical conditions about 20%), while improving interval query performance several times.
Journal ArticleDOI
Reverse nearest neighbors in large graphs
TL;DR: A fundamental lemma is provided, which can be used to prune the search space while traversing the graph in search for RNN, and two RNN methods are developed; an eager algorithm that attempts to prunes network nodes as soon as they are visited and a lazy technique that prunes thesearch space when a data point is discovered.
Book ChapterDOI
Probabilistic spatial queries on existentially uncertain data
TL;DR: This work proposes adaptations of spatial access methods and search algorithms for probabilistic versions of range queries and nearest neighbors and conducts an extensive experimental study, which evaluates the effectiveness of proposed solutions.
Proceedings ArticleDOI
All-nearest-neighbors queries in spatial databases
TL;DR: Alternative methods for processing ANN queries depending on whether A and B are indexed are studied, showing that they are an order of magnitude faster than a previous approach based on closest-pairs query processing.