서지주요정보
객체지향 데이타베이스 시스템에서 지속성 객체와 객체 버퍼 관리 = Persistent object and object buffer management in object-oriented database systems
서명 / 저자 객체지향 데이타베이스 시스템에서 지속성 객체와 객체 버퍼 관리 = Persistent object and object buffer management in object-oriented database systems / 박종목.
저자명 박종목 ; Park, Chong-Mok
발행사항 [대전 : 한국과학기술원, 1997].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8007242

소장위치/청구기호

학술문화관(문화관) 보존서고

DCS 97015

SMS전송

도서상태

이용가능

대출가능

반납예정일

등록번호

9003978

소장위치/청구기호

서울 학위논문 서가

DCS 97015 c. 2

SMS전송

도서상태

이용가능

대출가능

반납예정일

초록정보

Orthogonal persistence, a property that any object can be made to persist independent of its type, is an important requirement for a persistent language. In this dissertation, we present a new technique called forced inheritance for providing orthogonal persistence to C++. This method achieves both orthogonal persistence and portability of application programs, which previous methods have not been able to provide together. In this technique, properties that make objects persist are attached as a header to an object or to a value of any type that is desired to persist. Attaching the header gives the effect of inheriting these properties from a virtual persistent root class regardless of its type. This technique provides orthogonal persistence since attaching the header to an object can be done for any object. It also provides portability since it does not extend the language. We have also developed an object-oriented database system prototype using forced inheritance and have proved the feasibility and effectiveness of the method. To provide an illusion of infinite virtual memory for applications dealing with persistent objects, it is essential to manage an object buffer whose unit of replacement is a persistent object. Previous buffer replacement algorithms for managing fixed-length pages assume that the total cost is proportional to the number of buffer faults. However, in an object buffer, this assumption no longer holds since the objects are of variable-lengths and the cost of replacing an object varies for each object. In this dissertation, we propose a new replacement algorithm suitable for object buffers. Based on a new cost model including the replacement cost and the sizes of objects, the proposed algorithm, which we name the Cost-based Object Buffer Replacement Algorithm(Cobra), tries to minimize the total expected cost. This algorithm replaces the objects that have minimum costs per unit time and unit space. The proposed model extends those of previous page-based algorithms by taking into account different sizes and different replacement costs of objects. The performance tests show that Cobra is almost always superior to LRU and LRU-k algorithms. Cobra is applicable in any applications in which previous approaches have been. It is especially useful in object-oriented database systems, in which replacement costs of objects vary significantly.

서지기타정보

서지기타정보
청구기호 {DCS 97015
형태사항 vii, 100 p. : 삽도 ; 26 cm
언어 한국어
일반주기 부록 : A, 휘발성 타입을 시뮬레이션 하는 예
저자명의 영문표기 : Chong-Mok Park
지도교수의 한글표기 : 황규영
지도교수의 영문표기 : Kyu-Young Whang
수록 잡지명 : "Forced Inheritance: A New Approach for Providing Orthogonal Persistence to C++". Journal of Object-Oriented Programming. A SIGS Publication, vol 9, no. 1, pp. 65-71
학위논문 학위논문(박사) - 한국과학기술원 : 전산학과,
서지주기 참고문헌 : p. 87-96
주제 객체지향 데이타베이스 시스템
지속성 객체
직교적 지속성
객체 버퍼 교체
비용기반 교체
Object-oriented database systems
Persistent objects
Orthogonal persistence
Object buffer replacement
Cost-based replacement
QR CODE qr code