The Experts below are selected from a list of 22212 Experts worldwide ranked by ideXlab platform

Bhavani Thuraisingham - One of the best experts on this subject based on the ideXlab platform.

  • necessary and sufficient conditions for transaction consistent global checkpoints in a Distributed Database system
    Information Sciences, 2009
    Co-Authors: Jiang Wu, D Manivannan, Bhavani Thuraisingham
    Abstract:

    Checkpointing and rollback recovery are well-known techniques for handling failures in Distributed Systems. The issues related to the design and implementation of efficient checkpointing and recovery techniques for Distributed Systems have been thoroughly understood. For example, the necessary and sufficient conditions for a set of checkpoints to be part of a consistent global checkpoint has been established for Distributed computations. In this paper, we address the analogous question for Distributed Database Systems. In Distributed Database Systems, transaction-consistent global checkpoints are useful not only for recovery from failure but also for audit purposes. If each data item of a Distributed Database is checkpointed independently by a separate transaction, none of the checkpoints taken may be part of any transaction-consistent global checkpoint. However, allowing individual data items to be checkpointed independently results in non-intrusive checkpointing. In this paper, we establish the necessary and sufficient conditions for the checkpoints of a set of data items to be part of a transaction-consistent global checkpoint of the Distributed Database. Such conditions can also help in the design and implementation of non-intrusive checkpointing algorithms for Distributed Database Systems.

  • transaction consistent global checkpoints in a Distributed Database system
    Lecture Notes in Engineering and Computer Science, 2008
    Co-Authors: Jiang Wu, D Manivannan, Bhavani Thuraisingham
    Abstract:

    Checkpointing and rollback recovery are well-known techniques for handling failures in Distributed Database Systems. In this paper, we establish the necessary and sufficient conditions for the checkpoints on a set of data items to be part of a transaction-consistent global checkpoint of the Distributed Database. This can throw light on designing efficient, non-intrusive checkpointing techniques and transparent recovery techniques for Distributed

Soon M Chung - One of the best experts on this subject based on the ideXlab platform.

  • enhanced tree quorum algorithm for replica control in Distributed Database Systems
    Data and Knowledge Engineering, 1994
    Co-Authors: Soon M Chung
    Abstract:

    Abstract In this paper, new replica control algorithms, called the enhanced tree quorum (ETQ) algorithm and the multiple tree quorum (MTQ) algorithm, are proposed to manage replicated data in Distributed Database Systems. These algorithms provide high availability for read and write operations by imposing a logical structure of modified tree with a backup root on data copies in ETQ, and multiple trees on data copies in MTQ. With ETQ algorithm, a read operation is limited to a data copy in the best case, and a write operation is allowed as long as one of the roots and the majority of the children of each node selected are available in the tree. With MTQ algorithm, a read operation is limited to a couple of data copies, and a write operation is allowed as long as the majority of the roots of the trees and the majority of the children of each node selected are available. Compared to other algorithms, ETQ and MTQ require lower message cost for an operation, while providing higher availability.

  • multiple tree quorum algorithm for replica in Distributed Database Systems
    1992
    Co-Authors: Soon M Chung, Cailin Cao
    Abstract:

    In this paper, a new replica control algorithm, called the multiple tree quorum (MTQ) algorithm, is proposed to manage replicated data in Distributed Database Systems. This algorithm provides a hlgh availability for read and write operations by imposing a logical strumre of multiple trees on data copies. With MTQ algorithm, a read operation is limited to a couple of data copies, and a write operation is allowed as long as the majority of the roots of the trees and the majority of the children of each node selected are available. Compared to other algorithms, MTQ requires lower message cost for an operation, while providing higher availability.

  • Multiple tree quorum algorithm for replica control in Distributed Database Systems
    [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992
    Co-Authors: Soon M Chung
    Abstract:

    A novel replica control algorithm, called the multiple tree quorum (MTQ) algorithm, is proposed to manage replicated data in Distributed Database Systems. This algorithm provides a high availability for read and write operations by imposing a logical structure of multiple trees on data copies. With the MTQ algorithm, a read operation is limited to a couple of data copies, and a write operation is allowed as long as the majority of the roots of the trees and the majority of the children of each node selected are available. Compared to other algorithms, the MTQ requires lower message cost for an operation while providing higher availability.

Jiang Wu - One of the best experts on this subject based on the ideXlab platform.

  • necessary and sufficient conditions for transaction consistent global checkpoints in a Distributed Database system
    Information Sciences, 2009
    Co-Authors: Jiang Wu, D Manivannan, Bhavani Thuraisingham
    Abstract:

    Checkpointing and rollback recovery are well-known techniques for handling failures in Distributed Systems. The issues related to the design and implementation of efficient checkpointing and recovery techniques for Distributed Systems have been thoroughly understood. For example, the necessary and sufficient conditions for a set of checkpoints to be part of a consistent global checkpoint has been established for Distributed computations. In this paper, we address the analogous question for Distributed Database Systems. In Distributed Database Systems, transaction-consistent global checkpoints are useful not only for recovery from failure but also for audit purposes. If each data item of a Distributed Database is checkpointed independently by a separate transaction, none of the checkpoints taken may be part of any transaction-consistent global checkpoint. However, allowing individual data items to be checkpointed independently results in non-intrusive checkpointing. In this paper, we establish the necessary and sufficient conditions for the checkpoints of a set of data items to be part of a transaction-consistent global checkpoint of the Distributed Database. Such conditions can also help in the design and implementation of non-intrusive checkpointing algorithms for Distributed Database Systems.

  • transaction consistent global checkpoints in a Distributed Database system
    Lecture Notes in Engineering and Computer Science, 2008
    Co-Authors: Jiang Wu, D Manivannan, Bhavani Thuraisingham
    Abstract:

    Checkpointing and rollback recovery are well-known techniques for handling failures in Distributed Database Systems. In this paper, we establish the necessary and sufficient conditions for the checkpoints on a set of data items to be part of a transaction-consistent global checkpoint of the Distributed Database. This can throw light on designing efficient, non-intrusive checkpointing techniques and transparent recovery techniques for Distributed

D Manivannan - One of the best experts on this subject based on the ideXlab platform.

  • necessary and sufficient conditions for transaction consistent global checkpoints in a Distributed Database system
    Information Sciences, 2009
    Co-Authors: Jiang Wu, D Manivannan, Bhavani Thuraisingham
    Abstract:

    Checkpointing and rollback recovery are well-known techniques for handling failures in Distributed Systems. The issues related to the design and implementation of efficient checkpointing and recovery techniques for Distributed Systems have been thoroughly understood. For example, the necessary and sufficient conditions for a set of checkpoints to be part of a consistent global checkpoint has been established for Distributed computations. In this paper, we address the analogous question for Distributed Database Systems. In Distributed Database Systems, transaction-consistent global checkpoints are useful not only for recovery from failure but also for audit purposes. If each data item of a Distributed Database is checkpointed independently by a separate transaction, none of the checkpoints taken may be part of any transaction-consistent global checkpoint. However, allowing individual data items to be checkpointed independently results in non-intrusive checkpointing. In this paper, we establish the necessary and sufficient conditions for the checkpoints of a set of data items to be part of a transaction-consistent global checkpoint of the Distributed Database. Such conditions can also help in the design and implementation of non-intrusive checkpointing algorithms for Distributed Database Systems.

  • transaction consistent global checkpoints in a Distributed Database system
    Lecture Notes in Engineering and Computer Science, 2008
    Co-Authors: Jiang Wu, D Manivannan, Bhavani Thuraisingham
    Abstract:

    Checkpointing and rollback recovery are well-known techniques for handling failures in Distributed Database Systems. In this paper, we establish the necessary and sufficient conditions for the checkpoints on a set of data items to be part of a transaction-consistent global checkpoint of the Distributed Database. This can throw light on designing efficient, non-intrusive checkpointing techniques and transparent recovery techniques for Distributed

Bharat Bhargava - One of the best experts on this subject based on the ideXlab platform.

  • global scheduling for flexible transactions in heterogeneous Distributed Database Systems
    IEEE Transactions on Knowledge and Data Engineering, 2001
    Co-Authors: Aidong Zhang, M Nodine, Bharat Bhargava
    Abstract:

    A heterogeneous Distributed Database environment integrates a set of autonomous Database Systems to provide global Database functions. A flexible transaction approach has been proposed for the heterogeneous Distributed Database environments. In such an environment, flexible transactions can increase the failure resilience of global transactions by allowing alternate (but in some sense equivalent) executions to be attempted when a local Database system fails or some subtransactions of the global transaction abort. We study the impact of compensation, retry, and switching to alternative executions on global concurrency control for the execution of flexible transactions. We propose a new concurrency control criterion for the execution of flexible and local transactions, termed F-serializability, in the error-prone heterogeneous Distributed Database environments. We then present a scheduling protocol that ensures F-serializability on global schedules. We also demonstrate that this scheduler avoids unnecessary aborts and compensation.