Decentralized coordination of transactional processes in peer-to-peer environments

Haller, Klaus; Schuldt, Heiko; Türker, Can

doi:10.1145/1099554.1099563

Cited by 44 publications

(42 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The solution proposed in [15] can be adapted. Also, in order to fully distribute the transaction processing, ideas presented in [24] can be borrowed. Note that, no grid solution supports many update nodes with serialization guarantees yet.…”

Section: Transition From a Database Cluster To The Gridmentioning

confidence: 99%

Toward replication in grids for digital libraries with freshness and correctness guarantees

Akal

Schuldt

Schek

2008

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

SUMMARYBuilding digital libraries (DLs) on top of data grids while facilitating data access and minimizing access overheads is challenging. To achieve this, replication in a Grid has to provide dedicated features that are only partly supported by existing Grid environments. First, it must provide transparent and consistent access to distributed data. Second, it must dynamically control the creation and maintenance of replicas. Third, it should allow higher replication granularities, i.e. beyond individual files. Fourth, users should be able to specify their freshness demands, i.e. whether they need most recent data or are satisfied with slightly outdated data. Finally, all these tasks must be performed efficiently. This paper presents an approach that will finally allow one to build a fully integrated and self-managing replication subsystem for data grids that will provide all the above features. Our approach is to start with an accepted replication protocol for database clusters, namely PDBREP, and to adapt it to the grid.

show abstract

Section: Transition From a Database Cluster To The Gridmentioning

confidence: 99%

Toward replication in grids for digital libraries with freshness and correctness guarantees

Akal

Schuldt

Schek

2008

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently Haller et al have proposed to apply it [8] to large-scale systems, but their solution does not handle replication, nor faults.…”

Section: Concluding Remarks 41 Related Workmentioning

confidence: 99%

Fault-Tolerant Partial Replication in Large-Scale Database Systems

Sutra

Shapiro

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We investigate a decentralised approach to committing transactions in a replicated database, under partial replication. Previous protocols either reexecute transactions entirely and/or compute a total order of transactions. In contrast, ours applies update values, and generate a partial order between mutually conflicting transactions only. It results that transactions execute faster, and distributed databases commit in small committees. Both effects contribute to preserve scalability as the number of databases and transactions increase. Our algorithm ensures serializability, and is live and safe in spite of faults.

show abstract

“…The long-running, asynchronous nature of SOA application processes exacerbates problems of multidatabase transaction management. Thus, the traditional notion of transactions has been augmented to address problems of SOAs [18,17,8,12,4]. Much of this work focuses on seamless multidatabase operations in scenarios where the collection of databases being accessed changes dynamically during execution.…”

Section: Related Workmentioning

confidence: 99%