An extendible hashing based recovery method in a shared-nothing spatial database cluster

Authors:
Yong-Il Jang;Ho-Seok Kim;Soon-Young Park;Jae-Dong Lee;Hae-Young Bae
Affiliations:
Dept. of Computer Science and Information Engineering, INHA University, Incheon, Korea;Dept. of Computer Science and Information Engineering, INHA University, Incheon, Korea;Dept. of Computer Science and Information Engineering, INHA University, Incheon, Korea;Dept. of Information and Computer Science, DANKOOK University;Dept. of Computer Science and Information Engineering, INHA University, Incheon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2006

Citing 6
Cited 0

Parallel database systems: the future of database processing or a passing fad?

ACM SIGMOD Record - Directions for future database research & development
Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
A Scalable and Highly Available Networked Database Architecture

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The ClustRa Telecom Database: High Availability, High Throughput, and Real-Time Response

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Evaluating the Effectiveness of Fault Tolerance in Replicated Database Management Systems

FTCS '99 Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
The failure and recovery problem for replicated databases

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a recovery method using extendible hashing in a shared-nothing spatial database cluster is proposed. The purpose is to increase the recovery performance and to decrease overhead of the system. In the case of failure, the recovery method in a database cluster restores the database using replicated data from neighbor node. When detect a failure, neighbor node writes the cluster log, and it must be transferred to a failure node. However, in neighbor node, one transaction makes several logs, and increase transferring log size. Also, this increases the recovery time and overhead of the internal network. The proposed method defines a novel cluster log that is composed of update type and a pointer to a record through RID or primary key. This is managed by extendible hashing in main memory. The last transaction replaces the cluster log. Through sending of last updated data, the number of cluster logs and transaction count in failure node are decreased. As a result, the method in this paper increased the availability of the database cluster.