结构化P2P网络中的XML数据查询

Dehua Chen, Yongming Guo, Xiujin Shi, Shoujian Yu
{"title":"结构化P2P网络中的XML数据查询","authors":"Dehua Chen, Yongming Guo, Xiujin Shi, Shoujian Yu","doi":"10.1109/ICFCC.2009.75","DOIUrl":null,"url":null,"abstract":"In this paper, we present solutions that enable efficient XML data querying on a structured P2Pnetwork. In particular, our solutions rely on a distributed index technique which indexes both the string values and structure summary of any XML document over the P2P network. With such kind of distributed indices, we may find the relevant results by a limiting number of peer lookups. To improve the efficiency of data querying, we also present a method that enables performing a query in parallelization. In addition, we use Bloom Filter to reduce the size of the candidate document lists exchanging between peers and improve the network traffic. Our simulation results show that our solutions can achieve major performance gains in terms of network bandwidth and execution time.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Querying XML Data on a Structured P2P Network\",\"authors\":\"Dehua Chen, Yongming Guo, Xiujin Shi, Shoujian Yu\",\"doi\":\"10.1109/ICFCC.2009.75\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present solutions that enable efficient XML data querying on a structured P2Pnetwork. In particular, our solutions rely on a distributed index technique which indexes both the string values and structure summary of any XML document over the P2P network. With such kind of distributed indices, we may find the relevant results by a limiting number of peer lookups. To improve the efficiency of data querying, we also present a method that enables performing a query in parallelization. In addition, we use Bloom Filter to reduce the size of the candidate document lists exchanging between peers and improve the network traffic. Our simulation results show that our solutions can achieve major performance gains in terms of network bandwidth and execution time.\",\"PeriodicalId\":338489,\"journal\":{\"name\":\"2009 International Conference on Future Computer and Communication\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Future Computer and Communication\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFCC.2009.75\",\"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 International Conference on Future Computer and Communication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFCC.2009.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了在结构化p2p网络上实现高效XML数据查询的解决方案。特别是,我们的解决方案依赖于分布式索引技术,该技术对P2P网络上任何XML文档的字符串值和结构摘要进行索引。使用这种分布式索引,我们可以通过有限的对等查找次数找到相关的结果。为了提高数据查询的效率,我们还提出了一种能够并行执行查询的方法。此外,我们使用Bloom Filter减少了对等体之间交换的候选文档列表的大小,提高了网络流量。我们的仿真结果表明,我们的解决方案可以在网络带宽和执行时间方面实现主要的性能提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Querying XML Data on a Structured P2P Network
In this paper, we present solutions that enable efficient XML data querying on a structured P2Pnetwork. In particular, our solutions rely on a distributed index technique which indexes both the string values and structure summary of any XML document over the P2P network. With such kind of distributed indices, we may find the relevant results by a limiting number of peer lookups. To improve the efficiency of data querying, we also present a method that enables performing a query in parallelization. In addition, we use Bloom Filter to reduce the size of the candidate document lists exchanging between peers and improve the network traffic. Our simulation results show that our solutions can achieve major performance gains in terms of network bandwidth and execution time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A UK Case Study - Technology Enhances Educational Experiences in the University of Glamorgan Sequence-Based Data Dissemination Algorithms for Peer-to-Peer Multicast Protocols IMS Network Architecture Securing a Low Level Reader Protocol Connection and a Study of its Performance Inter-symbol-Interference Reduction in Indoor Infrared Systems by Effective Sampling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1