A Solution for Fault-Tolerance in Replicated Database Systems

2003 ◽  
pp. 411-422
Author(s):  
Changgui Chen ◽  
Wanlei Zhou
Keyword(s):  
Fault Tolerance ◽  
Database Systems

scholarly journals Smart Intra-query Fault Tolerance for Massive Parallel Processing Databases

2019 ◽  
Vol 5 (1) ◽  
pp. 65-79
Author(s):  
Yunhong Ji ◽  
Yunpeng Chai ◽  
Xuan Zhou ◽  
Lipeng Ren ◽  
Yajie Qin
Keyword(s):  
Cost Effectiveness ◽  
Fault Tolerance ◽  
Parallel Processing ◽  
Query Processing ◽  
Success Rate ◽  
Database Systems ◽  
Analytical Processing ◽  
Commodity Clusters ◽  
Massive Parallel Processing ◽  
Query Latency

AbstractIntra-query fault tolerance has increasingly been a concern for online analytical processing, as more and more enterprises migrate data analytical systems from mainframes to commodity computers. Most massive parallel processing (MPP) databases do not support intra-query fault tolerance. They may suffer from prolonged query latency when running on unreliable commodity clusters. While SQL-on-Hadoop systems can utilize the fault tolerance support of low-level frameworks, such as MapReduce and Spark, their cost-effectiveness is not always acceptable. In this paper, we propose a smart intra-query fault tolerance (SIFT) mechanism for MPP databases. SIFT achieves fault tolerance by performing checkpointing, i.e., materializing intermediate results of selected operators. Different from existing approaches, SIFT aims at promoting query success rate within a given time. To achieve its goal, it needs to: (1) minimize query rerunning time after encountering failures and (2) introduce as less checkpointing overhead as possible. To evaluate SIFT in real-world MPP database systems, we implemented it in Greenplum. The experimental results indicate that it can improve success rate of query processing effectively, especially when working with unreliable hardware.

A solution for fault tolerance in replicated database systems

2006 ◽  
Vol 2 (1/2) ◽  
pp. 64
Author(s):  
Changgui Chen ◽  
Wanlei Zhou
Keyword(s):  
Fault Tolerance ◽  
Database Systems

scholarly journals A Review on Fault Tolerance in Distributed Database

2021 ◽  
Vol 10 (3) ◽  
pp. 1533-1536
Keyword(s):  
Fault Tolerance ◽  
Fault Detection ◽  
Database Systems ◽  
Distributed Database ◽  
System Failure ◽  
Failure Detector ◽  
Detection Techniques ◽  
Distributed Database Systems ◽  
Recovery Techniques ◽  
Different Types

In this paper, we study about the different types of fault tolerance techniques which are used in various distributed database systems. The main focus of this research is about how the data are storedin the servers, fault detection techniques and the recovery techniques used. A fault can occur for many reasons. For example, system failure, resource failure, network between the server’s failure and any other reasons. These faults must be emphasis in order to make sure the system can work smoothly without any problem. A proper failure detector and a reliable fault tolerance technique can avoid loss and at once save the system from fail.

Optimal Compensation for Hierarchical Web Services Compositions Under Restricted Visibility

2011 ◽  
Vol 3 (4) ◽  
pp. 22-38 ◽  
Author(s):  
Debmalya Biswas ◽  
Krishnamurthy Vidyasankar
Keyword(s):  
Fault Tolerance ◽  
Web Services ◽  
Web Service ◽  
Database Systems ◽  
Privacy And Security ◽  
Organizational Boundaries ◽  
Composite Service ◽  
Composite Services ◽  
Reliability And Robustness ◽  
Different Levels

Over the years, the notion of transactions has become synonymous with providing fault-tolerance, reliability and robustness to database systems. To extend the same transactional guarantees to new and evolving paradigms, such as Web service, the transactional mechanisms must first be adapted to the distinguishing characteristics of Web services, mainly composability, long-running nature, and privacy and security concerns. Composability refers to the ability to form new composite services by combining the functionalities of existing services. Due to their long-running nature, compensation based mechanisms are usually preferred to provide transactional guarantees for Web services. Compensation requires access (visibility) over the execution details of the services in the composition. However, such visibility may not always be feasible in a compositional context where component services are provided by different providers across organizational boundaries, with very strong privacy and security constraints. This paper looks at compensation options for Web services in a hierarchical composition. Multiple compensation options may be available for a composite service both at the same level and at different levels of the hierarchy. This paper shows how to find an optimal compensation option under restricted visibility.

Formal Development of Fault Tolerance by Replication of Distributed Database Systems

2021 ◽  
pp. 293-306
Author(s):  
Rasin Katta ◽  
Ammar Alhaj Ali ◽  
Bronislav Chramcov ◽  
Said Krayem ◽  
Roman Jasek
Keyword(s):  
Fault Tolerance ◽  
Database Systems ◽  
Distributed Database ◽  
Distributed Database Systems ◽  
Formal Development

Optimal Compensation for Hierarchical Web Services Compositions under Restricted Visibility

2013 ◽  
pp. 205-222
Author(s):  
Debmalya Biswas ◽  
Krishnamurthy Vidyasankar
Keyword(s):  
Fault Tolerance ◽  
Web Services ◽  
Web Service ◽  
Database Systems ◽  
Privacy And Security ◽  
Organizational Boundaries ◽  
Composite Service ◽  
Composite Services ◽  
Reliability And Robustness ◽  
Different Levels

Over the years, the notion of transactions has become synonymous with providing fault-tolerance, reliability and robustness to database systems. To extend the same transactional guarantees to new and evolving paradigms, such as Web service, the transactional mechanisms must first be adapted to the distinguishing characteristics of Web services, mainly composability, long-running nature, and privacy and security concerns. Composability refers to the ability to form new composite services by combining the functionalities of existing services. Due to their long-running nature, compensation based mechanisms are usually preferred to provide transactional guarantees for Web services. Compensation requires access (visibility) over the execution details of the services in the composition. However, such visibility may not always be feasible in a compositional context where component services are provided by different providers across organizational boundaries, with very strong privacy and security constraints. This paper looks at compensation options for Web services in a hierarchical composition. Multiple compensation options may be available for a composite service both at the same level and at different levels of the hierarchy. This paper shows how to find an optimal compensation option under restricted visibility.

Sign in / Sign up

Export Citation Format

Share Document