摘要
在无向加权图上进行距离检索和对象查询是使用无向加权图的重要工作,也是解决实际问题的重要步骤。该文提出一种基于距离签名的处理方法来实现距离检索和查询,通过距离分级、签名编码和压缩等,实现了检索和查询的高效率,减少了存储空间。描述了建模及处理KNN查询的过程,实验证明了该方法的有效性。
Distance indexing and object search on an undirected weighted graph are important work while using an undirected weighted graph, which is also a key process while solving an actual problem. This article presents a distance indexing and object search method based on the undirected weighted graph. By distance category, signature encoding and compression, it implements well efficiency of indexing and search, reduces storage space. The article describes the modeling process of the method, introduces the process for handling the KNN search, and finally proves the superiority of. efficiency by the method through comparative experiments.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第15期80-82,共3页
Computer Engineering
基金
上海市科委产学研基金资助项目(05DZ11C06)
关键词
无向加权图
检索
距离签名
等级
undirected weighted graph
indexing
distance signature
category
