MF-Chord:支持多属性多关键字模糊匹配查询

Xiu-mei Zhao, Fang-Ai Liu
{"title":"MF-Chord:支持多属性多关键字模糊匹配查询","authors":"Xiu-mei Zhao, Fang-Ai Liu","doi":"10.1109/ITIME.2009.5236366","DOIUrl":null,"url":null,"abstract":"Most educational resource grids are required to support multi-attribute multi-keyword fuzzy-matching queries. But such queries are not efficiently supported in current structured P2P systems. Towards an efficient P2P system capable of processing multiattribute multi-keyword fuzzy-matching queries with high recall ratio and load balancing, we propose a new resource indexing model which is expanded from Chord and called MF-Chord. Besides one-dimensional fingerprint which includes main keywords information of each attribute of the resource, MF-Chord generates opposite-fingerprint for every resource, which is the partial reversal of the fingerprint and is used to balance the query load. Reforming the finger tables of nodes and the query-request-message format, MFChord dynamically generates the query-requestforwarding- tree for every query and realizes the efficient multi-attribute multi-keyword fuzzy-matching query function. Through theoretical Analysis, we prove that MF-Chord has high recall ratio in limited hops. The experiment results show that the recall ratio of MF-Chord is more than 80% even when the maximum hop count is set to 7 and there are 80000 nodes in the system.","PeriodicalId":398477,"journal":{"name":"2009 IEEE International Symposium on IT in Medicine & Education","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"MF-Chord: Supporting multi-attribute multi-keyword fuzzy-matching queries\",\"authors\":\"Xiu-mei Zhao, Fang-Ai Liu\",\"doi\":\"10.1109/ITIME.2009.5236366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most educational resource grids are required to support multi-attribute multi-keyword fuzzy-matching queries. But such queries are not efficiently supported in current structured P2P systems. Towards an efficient P2P system capable of processing multiattribute multi-keyword fuzzy-matching queries with high recall ratio and load balancing, we propose a new resource indexing model which is expanded from Chord and called MF-Chord. Besides one-dimensional fingerprint which includes main keywords information of each attribute of the resource, MF-Chord generates opposite-fingerprint for every resource, which is the partial reversal of the fingerprint and is used to balance the query load. Reforming the finger tables of nodes and the query-request-message format, MFChord dynamically generates the query-requestforwarding- tree for every query and realizes the efficient multi-attribute multi-keyword fuzzy-matching query function. Through theoretical Analysis, we prove that MF-Chord has high recall ratio in limited hops. The experiment results show that the recall ratio of MF-Chord is more than 80% even when the maximum hop count is set to 7 and there are 80000 nodes in the system.\",\"PeriodicalId\":398477,\"journal\":{\"name\":\"2009 IEEE International Symposium on IT in Medicine & Education\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on IT in Medicine & Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITIME.2009.5236366\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on IT in Medicine & Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITIME.2009.5236366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

大多数教育资源网格都需要支持多属性多关键字模糊匹配查询。但是在现有的结构化P2P系统中,这种查询并没有得到有效的支持。为了使P2P系统能够高效地处理高查全率和负载均衡的多属性多关键字模糊匹配查询,本文提出了一种从Chord扩展而来的资源索引模型MF-Chord。除了包含资源各属性的主要关键字信息的一维指纹外,MF-Chord还为每个资源生成相反的指纹,这是指纹的部分反转,用于平衡查询负载。MFChord对节点手指表和查询-请求-消息格式进行了改造,为每条查询动态生成查询-请求转发树,实现了高效的多属性多关键字模糊匹配查询功能。通过理论分析,证明了MF-Chord在有限跳数下具有较高的召回率。实验结果表明,当最大跳数设置为7,系统中有80000个节点时,MF-Chord的召回率仍在80%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MF-Chord: Supporting multi-attribute multi-keyword fuzzy-matching queries
Most educational resource grids are required to support multi-attribute multi-keyword fuzzy-matching queries. But such queries are not efficiently supported in current structured P2P systems. Towards an efficient P2P system capable of processing multiattribute multi-keyword fuzzy-matching queries with high recall ratio and load balancing, we propose a new resource indexing model which is expanded from Chord and called MF-Chord. Besides one-dimensional fingerprint which includes main keywords information of each attribute of the resource, MF-Chord generates opposite-fingerprint for every resource, which is the partial reversal of the fingerprint and is used to balance the query load. Reforming the finger tables of nodes and the query-request-message format, MFChord dynamically generates the query-requestforwarding- tree for every query and realizes the efficient multi-attribute multi-keyword fuzzy-matching query function. Through theoretical Analysis, we prove that MF-Chord has high recall ratio in limited hops. The experiment results show that the recall ratio of MF-Chord is more than 80% even when the maximum hop count is set to 7 and there are 80000 nodes in the system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信