摘要
Variousindexstructureshaverecentlybeenproposedtofacilitatehigh-dimensionalKNNqueries,amongwhichthetechniquesofapproximatevectorpresentationandone-dimensional(1D)transformationcanbreakthecurseofdimensionality.Basedonthetwotechniquesabove,anovelhigh-dimensionalindexisproposed,calledBit-codeandDistancebasedindex(BD).BDisbasedonaspecialpartitioningstrategywhichisoptimizedforhigh-dimensionaldata.Bythedefinitionsofbitcodeandtransformationfunction,ahigh-dimensionalvectorcanbefirstapproximatelyrepresentedandthentransformedintoa1Dvector,thekeymanagedbyaB+-tree.AnewKNNsearchalgorithmisalsoproposedthatexploitsthebitcodeanddistancetoprunethesearchspacemoreeffectively.ResultsofextensiveexperimentsusingbothsyntheticandrealdatademonstratedthatBDout-performstheexistingindexstructuresforKNNsearchinhigh-dimensionalspaces.
出版日期
2007年06月16日（中国期刊网平台首次上网日期，不代表论文的发表时间）
