Exploring bit-difference for approximate KNN search in high-dimensional databases
In this paper, we develop a novel index structure to support effcient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., Euclidean distance) between two points contributes a dominant portion of the overa...
Saved in:
Main Authors: | Cui, Bin, Shen, Heng Tao, SHEN, Jialie, Tan, Kian-Lee |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1298 https://ink.library.smu.edu.sg/context/sis_research/article/2297/viewcontent/CRPITV39CuiShen.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
IMPACT: A twin-index framework for efficient moving object query processing
by: Cui, B., et al.
Published: (2013) -
Towards Efficient and Flexible Knn Query Processing in Real-Life Road Networks
by: LU, YANG, et al.
Published: (2008) -
Indexing high-dimensional data for efficient in-memory similarity search
by: Cui, B., et al.
Published: (2013) -
IDistance: An adaptive B +-tree based indexing method for nearest neighbor search
by: Jagadish, H.V., et al.
Published: (2013) -
G-tree: An efficient index for KNN search on road networks
by: Zhong, R., et al.
Published: (2014)