用于在基于超多维数据集的P2P数据存储中查找操作的正式通信模型

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI:10.1109/COLCOM.2005.1651214

D. Fahrenholtz, A. Wombacher

{"title":"用于在基于超多维数据集的P2P数据存储中查找操作的正式通信模型","authors":"D. Fahrenholtz, A. Wombacher","doi":"10.1109/COLCOM.2005.1651214","DOIUrl":null,"url":null,"abstract":"P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additional communication. A formal model of this additional communication is introduced and evaluated based on a hypercube-based P2P data store","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A formal communication model for lookup operations in a hypercube-based P2P data store\",\"authors\":\"D. Fahrenholtz, A. Wombacher\",\"doi\":\"10.1109/COLCOM.2005.1651214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additional communication. A formal model of this additional communication is introduced and evaluated based on a hypercube-based P2P data store\",\"PeriodicalId\":365186,\"journal\":{\"name\":\"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COLCOM.2005.1651214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COLCOM.2005.1651214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

P2P数据存储通过引入数据复制来实现数据的高可用性。因此，搜索数据可能需要遵循引入额外通信的若干路由路径。介绍了这种额外通信的形式化模型，并基于基于超立方体的P2P数据存储对其进行了评估

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A formal communication model for lookup operations in a hypercube-based P2P data store

P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additional communication. A formal model of this additional communication is introduced and evaluated based on a hypercube-based P2P data store

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing

自引率

0.00%

发文量