JPS59212968A - File access system - Google Patents

File access system

Info

Publication number
JPS59212968A
JPS59212968A JP58085811A JP8581183A JPS59212968A JP S59212968 A JPS59212968 A JP S59212968A JP 58085811 A JP58085811 A JP 58085811A JP 8581183 A JP8581183 A JP 8581183A JP S59212968 A JPS59212968 A JP S59212968A
Authority
JP
Japan
Prior art keywords
processing
document data
sectors
information
idle
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP58085811A
Other languages
Japanese (ja)
Inventor
Yutaka Sato
裕 佐藤
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi Ltd filed Critical Hitachi Ltd
Priority to JP58085811A priority Critical patent/JPS59212968A/en
Publication of JPS59212968A publication Critical patent/JPS59212968A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Indexing, Searching, Synchronizing, And The Amount Of Synchronization Travel Of Record Carriers (AREA)

Abstract

PURPOSE:To shorten the processing time for an access system of a variable length file by detecting the idle sectors distributed continuously and processing these sectors with just a single access. CONSTITUTION:As shown in the figure, the information which sets the number of using blocks and the head block No. corresponding to each document data table is registered to a floppy disk together with the document data. The control is carried out on the basis of the block No. with all subsequent processings. The processing is performed in accordance with the idle control information which is read into a memory by the initial processing. Thus the head position of an idle sector is acquired, and the number of idle sectors continuous from said sector is counted. In such a way, the document data corresponding to a designated block No. is written to a floppy disk with the number of sectors defined as a processing unit. This processing is repeated by a frequency equivalent to the number of designated blocks. Thus all document data are written. Then the register processing is through by maintaining the idle control information and the directory information after adding finally the header information.

Description

【発明の詳細な説明】 〔発明の利用分野〕 本発明はフロンピディスクを外部記憶装置に持つファイ
ルの管理機能に係シ、特にセクタ単位に空の管理を行な
う可変長ファイルのアクセスに好適なファイルアクセス
方式に関する。
[Detailed Description of the Invention] [Field of Application of the Invention] The present invention relates to a file management function that has a floppy disk as an external storage device, and is particularly suitable for accessing variable-length files that manage empty space on a sector-by-sector basis. Regarding file access methods.

〔発明の背景〕[Background of the invention]

従来、セクタ単位で空の管理を行う可変長ファイルのア
クセス方式において、空が不連続に配置される可能性が
あるという理由によυ、アクセスの単位もセクタ単位の
処理を行なっていた。この場合、空が連続的に配置され
ている場合においても、アクセス間でのセクタ番号の更
新等の内部処理が発生し、無駄な回転待ち時間が生じ、
全体の処理時間に大きな影響を与えていた。
Conventionally, in a variable-length file access method that manages empty spaces in sectors, the access is performed in sector units because the empty areas may be disposed of discontinuously. In this case, even if the vacancies are arranged consecutively, internal processing such as updating sector numbers occurs between accesses, resulting in unnecessary rotational waiting time.
This had a significant impact on the overall processing time.

〔発明の目的〕[Purpose of the invention]

本発明の目的は、フロンピディスクへのデータのアクセ
スにおいて、そのアクセス回数を最少におさえることに
よシ処理時間を短縮するファイルアクセス方式を提供す
ることにある。
SUMMARY OF THE INVENTION An object of the present invention is to provide a file access method that reduces processing time by minimizing the number of accesses to a floppy disk.

し発明の概要〕 70ツビデイスクの処理時間で大きなウェイトを占める
のは回転待ち時間である。この回転待ち時間を発生させ
る原因はアクセス回数であり、従来、セクタ単位のアク
セスでは処理対象となるデータ量に比例したアクセス回
数となっていた。
Summary of the Invention] Rotation waiting time occupies a large portion of the processing time of a 70-tube disk. The cause of this rotational waiting time is the number of accesses, and conventionally, when accessing in units of sectors, the number of accesses was proportional to the amount of data to be processed.

本発明は、回転待ち時間を発生させる原因となるアクセ
ス回数を最少にすることを目的に、連続して配置されて
いる空セクタを1回のアクセスで処理することによシ処
理時間の短縮を計る。
The present invention reduces processing time by processing consecutively located empty sectors in one access, with the aim of minimizing the number of accesses that cause rotational waiting time. measure.

〔発明の実施例〕[Embodiments of the invention]

以下、本発明の一実施例を第1図よシ第1o図までによ
シ説明する。第1図は、本発明を適用した装置の一例を
示す構成図であム lは入力装置、2は表示装置、3は
印刷装置、4はメモリ、5は外部記憶装置としてのフロ
ッピディスク装置である。第2図は、メモリ4内の文書
データテーブルの構成図を示す。入力装置lよ多入力さ
れた文書情報は表示装置2に表示されると同時に第2図
に示す文書データテーブルにも格納され、オペレーター
は表示装置2に表示される文書情報を参照しながら文書
の作成を行なう。
Hereinafter, one embodiment of the present invention will be explained with reference to FIGS. 1 to 1o. FIG. 1 is a configuration diagram showing an example of a device to which the present invention is applied. l is an input device, 2 is a display device, 3 is a printing device, 4 is a memory, and 5 is a floppy disk device as an external storage device. be. FIG. 2 shows a configuration diagram of the document data table in the memory 4. As shown in FIG. The document information input from the input device 1 is displayed on the display device 2 and simultaneously stored in the document data table shown in FIG. Create.

このように作成した文書データを70ツピデイスク装置
5へ登録する場合には、文書データテーブル内の有効デ
ータのみを登録するために第3図に示すように第2図の
文書データをセクタ単位に移動しメモリ上に連続的に配
置させ、同時に、第4図に示すフロッピディスク上での
文書データの管理情報を作成する。第4図は、各文書デ
ータテーブルに対応する先頭ブロックNO,使用ブロッ
ク数を設定した情報であり、文書データと共にフロッピ
ディスクに登録され、以降の処理に対しては全てブロッ
クNOによシ管理される。プらツクNOはフロッピディ
スク上での論理的な位置情報でメジ、ブロック数はセク
タ数に等しい。
When registering the document data created in this way to the 70 disk drive 5, the document data in Figure 2 is moved sector by sector as shown in Figure 3 in order to register only valid data in the document data table. At the same time, management information for the document data on the floppy disk shown in FIG. 4 is created. Figure 4 shows information that sets the first block number and the number of used blocks corresponding to each document data table. It is registered on the floppy disk together with the document data, and all subsequent processing is managed by the block number. Ru. The program number is logical position information on the floppy disk, and the number of blocks is equal to the number of sectors.

以上のように登録の前処理を完了すると、文書名、総ブ
ロック数をパラメータとしてファイル管理部門に制御を
渡す。ファイル管理部門ではフロッピディスク上に書込
まれている各穐管理情報を参照しながら第3図に示す文
書データを登録する機能と、逆に、指定された文書を7
0ツピデイスクからメモリ4上に読込む機能を有する。
When the registration preprocessing is completed as described above, control is passed to the file management department using the document name and the total number of blocks as parameters. The file management department has a function to register the document data shown in Figure 3 while referring to each piece of management information written on the floppy disk, and conversely, a function to register the document data shown in Figure 3.
It has a function of reading data from the 0tsupid disk onto the memory 4.

本実施例では登録の手順について説明を行なうが読込む
手順も登録と同様の手順で実現可能である。登録手順を
説明する前にフロッピディスク上に書込まれている各種
管理情報についての説明を行なう。
In this embodiment, the registration procedure will be explained, but the reading procedure can also be realized by the same procedure as the registration. Before explaining the registration procedure, various management information written on the floppy disk will be explained.

第5図はフロッピディスク上でのデータの全体構成図を
示す。ボリュームラベルはこのフロッピディスクが文書
用の70ツピデイスクであることを示す識別名が書込ま
れている。空管理情報は、文書格納エリアのセクタ単位
の使用/未使用を示す情報であシ、その詳細を第6図に
示す。この情報は1ピントで1セクタの情報を表現し、
ビット位置とセクタ位置は相似関係にある。ヘッダー情
報は、各文書データの先頭に付加され、ブロックNOに
対するフロッピディスク上の位置(トラン1り、セクタ
)を示す情報であり、その構成を第7図に示す。ディレ
クトリ情報は各文書の見出し部でメジ、文書名、ヘッダ
ー位置、総セクタ数等のデータが哲理される。
FIG. 5 shows an overall configuration diagram of data on a floppy disk. An identification name indicating that this floppy disk is a 70-bit disk for documents is written on the volume label. The empty management information is information indicating whether the document storage area is used or not in sector units, and its details are shown in FIG. This information represents 1 sector of information with 1 focus,
The bit position and sector position have a similar relationship. The header information is information that is added to the beginning of each document data and indicates the position (tran 1, sector) on the floppy disk for the block number, and its structure is shown in FIG. Directory information includes data such as text, document name, header position, total number of sectors, etc. in the heading section of each document.

以上の各管理情報に基づき文書データを登録する場合の
手順について説明する。第8図は処理の全体の流れを、
第9図は、窒管理情報より空セクタを検出する過程の処
理の流れを示す。−第10図は、各管理情報の登録過程
におけるデータの変化と70ツヒデイスクへのアクセス
量を示した図である。初期処理でメモリに読込まれた空
管理情報をもとに、第9図に示す処理を実行すると、空
セクタの先頭位置(トランク2、セクタ5)が取得小米
、さらにこのをセクタよシ連続した空セクタ数をカウン
トすることにょシ、このセクタ数を処理単位とし、指定
されたブロックNOに対応する文書データをフロッピデ
ィスクに書込む。以上の処理を指定ブロック数“分繰返
すことによって全ての文書データが書込まれ、最後にヘ
ッダー情報を付加後、空管理情報、ディレクトリ情報を
メンテナンスし登録処理を完了する。
The procedure for registering document data based on the above management information will be explained. Figure 8 shows the overall flow of the process.
FIG. 9 shows the flow of processing in the process of detecting empty sectors from nitrogen management information. - FIG. 10 is a diagram showing changes in data during the registration process of each management information and the amount of access to the 70-day disk. When the process shown in Figure 9 is executed based on the empty management information read into the memory in the initial process, the start position of the empty sector (trunk 2, sector 5) is obtained, and this is further contiguous across sectors. By counting the number of empty sectors, this number of sectors is used as a processing unit, and the document data corresponding to the designated block number is written to the floppy disk. By repeating the above process for a specified number of blocks, all the document data is written, and finally, after adding header information, the empty management information and directory information are maintained, and the registration process is completed.

従来、フロッピディスクへのアクセス単位は1セクタの
みであシ、空セクタが連続して配置されている場合にお
いても断続的な処理になシ、アクセス回数も指定ブロッ
ク数分となシ回転待ち時間が全体の登録時間に大きな影
響を与えていた。しかし、本発明によれば連続している
空セクタを検出し、それを1回のアクセスにまとめるこ
とにょシ回転待ち時間を発生させる要因を最少におさえ
ることによシ全体の登録時間を短縮する効果がある。
Conventionally, the unit of access to a floppy disk was only one sector, and even when empty sectors were arranged consecutively, there was no intermittent processing, and the number of accesses was equal to the specified number of blocks.Rotation waiting time had a significant impact on the overall registration time. However, according to the present invention, by detecting consecutive empty sectors and combining them into one access, the overall registration time can be shortened by minimizing the factors that cause rotation waiting time. effective.

〔発明の効果〕〔Effect of the invention〕

本発明によれば、フロッピディスクの回転待ち時間を発
生させる要因となるアクセス回数を最少におさえること
によシ全体の処理時間を大巾に短縮することが可能であ
る。
According to the present invention, by minimizing the number of accesses that cause the rotational waiting time of the floppy disk, it is possible to significantly shorten the overall processing time.

また、本発明はファイル管理方法にはなれら影響を及ぼ
さないためいかなる機種にも対応出来、汎用性がきわめ
て高い。
Furthermore, since the present invention does not affect the file management method, it can be applied to any type of machine and has extremely high versatility.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は、本発明の実施例の機器構成図、第2図、第3
図はメモリ上での文書データ構成図、第4図は、文書デ
ータ管理情報の構成図、第5図は、フロッピディスク装
置のデータ構成図、第6図は、を管理情報の構成図、第
7図は、ヘッダー情報の構成図、第8図、第9図は、登
録の処理の流れを示す説明図、第10図は、登録過程に
おける各種情報の変化を示した表示図である。 l・・・入力装置、2・・・表示装置、3・・・印刷装
置、4・・・メモリ、5・・・フロッピディスク装置。 \ごと・′ 第1刃 茅4図 第50 第g図 第’i図 $70図
Figure 1 is an equipment configuration diagram of an embodiment of the present invention, Figures 2 and 3 are
Figure 4 is a configuration diagram of document data on memory, Figure 4 is a configuration diagram of document data management information, Figure 5 is a data configuration diagram of a floppy disk device, and Figure 6 is a configuration diagram of management information. FIG. 7 is a configuration diagram of header information, FIGS. 8 and 9 are explanatory diagrams showing the flow of registration processing, and FIG. 10 is a display diagram showing changes in various information during the registration process. 1... Input device, 2... Display device, 3... Printing device, 4... Memory, 5... Floppy disk device. \Goto・' 1st blade 4 Figure 50 Figure g Figure 'i Figure 70

Claims (1)

【特許請求の範囲】[Claims] 1、セクタ単位で空の管理を行う可変長ファイルのアク
セス回数において、連続的に配置されている空セクタを
検出する手段と、該セクタを1度のアクセスによシ処理
することによシ、処理時間の短縮を計ることを特徴とし
たファイルアクセス方式。
1. Means for detecting continuously located empty sectors in the number of accesses of a variable-length file that performs empty management on a sector-by-sector basis, and by processing the sectors in one access, A file access method characterized by shortening processing time.
JP58085811A 1983-05-18 1983-05-18 File access system Pending JPS59212968A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58085811A JPS59212968A (en) 1983-05-18 1983-05-18 File access system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58085811A JPS59212968A (en) 1983-05-18 1983-05-18 File access system

Publications (1)

Publication Number Publication Date
JPS59212968A true JPS59212968A (en) 1984-12-01

Family

ID=13869244

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58085811A Pending JPS59212968A (en) 1983-05-18 1983-05-18 File access system

Country Status (1)

Country Link
JP (1) JPS59212968A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7911885B2 (en) 2003-06-11 2011-03-22 Sony Corporation Recording control device and method, program, and recording medium

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7911885B2 (en) 2003-06-11 2011-03-22 Sony Corporation Recording control device and method, program, and recording medium

Similar Documents

Publication Publication Date Title
US5321558A (en) Method of storing data on a magnetic tape
JPS59212968A (en) File access system
JP3552318B2 (en) Document search method and system
JP2928169B2 (en) Data area management method on disk
JP2671298B2 (en) File management method
JP2649675B2 (en) Optical disk storage management method
JP2991482B2 (en) Numbering system
JPH01263714A (en) Information recording control system
JPH03225412A (en) File data read system
JPH03246645A (en) Data management system
JP2616203B2 (en) Management method of name table in translation system
JPH02116936A (en) Reorganizing system
JPS61283091A (en) Recording data access system for file device
JPS6055855B2 (en) Input data memory aggregation system
JPH02236754A (en) Information processor
JPH02220151A (en) Variable length data access system
JPH04355262A (en) Retrieval information saving system
JPH036634A (en) File storing system for floppy disk
JPH06337808A (en) Memory management system
JPH0279268A (en) Card type optical recording medium
JPH0498516A (en) Disk accessing system
JPH064384A (en) Image data managing system
JPS62128364A (en) Picture file device
JPH01248383A (en) Method for backup of data of optical disk
JPH03164839A (en) Data storage system