Titlebook: Data Management in Grid and Peer-to-Peer Systems; Third International Abdelkader Hameurlain,Franck Morvan,A Min Tjoa Conference proceeding

拐杖

书目名称Data Management in Grid and Peer-to-Peer Systems影响因子(影响力)




书目名称Data Management in Grid and Peer-to-Peer Systems影响因子(影响力)学科排名




书目名称Data Management in Grid and Peer-to-Peer Systems网络公开度




书目名称Data Management in Grid and Peer-to-Peer Systems网络公开度学科排名




书目名称Data Management in Grid and Peer-to-Peer Systems被引频次




书目名称Data Management in Grid and Peer-to-Peer Systems被引频次学科排名




书目名称Data Management in Grid and Peer-to-Peer Systems年度引用




书目名称Data Management in Grid and Peer-to-Peer Systems年度引用学科排名




书目名称Data Management in Grid and Peer-to-Peer Systems读者反馈




书目名称Data Management in Grid and Peer-to-Peer Systems读者反馈学科排名

悄悄移动

Contracture

Verification of General and Cyclic Covering Arrays Using Grid Computingre tested using a benchmark of CAs of variable strength. The main conclusion of the paper lies in the identification of the strengths and weakness of our algorithms (related to the values of the CA parameters).

有斑点

A Profile-Based Aggregation Model in a Peer-To-Peer Information Retrieval Systems article we define a new method for automatic aggregation of results which mixes these categories by allowing each peer to construct knowledge about other peers’ relevance model using a learning method (Formal Concept Analysis). The idea is that each peer constructs relationships between past queries, returned documents and contributed peers.

neutral-posture

虚弱

虚弱

Criteria

Volker Ruitinga,Emma Chris Avramieaper we present a caching strategy for improving response time during a query execution using a catalog with information of neighbors cached items, allowing the interaction between different cache levels. A performance evaluation using grids is provided to verify the improvement achieved.

Obsessed

https://doi.org/10.1007/978-1-4842-6264-1. More precisely, we describe methods to compute and approximate the mean time before the system loses data (.). We compare this metric for three placement policies: two of them ., in which the data is stored in logical peer neighborhoods, and one of them . in which fragments are parted uniformly at random among the different peers.

glowing

Coding Examples from Simple to Complexre tested using a benchmark of CAs of variable strength. The main conclusion of the paper lies in the identification of the strengths and weakness of our algorithms (related to the values of the CA parameters).