(A) two level mapped random file structure

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 486
  • Download : 0
File structures and the factors that affect the performances of file organizations are investigated. All of the basic file organizations, which are sequential file, indexed sequential do not permit the multiply and generic keyed records. The linked and inverted list file structures have emerged in the hope of alleviating these problems, but these file structures may spoil seriously the time and storage efficiency if the amount of data becomes heavily increased and the length of the records increases. A new file structure, a two level mapped random file, named PIS, is developed in this dissertation. In order to test the performance of the PIS file structure, we developed an experimental in formation retrieval system, ADAM, in which a data base contains the computer science related articles published in recent years in the Journal and Communications of the Associations for Computing Machinery(JACM and CACM). With this system, a record or a generic records set can be retrieved with author key(s) or/and subject key(s). Through the actual simulation run with ADAM, the performance of the PIS file organization is proven to be better than that of the other file organizations.
Advisors
Cho, Jung-Wan조정완
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1975
Identifier
61863/325007 / 000731036
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 1975.8, [ [iii], 92, [iv] p. ]

URI
http://hdl.handle.net/10203/33433
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61863&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0