Yun Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yun Chen has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jignesh M. Patel
University of Michigan
2 shared publications - Hosagrahar Visvesvaraya Jagadish
University of Michigan Ann Arbor MI USA
1 shared publication - Kanda Runapongsa
Department of Electrical Engineering and Computer Science, University of Michigan, 1301 Beal Avenue, Ann Arbor, MI 48109-2122, USA
1 shared publication - Shurug Al-Khalifa
University of Michigan
1 shared publication
Latest Publications
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 1056-1065
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-tree based methods have been proposed to speed up this computation. These traditional index-based methods use a pruning metric called MAXMAXDIST, which allows the algorithms to prune out nodes in the index that need not be traversed during the ANN computation. In this paper we introduce a new pruning metric called the NXNDIST, and show that this metric is far more effective than the traditional MAXMAXDIST metric. In this paper, we also challenge the common practice of using R*-tree index for speeding up the ANN computation. We propose an enhanced bucket quadtree index structure, called the MBRQT, and using extensive experimental evaluation show that the MBRQT index can significantly speed up the ANN computation. In addition, we also present the MBA algorithm based on a depth-first index traversal and bi-directional node expansion strategy. Furthermore, our method can be easily extended to efficiently answer the more general All-k-Nearest-Neighbor (AkNN) queries.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 1056-1065
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-tree based methods have been proposed to speed up this computation. These traditional index-based methods use a pruning metric called MAXMAXDIST, which allows the algorithms to prune out nodes in the index that need not be traversed during the ANN computation. In this paper we introduce a new pruning metric called the NXNDIST, and show that this metric is far more effective than the traditional MAXMAXDIST metric. In this paper, we also challenge the common practice of using R*-tree index for speeding up the ANN computation. We propose an enhanced bucket quadtree index structure, called the MBRQT, and using extensive experimental evaluation show that the MBRQT index can significantly speed up the ANN computation. In addition, we also present the MBA algorithm based on a depth-first index traversal and bi-directional node expansion strategy. Furthermore, our method can be easily extended to efficiently answer the more general All-k-Nearest-Neighbor (AkNN) queries.
- 30 April 2006
- Published by Elsevier in Information Systems
- Vol. 31 (2) , 73-97
The Michigan benchmark: towards XML query performance diagnostics
- 30 April 2006
- Published by Elsevier in Information Systems
- Vol. 31 (2) , 73-97
The Michigan benchmark: towards XML query performance diagnostics