scispace - formally typeset
A

A. Makinouchi

Researcher at Kyushu University

Publications -  17
Citations -  82

A. Makinouchi is an academic researcher from Kyushu University. The author has contributed to research in topics: Object-oriented programming & Load balancing (computing). The author has an hindex of 4, co-authored 17 publications receiving 79 citations. Previous affiliations of A. Makinouchi include Kurashiki University of Science and the Arts.

Papers
More filters
Proceedings ArticleDOI

Transaction management for a distributed object storage system WAKASHI-design, implementation and performance

TL;DR: This paper presents the transaction management in a high performance distributed object storage system WAKASHI, based on symmetric peer-peer architecture and employs memory-mapping and distributed shared virtual memory techniques, which offers "hierarchical" control to support nested transactions.
Proceedings ArticleDOI

Design and implementation of multiple type objects in a persistent programming language

TL;DR: Design of multiple type objects in INADA, an object oriented persistent programming language, which borrows the object model of C++ and extends it to provide facilities needed for processing on a large amount of persistent objects.
Proceedings ArticleDOI

Structured document framework for design patterns based on SGML

TL;DR: A framework to describe patterns as structured documents based on SGML (Structured Generalized Markup Language) is presented, which has three elements: texts, configuration charts and pseudo-codes, therefore SGML schemes are proposed for them respectively so that they are integrated into a single structured document.
Book ChapterDOI

Several Implementations of Persistent Pointers in a Memory-Mapped I/O Environment

TL;DR: Performance experiments are described to compare several techniques of dereferencing persistent pointers including swizzling and nonswizzling approaches in a memory-mapped I/O environment, and discusses trade-offs among them.
Proceedings ArticleDOI

Data storage and query processing for structured document databases

TL;DR: It is concluded that the query processors for full-text searching and structural searching can be combined easily in the dynamic extraction approach.