Exploring bit-difference for approximate KNN search in high-dimensional databases

• 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: High-dimensional index structure; approximate KNN query; memory processing; bit difference; Databases and Information Systems
• 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
• Institution: Singapore Management University

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 overall query response time for memory processing. To reduce the distance computation, we first propose a structure (BID) using BIt-Difference to answer approximate KNN query. The BID employs one bit to represent each feature vector of point and the number of bit-difference is used to prune the further points. To facilitate real dataset which is typically skewed, we enhance the BID mechanism with clustering, cluster adapted bitcoder and dimensional weight, named the BID+. Extensive experiments are conducted to show that our proposed method yields signifcant performance advantages over the existing index structures on both real life and synthetic high-dimensional datasets.