http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 夫起東 (검색결과 75 건)
- 무료
- 기관 내 무료
- 유료
-
부기동,이상조(Kidong Bu),Sangjo Lee 한국정보과학회 1996 정보과학회논문지(B) Vol.23 No.2
객체지향 데이타베이스 관리시스템의 설계시 중요한 사항은 저장된 데이타에 대한 좋은 접근 전략을 갖도록 하는 것이다. 지금까지 이러한 목적으로 여러가지 색인 기법이 개발되었으나, 이러한 기법들은 객체지향 데이타 모델의 집단화 계층이나 상속 계층중 어느 한가지만을 고려하는 경우가 대부분이었다. 본 연구에서는 집단화 계층과 상속 계층을 동시에 접근하는 질의를 효율적으로 평가할 수 있는 다중 링 색인 기법을 제시하였다. 제안된 기법의 효용성을 기존의 색인 기법들과 다양하게 비교하였으며, 저장 비용과 검색비용 측면에서 그 성능을 시뮬레이션한 결과를 제시하였다. One of the important points of designing an OODBMS is to have a good access method for stored data. Up to present, several indexing schemes have been developed for this purpose. However, they are separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. This paper proposes a multiring indexing technique accessing both aggregation and inheritance hierarchies, which effectively evaluates queries. This paper variously compares the usefulness of the proposed scheme with some existing schemes. It also provides the result of simulating its performance in terms of storage and retrieval costs.
-
夫起東 慶一大學校 1999 論文集 Vol.16 No.6
One of the most important issues of GIS spatial databases is to develope an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. This thesis proposes a relational table indexing. This indexing scheme could fetch the OID list of objects to be retrieved more easily than before. This study evaluates the performance of a relational indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the relational table indexing is proved to be more efficient with regard to storage cost than nested inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.
-
타임스탬프 병행성 제어하에서 비용을 고려한 트랜잭션의 철회전략
夫起東 慶一大學校 1988 論文集 Vol.4 No.1
In conventional timestamp ordering concurrency contol mechanisms of multi-user database system always rollback old transactions, when there is a conflict between a young transaction and an old transaction. Hence a long transactions with high conflict probability may not be completed and restart of old transactions costs more than restart of young transactions. Therefore in this paper try to rollback a young transaction if possible. In order to realize this mechanism we define cost effective function for select a transaction to be rolled back when there exists a conflict. Furthermore We introduce partial rollback which save overhead caused by rolling back young transaction.
-
夫起東 慶一大學校 1992 論文集 Vol.8 No.1
This paper present an indexing technique providing efficient support for object-oriented databases. This scheme supports a fast evaluation of nested predicates for queries involving class hierarchies. A preliminary comparison of the proposed indexing techinique with other techniques has then been presented. And also, this work is to define cost fomulas for proposed index organization and to compare it with other organization, such as class hierarchy index and nested attribute index.
-
객체지향 데이타베이스에서 집단화 및 상속계층에 대한 효율적인 색인기법
夫起東 慶一大學校 1994 論文集 Vol.10 No.1
One of the important points of designign an OODBMS is to have a good acces to stored data. Up to present, several indexing schemes have been developed for this purpose. However, they are seperately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. This paper preposes a multiring indexing technique accessing both aggregation and inheritance hierarchies, which effectively evaluates queries. This paper varioulsy compares the usefulness of the proposed scheme with some existing schemse. The results of simulagtions in this study indicate the improved performance in terms of storage and retrival costs.
-
객체 중심 테이타베이스 시스템에서 � 저장 구조의 회복 관리
夫起東 慶一大學校 1989 論文集 Vol.5 No.1
Object-oriented databases are needed to support database object with wide variety of types and structures. A heap-storage structure provides a memory architecture for long-term, reliable retention of objects with rich types and structures. This paper presents garbage collection and recovery algorithms for managing stable heap in which accessible objects survive both system crashes and media failures. A garbage collector typically both move and modifies objects which can lead to problems when the heap is stable because a system crash after the start of collection but before enough of the recoganized heap reachs the disk can leave the disk in an inconcistent state. A collection algorithm and recovery management system solves these problems.
-
다중 사본 데이타베이스의 신뢰성 있는 연쇄 갱신 프로토콜
夫起東 慶一大學校 1990 論文集 Vol.6 No.1
This paper presents a reliable protocol that quarantees the transmission of a cascading update message to its destination despite failures in one or more sites in a system of multiple copy databases. This protocol is distinquished by not using extra logging devices or checkpoint facilities that are common to many protocols of its type. Instead, it maintains an appropriate number of copies of the message in sites where the message passes. In the case of a failure, the cascading update protocol locates a copy of the message closest to the destination, and resumes transmission of the message from this location.
-
객체지향프로그래밍 시스템과 데이타베이스의 통합환경에서 개선된 이단계 버퍼링 기법
夫起東 慶一大學校 1993 論文集 Vol.9 No.1
This study presents an improved dual buffering technique providing efficient support Object-Oriented Programming System with a database system. The dual buffer space of OOP environment is partitioned into page buffer pool and object buffer pool. Page buffer manager manages a hash queue of page frame buffers and implements a LRU page replacement algorithm. This paper discusses applying the advanced structure of the hash queue and the improved methods by which the page buffer manager locates blocks in the hash queue. This methods uses efficient LRU algorithm to keep blocks by free list structure on hash queue.
-
-
의미적 구조적 지식에 기반한 확장된 질의 최적화의 구현
李두漢,權六春,夫起東 慶一大學校 1998 論文集 Vol.15 No.1
In this paper, we implement the method that transforms equivalent optimized queries by using semantic knowledge. Also we implement the mechanism which transforms simple query into general SQL query. To transform and optimize simple query, we use semantic and structural knowledge. Semantic knowledge includes semantic integrity constraints and domain integrity constraints. Structural knowledge represents physical relationship between relations. We verify that the method optimize simple query through experiment.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
