Transaction Management for a Distributed Object Storage System WAKASHI - Design, Implementation and Performance

Authors:
Ge Yu;Kunihiko Kaneko;Guangyi Bai;Akifumi Makinouchi
Affiliations:
-;-;-;-
Venue:
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Year:
1996

Citing 0
Cited 7

Performance evaluation of a parallel cascade semijoin algorithm for computing path expressions in object database systems

Journal of Computer Science and Technology
Parallel R-Tree Search Algorithm on DSVM

DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
M+-tree: a new dynamical multidimensional index for metric spaces

ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Integrating Parallel Functions into the Manipulation for Distributed Persistent Objects

COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Managing very large document collections using semantics

Journal of Computer Science and Technology
Using Object Deputy Model to Prepare Data for Data Warehousing

IEEE Transactions on Knowledge and Data Engineering
A hyperplane based indexing technique for high-dimensional data

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the transaction management in a high performance distributed object storage system WAKASHI. Unlike other systems that use centralized client/server architecture and offer conventional buffer management for distributed persistent object management, WAKASHI is based on symmetric peer-peer architecture and employs memory-mapping and distributed shared virtual memory techniques. Several novel techniques on transaction management for WAKASHI are developed. First, a multi-threaded transaction manager offers ``multi-threaded connection'' so that data control and transaction operations can be performed in parallel manner. Secondly, a concurrency control mechanism supports transparent page-level locks to reduce the complexity of user programs and locking overhead. Thirdly, a ``compact commit'' method is proposed to minimize the communication cost by reducing the amount of data and the number of connections. Fourthly, a redo-only recovery method is implemented by ``shadowed cache'' method to minimize the logging cost, and to allow fast recovery and system restart. Moreover, the system offers ``hierarchical'' control to support nested transactions. A performance evaluation by the OO7 benchmark is presented, as well.