(A) study on nonredundant allocation of files in distributed systems = 분산 체제하에서 비 중복 화일 할당에 관한 연구

The problem of file allocation is a very important problem in designing a distributed database. In this thesis, the problem of allocating file nonredundantly has been dealt with. An algorithm for the nonreplicated allocation of files is proposed. This algorithm can be used for the partitioned allocation of files as well as for the non-partitioned allocation of files. And this algorithm considers the interaction between files by allowing a query or an update to refer several files. It has been shown that the proposed algorithm is computationally feasible and its solution is near optimal. Two properties of the proposed algorithm are shown to guarantee the convergence of the algorithm. The proposed algorithm is flexible and easy to impement since it obtains a solution by the location adjustment for files one at a time. The proposed algorithm is implemented in PASCAL.
Advisors
Moon, Song-Chunresearcher문송천researcher
Publisher
한국과학기술원
Issue Date
1987
Identifier
65665/325007 / 000851053
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 1987.2, [ [iii], 40, [4] p. ; ]

Keywords

분산 데이터베이스 시스템.

URI
http://hdl.handle.net/10203/33722
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=65665&flag=t
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.
  • Hit : 128
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0