Titlebook: Data Management in Grid and Peer-to-Peer Systems; Second International Abdelkader Hameurlain,A Min Tjoa Conference proceedings 2009 Springe

locus-ceruleus

Data Management in Grid and Peer-to-Peer Systems978-3-642-03715-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

Hallmark

https://doi.org/10.1007/978-3-642-03715-3Service-oriented Computing; adaptive query processing; benchmarking; cost models; data privacy; data secu

nostrum

Merited

Digitalis

Jessica Wilen Berg,Richard J. Bonniefficient query execution. The vast majority of these techniques assume workloads of rather small transactional tasks with strong requirements for ACID properties. However, the emergence of new computing paradigms, such as grid and cloud computing, the increasingly large volumes of data commonly proc

剝削

擁護(hù)

Coercion and Aggressive Community Treatmenty limited to connecting data sources to the Grid via service- or document-oriented interfaces. This approach hardly implements the idea of virtualized, easy-to-use resources. We propose a virtual data source that provides structured data according to user demands instead of forcing users to adapt to

人造

Coercion, Authority and Democracytributed hash tables (DHTs), could be one of the enabling technologies for the Semantic Web. Several DHT based RDF triple stores have been proposed but despite their differences they all process queries sequentially and hence leave an untapped potential for parallelism. This paper proposes and analy

鍵琴

Virginie Baritaux,Marie Houdartkinds of applications are more sophisticated and demanding on data volume to be handled as well as their location. A cache is quite interesting within these applications since a cache reduces the latency experienced by users. Nevertheless, configuring a suitable cache is not a trivial issue due to t

得體

Véronique Lucas,Pierre Gasselinorithm features a replica density estimation and a space filling mechanism designed to avoid redundant messages. Not only it provides uniform replication of the data stored into the network but it also improves on classical flooding approaches by removing any redundancy. This last property is obtain