標(biāo)題: Titlebook: Data Management in Grid and Peer-to-Peer Systems; 4th International Co Abdelkader Hameurlain,A Min Tjoa Conference proceedings 2011 Springe [打印本頁] 作者: 他剪短 時間: 2025-3-21 17:50
書目名稱Data Management in Grid and Peer-to-Peer Systems影響因子(影響力)
書目名稱Data Management in Grid and Peer-to-Peer Systems影響因子(影響力)學(xué)科排名
書目名稱Data Management in Grid and Peer-to-Peer Systems網(wǎng)絡(luò)公開度
書目名稱Data Management in Grid and Peer-to-Peer Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Data Management in Grid and Peer-to-Peer Systems被引頻次
書目名稱Data Management in Grid and Peer-to-Peer Systems被引頻次學(xué)科排名
書目名稱Data Management in Grid and Peer-to-Peer Systems年度引用
書目名稱Data Management in Grid and Peer-to-Peer Systems年度引用學(xué)科排名
書目名稱Data Management in Grid and Peer-to-Peer Systems讀者反饋
書目名稱Data Management in Grid and Peer-to-Peer Systems讀者反饋學(xué)科排名
作者: maverick 時間: 2025-3-21 23:44
G. Kass-Simon,A. A. Scappaticci Jrpt and data is available for read or write operations. To this end, we rely on the estimated lifetime of nodes in order to manage master node failures in a preventive fashion. Simulation results obtained show the feasibility of our approach and its positive impact on the global performances of the s作者: 性上癮 時間: 2025-3-22 01:37
G. E. Lesh-Laurie,A. Hujer,P. Suchy node by rewiring the overlay in order to preserve at least one path between any pairs of replicas, while conserving the structural characteristics of the overlay. Simulations show that at a tunable overhead, connectivity is maintained, despite local decisions that would have otherwise disrupted the作者: 現(xiàn)實 時間: 2025-3-22 05:37
The Current Coenzyme Q Science and Knowledges paper, we present an adaptive routing algorithm that exploits either centrality or regularity according to the situation to achieve the best possible routing performance in delay tolerant networks. Simulations performed on real mobility traces show that our algorithm outperforms the existing routi作者: Acclaim 時間: 2025-3-22 11:20
Daniel J. M. Fernández-Ayala,Alberto Sanzrms (DCP) as a dynamically configurable elastic infrastructure for parallel and distributed execution of SQL Streaming Processes..The proposed infrastructure is preliminarily implemented using PostgreSQL engines. Our experience shows its merit in leveraging SQL and query engines to analyze real-time作者: 可用 時間: 2025-3-22 13:51
Maria Luisa Genova,Giorgio Lenazion during moving data from sites to sites. We conduct an extensive campaign of experiments focused to test the effective performance of .. Results clearly demonstrate the improvements offered by . in supporting data transmissions across Clouds for data-intensive scientific applications.作者: 可用 時間: 2025-3-22 20:32 作者: 高度表 時間: 2025-3-22 23:52
Lifetime-Based Dynamic Data Replication in P2P systemspt and data is available for read or write operations. To this end, we rely on the estimated lifetime of nodes in order to manage master node failures in a preventive fashion. Simulation results obtained show the feasibility of our approach and its positive impact on the global performances of the s作者: Flatus 時間: 2025-3-23 01:45
Distributed Overlay Maintenance with Application to Data Consistency node by rewiring the overlay in order to preserve at least one path between any pairs of replicas, while conserving the structural characteristics of the overlay. Simulations show that at a tunable overhead, connectivity is maintained, despite local decisions that would have otherwise disrupted the作者: myopia 時間: 2025-3-23 05:57 作者: archetype 時間: 2025-3-23 10:33 作者: 懶鬼才會衰弱 時間: 2025-3-23 17:23
: An Efficient Data Management and Migration Scheme across Clouds for Data-Intensive Scientific Appion during moving data from sites to sites. We conduct an extensive campaign of experiments focused to test the effective performance of .. Results clearly demonstrate the improvements offered by . in supporting data transmissions across Clouds for data-intensive scientific applications.作者: 侵害 時間: 2025-3-23 21:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/262867.jpg作者: 幼稚 時間: 2025-3-24 00:22
https://doi.org/10.1007/978-3-642-22947-3cloud computing; database replication; distributed computing; fault-management; parallel iterative algor作者: Exploit 時間: 2025-3-24 06:16 作者: 勾引 時間: 2025-3-24 08:22
Coding, Cryptography and Combinatorics to introduce redundancy is by simple replication. This strategy allows an easy and fast access to data, and a good bandwidth efficiency to repair the missing redundancy when a peer leaves or fails in high churn systems..However, it is known that erasure codes, like Reed-Solomon, are an efficient so作者: 改變 時間: 2025-3-24 12:37
G. Kass-Simon,A. A. Scappaticci Jrds bottlenecks and single point of failure..One of the widely used replication policies is master-slave configuration which eases consistency control since all update operations are handled on a particular node, called master, whereas read operations are routed on remaining nodes. This approach impr作者: Aspirin 時間: 2025-3-24 18:06
G. E. Lesh-Laurie,A. Hujer,P. Suchyta replication at a large scale, weak consistency has been adopted as a standard in uniformly trusted systems. Recently, a distributed framework has been proposed to handle untrusted systems, by adding access control at the file level. Yet, if no particular care is paid to the connectivity of the ne作者: Obstruction 時間: 2025-3-24 21:01
Problems of being a cell in a soft bodye the same ontology, the system is said to be semantically heterogeneous. This situation of heterogeneity prevents perfect interoperability. Indeed participants could be unable to treat queries for which they do not understand some concepts. Intuitively, the more heterogeneous a system, the harder t作者: 不可侵犯 時間: 2025-3-25 00:47 作者: COUCH 時間: 2025-3-25 04:15
David S. Wethey,James W. Porterlogy is?associated to each domain and mappings exist between these domain ontologies. Our resource discovery method is adapted?to any mapping graph topology between domain ontologies provided that the graph is connected. The proposed addressing system allows permanent access from any domain ontology作者: hardheaded 時間: 2025-3-25 08:38
David S. Wethey,James W. Porterystems namely the scalability goal. Despite achieving reasonable scalability, this approach suffers from long response times to resource requests. Several solutions such as learning-based request forwarding have tried to improve the response time but not quite. This is because target nodes in learni作者: aesthetic 時間: 2025-3-25 12:54
The Current Coenzyme Q Science and Knowledgetics of mobile environments, particularly highly variable connectivity, and disconnection. Mobile peer-to-peer data dissemination over Delay Tolerant Networks (DTNs) is a promising paradigm since they can tolerate frequent and long network partitions. DTNs exploit collaborative data storage and node作者: intrude 時間: 2025-3-25 16:14
Daniel J. M. Fernández-Ayala,Alberto Sanzows us to take advantage of SQL’s expressive power and DBMS’s data management capability. However, it also raises serious challenges in dealing with complex dataflow, applying queries to unbounded stream data, and providing highly scalable, dynamically configurable, elastic infrastructure..In this p作者: Trabeculoplasty 時間: 2025-3-25 23:28 作者: custody 時間: 2025-3-26 01:27
Maria Luisa Genova,Giorgio Lenazn cost for performance purposes. Efficient . allow us to manage data transmissions with lower number of steps and shorter transmission time. In previous research efforts, several methods have been proposed in literature in order to manage data and minimize transmission cost for the case of .. Unfort作者: Collected 時間: 2025-3-26 04:22
Data Management in Grid and Peer-to-Peer Systems978-3-642-22947-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 鐵塔等 時間: 2025-3-26 08:32
Hybrid Approaches for Distributed Storage Systems to introduce redundancy is by simple replication. This strategy allows an easy and fast access to data, and a good bandwidth efficiency to repair the missing redundancy when a peer leaves or fails in high churn systems..However, it is known that erasure codes, like Reed-Solomon, are an efficient so作者: 托運 時間: 2025-3-26 13:54
Lifetime-Based Dynamic Data Replication in P2P systemsds bottlenecks and single point of failure..One of the widely used replication policies is master-slave configuration which eases consistency control since all update operations are handled on a particular node, called master, whereas read operations are routed on remaining nodes. This approach impr作者: 大酒杯 時間: 2025-3-26 18:43 作者: 橡子 時間: 2025-3-26 21:12
Gossiping Correspondences to Reduce Semantic Heterogeneity of Unstructured P2P Systemse the same ontology, the system is said to be semantically heterogeneous. This situation of heterogeneity prevents perfect interoperability. Indeed participants could be unable to treat queries for which they do not understand some concepts. Intuitively, the more heterogeneous a system, the harder t作者: chisel 時間: 2025-3-27 05:02
Simulation Based Analysis for a Traceable P2P Record Exchange Frameworkuters to communicate and share resources as equals without central server control. This causes inconsistency in exchanged information and results in lack of trustworthiness. To provide trustful and flexible information exchange facility in P2P networks, we proposed a .. In this framework, a peer can作者: rods366 時間: 2025-3-27 06:45 作者: 煉油廠 時間: 2025-3-27 12:47 作者: Demonstrate 時間: 2025-3-27 15:58
Leveraging Node Centrality and Regularity for Efficient Routing in Mobile Peer-to-Peer Networkstics of mobile environments, particularly highly variable connectivity, and disconnection. Mobile peer-to-peer data dissemination over Delay Tolerant Networks (DTNs) is a promising paradigm since they can tolerate frequent and long network partitions. DTNs exploit collaborative data storage and node作者: 思想流動 時間: 2025-3-27 18:57
Query Engine Grid for Executing SQL Streaming Processows us to take advantage of SQL’s expressive power and DBMS’s data management capability. However, it also raises serious challenges in dealing with complex dataflow, applying queries to unbounded stream data, and providing highly scalable, dynamically configurable, elastic infrastructure..In this p作者: Cpr951 時間: 2025-3-28 01:45
Subdomain Solution of Problem with Unilateral Constraints in Grid Environments the three-dimensional domain. An implicit scheme is used for the time dependent part of the operator and the problem is then reduced to the solution of a sequence of stationary problems. The discretization of such stationary problem by appropriate schemes leads to the solution of a large-scale alge作者: 全能 時間: 2025-3-28 03:48 作者: 弄臟 時間: 2025-3-28 08:17
Conference proceedings 2011m 18 submissions. The papers are organized in topical sections on data storage and replication, semantics for P2P systems and performance evaluation, resource discovery and routing in mobile P2P networks, and data stream systems and large-scale distributed applications.作者: 豐滿中國 時間: 2025-3-28 13:44 作者: Hormones 時間: 2025-3-28 15:07
https://doi.org/10.1007/978-3-030-45642-9braic system. According to the size of these systems, parallel iterative asynchronous and synchronous subdomain methods are carried out on distributed architectures. Finally the experiment studies are presented and analyzed.作者: Comedienne 時間: 2025-3-28 21:19 作者: 卜聞 時間: 2025-3-29 02:12 作者: GLUE 時間: 2025-3-29 04:57 作者: 獎牌 時間: 2025-3-29 09:16
David S. Wethey,James W. Porter account the loads on target nodes as well as their abilities in responding to requests based on their previous behaviors. Evaluations show that as the number of requests increases, the proposed strategy reduces the response times to resource requests much more significantly compared with pure learning-based request forwarding strategy.作者: defendant 時間: 2025-3-29 12:01
Gossiping Correspondences to Reduce Semantic Heterogeneity of Unstructured P2P Systemsem so that peers become less disparate from each other. The experiments use the PeerSim simulator and ontologies from OntoFarm. The results show that CorDis significantly reduces some facets of semantic heterogeneity while the network traffic and the storage space are?bounded.作者: Calibrate 時間: 2025-3-29 19:25
Improving Learning-Based Request Forwarding in Resource Discovery through Load-Awareness account the loads on target nodes as well as their abilities in responding to requests based on their previous behaviors. Evaluations show that as the number of requests increases, the proposed strategy reduces the response times to resource requests much more significantly compared with pure learning-based request forwarding strategy.作者: CLEFT 時間: 2025-3-29 21:39
Resource Discovery Considering Semantic Properties in Data Grid Environments to another despite the dynamicity of nodes. The performance evaluation of the proposed method proved the discovery cost reduction especially for inter-ontology queries. They also provide a significant maintenance costs reduction of such system especially when peers frequently join / leave the system.作者: 智力高 時間: 2025-3-30 02:14 作者: precede 時間: 2025-3-30 05:42
