The Multi-list Structure and Information Retrieval

• Item type: InfP(1)
• 公開日: 1967-01-01
• タイトル: The Multi-list Structure and Information Retrieval
• タイトル / 言語: en
• タイトル: The Multi-list Structure and Information Retrieval
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Railway Technical Research Institute.
• 著者所属(英): en
• 著者所属(英): Railway Technical Research Institute.
• 著者名: Toshio, Nakanishi
• 著者名(英): Toshio, Nakanishi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Recently there is a tendency in the information processing by computer to attach special importance to the treatment of mass file.Especially in the real time processing as it is of vital importance to process any request as soon as it appears rapid file maintenance has become more and more essential.In general when we have gathered information we classify it into several groups according to the value of some attribute and keep them in separate files for the efficiency of business in other words due to the circumstances that an item of information is inserted and perhaps deleted once but it will be retrieved many times during its lifetime.Circumstances are almost the same with the information processing by computer although in computerized system it is more general to organize a file structure convenient for information retrieval.In case that an item has several attributes the complete classification of data items is very troublesome and awkward and is also unadvisable from the viewpoint of memory efficiency.The multi-list structure is a method proposed in place of classification.There are several methods to organize the multi-list file for example a method by tree1)(especially ballanced tree2)).In this article we propose the chaining method to organize multi-list file and various IR techniques available only in the multi-list structure are discussed.At the end its application in the patent information retrieval system is described.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Recently there is a tendency in the information processing by computer to attach special importance to the treatment of mass file.Especially in the real time processing,as it is of vital importance to process any request as soon as it appears,rapid file maintenance has become more and more essential.In general,when we have gathered information,we classify it into several groups according to the value of some attribute,and keep them in separate files for the efficiency of business,in other words,due to the circumstances that an item of information is inserted and perhaps deleted once,but it will be retrieved many times during its lifetime.Circumstances are almost the same with the information processing by computer,although in computerized system it is more general to organize a file structure convenient for information retrieval.In case that an item has several attributes,the complete classification of data items is very troublesome and awkward and is also unadvisable from the viewpoint of memory efficiency.The multi-list structure is a method proposed in place of classification.There are several methods to organize the multi-list file,for example a method by tree1)(especially ballanced tree2)).In this article we propose the chaining method to organize multi-list file,and various IR techniques available only in the multi-list structure are discussed.At the end its application in the patent information retrieval system is described.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA00674393
• 書誌情報: Information Processing in Japan; 巻 7, 号 0, p. 10-17, 発行日 1967-01-01
• 出版者 / 言語: ja
• 出版者: 情報処理学会