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.
This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bamford, R., Ahad, R., Pruscino, A.: A Scalable and Highly Available Networked Database Architecture. In: Proc. of the 25th VLDB Conference, Edinburgh, Scotland (1999)
Bernstein, P.A., Goodman, N.: The Failure and Recovery Problem for Replicated Databases. In: Second ACM Symposium on the Principles of Distributed Computing (1983)
Bratsberg, S.E., Hvasshovd, S.-O., Torbjornsen, O.: Parallel Solutions in ClustRa. IEEE Computer Society Technical Committe on Data Engineering (1997)
DeWitt, D.J., Gray, J.: Parallel Database Systems: The Future of Database Processing or a Passing Fad? ACM SIGMOD Record, Special Issue on Directions for Future Database Research and Development
Hvasshovd, S.-O., Torbjornsen, O., Bratsberg, S.E.: The ClustRa Telecom Database: High Availability, High Throughput, and Real-Time Response. In: Proc. of the 21st VLDB Conference (1995)
Fagin, R., Nievergelt, J., Pippenger, N., Raymond Strong, H.: Extendible hashing: A Fast Access Method for Dynamic Files. ACM Transactions on Database Systems (1979)
Jimenez-Peris, R., Patino-Martinez, M., Alonso, G.: An Algorithm for Non-Intrusive, Parallel Recovery of Replicated Data and its Correctness. In: IEEE Symp. on Reliable Distributed Systems (2002)
Lee, C.-H.: A Partial Replication Protocol and a Dynamically Scaling Method for Database Cluster Systems, PhD thesis, Department of Computer Science & Information Engineering, Inha Univ., Korea (2003)
Ryu, B.-S.: The Collaborative Cluster Recovery Method of a Shared-Nothing Spatial Database Cluster, Master thesis, Department of Computer Science & Information Engineering, Inha Univ., Korea (2004)
Sabaratnam, M., Torbjornsen, O.: Evaluating the Effectiveness of Fault Tolerance in Replicated Database Management Systems. In: Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (1999)
Torbjornsen, O., Hvasshovd, S.-O., Kim, Y.-K.: Towards Real-Time Performance in a Scalable, Continuously Available Telecom DBMS, ClustRa (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jang, YI., Kim, HS., Park, SY., Lee, JD., Bae, HY. (2006). An Extendible Hashing Based Recovery Method in a Shared-Nothing Spatial Database Cluster. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751632_121
Download citation
DOI: https://doi.org/10.1007/11751632_121
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34077-5
Online ISBN: 978-3-540-34078-2
eBook Packages: Computer ScienceComputer Science (R0)