Client-based logging: a new paradigm for distributed transaction management

Abstract The proliferation of inexpensive workstations and networks has created a new era in distributed computing. At the same time, non-traditional applications such as computer-aided design (CAD), computer-aided software engineering (CASE), geographic- information systems (GIS), and office-information systems (OIS) have placed increased demands for high-performance transaction processing on database systems. The combination of these factors gives rise to significant challenges in the design of modern database systems. In this thesis, we propose novel techniques whose aim is to improve the performance and scalability of these new database systems. These techniques exploit client resources through client-based transaction management. Client-based transaction management is realized by providing logging facilities locally even when data is shared in a global environment. This thesis presents several recovery algorithms which utilize client disks for storing recovery related information (i.e., log records). Our algorithms work with both coarse and fine-granularity locking and they do not require the merging of client logs at any time. Moreover, our algorithms support fine-granularity locking with multiple clients permitted to concurrently update different portions of the same database page. The database state is recovered correctly when there is a complex crash as well as when the updates performed by different clients on a page are not present on the disk version of the page, even though some of the updating transactions have committed. This thesis also presents the implementation of the proposed algorithms in a memory-mapped storage manager as well as a detailed performance study of these algorithms using the OO1 database benchmark. The performance results show that client- based logging is superior to traditional server-based logging. This is because client-based logging is an effective way to reduce dependencies on server CPU and disk resources and, thus, prevents the server from becoming a performance bottleneck as quickly when the number of clients accessing the database increases.

[1]  Anupam Bhide,et al.  An efficient scheme for providing high availability , 1992, SIGMOD '92.

[2]  Euthimios Panagos,et al.  A high performance configurable storage manager , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[3]  Alexandros Biliris An efficient database storage structure for large dynamic objects , 1992, [1992] Eighth International Conference on Data Engineering.

[4]  Alexandros Biliris,et al.  Object Storage Management Architectures , 1993, NATO ASI OODBS.

[5]  Alexandros Biliris The performance of three database storage structures for managing large objects , 1992, SIGMOD '92.

[6]  Narain H. Gehani,et al.  Making C++ objects persistent: The hidden pointers , 1993, Softw. Pract. Exp..