{"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}
引用次数: 0
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.