一种XML路径检索方法

Ling Song, Shengen Li, Wei Cui, Dongmei Zhang, Xiaofei Niu
{"title":"一种XML路径检索方法","authors":"Ling Song, Shengen Li, Wei Cui, Dongmei Zhang, Xiaofei Niu","doi":"10.1109/GRC.2009.5255069","DOIUrl":null,"url":null,"abstract":"Both of XML document and user's query are represented by the set of paths from the root node to leaf nodes. So the context and content information contained in the corresponding path is a vital important clue to research XML retrieval. This paper presents an approach, NPathSim, for measuring similarity between two paths. XML Path retrieval was performed to evaluate the performance of NPathSim. The experiments show that our path retrieval method can achieve better performance than other methods.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An approach to XML Path retrieval\",\"authors\":\"Ling Song, Shengen Li, Wei Cui, Dongmei Zhang, Xiaofei Niu\",\"doi\":\"10.1109/GRC.2009.5255069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Both of XML document and user's query are represented by the set of paths from the root node to leaf nodes. So the context and content information contained in the corresponding path is a vital important clue to research XML retrieval. This paper presents an approach, NPathSim, for measuring similarity between two paths. XML Path retrieval was performed to evaluate the performance of NPathSim. The experiments show that our path retrieval method can achieve better performance than other methods.\",\"PeriodicalId\":388774,\"journal\":{\"name\":\"2009 IEEE International Conference on Granular Computing\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Granular Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GRC.2009.5255069\",\"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 Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRC.2009.5255069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

XML文档和用户查询都由从根节点到叶节点的一组路径表示。因此,相应路径中包含的上下文和内容信息是研究XML检索的重要线索。本文提出了一种测量两条路径之间相似度的方法NPathSim。通过XML路径检索来评估NPathSim的性能。实验表明,本文提出的路径检索方法比其他方法具有更好的检索性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An approach to XML Path retrieval
Both of XML document and user's query are represented by the set of paths from the root node to leaf nodes. So the context and content information contained in the corresponding path is a vital important clue to research XML retrieval. This paper presents an approach, NPathSim, for measuring similarity between two paths. XML Path retrieval was performed to evaluate the performance of NPathSim. The experiments show that our path retrieval method can achieve better performance than other methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信