Similarity Indexing with the SS-tree
ICDE(1996)
摘要
Efficient indexing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this paper, we define this problem as "similarity indexing" and describe the fundamental types of "similarity queries" that we believe should be supported. We also propose a new dynamic structure for similarity indexing called the similarity search tree or SS-tree. In nearly every test we performed on high dimensional data, we found that this structure performed better than the R*-tree. Our tests also show that the SS-tree is much better suited for approximate queries than the R*-tree.
更多查看译文
关键词
approximate query,new dynamic structure,high dimensional feature vector,large databases,similarity query,similarity indexing,efficient indexing,high dimensional data,fundamental type,similarity search tree,access method,similarity search,indexing,sampling,indexation,tree data structures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络