Congjun Yang

Learn More
Spatial databases have grown in importance in various fields. Together with them come various types of queries that need to be answered effectively. While queries involving single data set have been studied extensively, join queries on multi-dimensional data like the k-closest pairs and the nearest neighbor joins have only recently received attention. In(More)
Reverse Nearest Neighbors queries has emerged as an important class of queries for spatial and other types of databases. The Rdnn-tree is an R-tree based structure that has been shown to perform outstandingly for such kind of queries. However, one practical problem facing it (as well as other type of indexes) is how to effective construct the index from(More)
In th is paper we explore t h e problem of approximate nearest neighbor searches. W e propose a n i n d e x structure, t h e A N N t r e e (approximate nearest neighbor tree) t o solve this problem. T h e A N N t r e e supports high accuracy nearest neighbor search. T h e actual nearest neighbor of a query poin t can usually be f o u n d in the f i r s t(More)
  • 1