Nothing Special   »   [go: up one dir, main page]

JPS601670B2 - Processing data transmission method - Google Patents

Processing data transmission method

Info

Publication number
JPS601670B2
JPS601670B2 JP55105416A JP10541680A JPS601670B2 JP S601670 B2 JPS601670 B2 JP S601670B2 JP 55105416 A JP55105416 A JP 55105416A JP 10541680 A JP10541680 A JP 10541680A JP S601670 B2 JPS601670 B2 JP S601670B2
Authority
JP
Japan
Prior art keywords
data
terminal
file
processing
branch
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.)
Expired
Application number
JP55105416A
Other languages
Japanese (ja)
Other versions
JPS5730029A (en
Inventor
明弘 山本
茂 高山
俊治 望月
剛 増田
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.)
Fujitsu Ltd
Original Assignee
Fujitsu 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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP55105416A priority Critical patent/JPS601670B2/en
Publication of JPS5730029A publication Critical patent/JPS5730029A/en
Publication of JPS601670B2 publication Critical patent/JPS601670B2/en
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Memory System (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Description

【発明の詳細な説明】 本発明は、センタと複数の支店との間の処理データ伝送
方式に関する。
DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a process data transmission system between a center and multiple branches.

支店、営業所等にインテリジェント端末をおき、センタ
CPU側には配信ファイルを置き、在庫管理等に関する
諸データを配信ファイルに書込んでおいて随時端末から
これを論取らせるデータ伝送システムでは、該配信ファ
イルのメモリ領域は端末毎に固定的に区分しておくとフ
ァイルの管理は簡単である。
In a data transmission system, an intelligent terminal is placed at a branch office, sales office, etc., a distribution file is placed on the center CPU side, various data related to inventory management, etc. are written in the distribution file, and this can be discussed from the terminal at any time. If the memory area for distributed files is fixedly divided for each terminal, file management will be easy.

しかし、この方式では配信すべきデータがない端末に対
しても配信ファイル上では所定の大きさのメモリ領域を
空けておか紬まならず、一方、該所定の大きさのメモリ
領域は多量に配信データがある端末を基準にして決定せ
ねばならないから、配信ファイルとしては大容量である
ことが必要になる。配信データは、各支店毎、季節毎等
で大きな変動があり、ある支店に対する配信デー外ま多
量であるのに他の支店に対する配信デー外ま少量であり
、しかもそれが日、月に応じて入れ換ったりする。従っ
て配信ファイルのメモリ領域を各端末に固定的に割当て
る方式では、無駄が多い。本発明はかかる点を改善しよ
うとするもので、配信ファイルのメモリ領域を各端末に
固定的に割当てることはせず、端末別、バッチ別に、そ
の都度割当てるようにし、その割当てる領域は、配信フ
ァイルに空エリア管理テーブルを設けておいて配信デー
タ作成時に該テーブルに登録されている空き領域から選
択するようにする。そして配信データを書込んだメモリ
領域のアドレスは、端末別データ管理テーブルを設けて
これに書込んでおき、端末からデータ送信要求があれば
この管理テーブルをみて当該端末に対する配信データを
配信ファイルから読み取り該端末へ送出するようにする
。このようにすれば配信データがある端末に配信ファイ
ルのメモリ領域を有効に割当てることができ、該ファイ
ルの容量を可及的に小にすることができる。以下図面を
参照しながらこれを詳細に説明する。図面でA,B,C
・・・・・・は各支店に置いたインテリジェントターミ
ナルであり、センタCPUIOと公衆回線を通して接続
される。
However, with this method, even if there is no data to be distributed to a terminal, a predetermined size of memory area must be left open in the distribution file; Since the decision must be made based on the terminal where the data is located, the distribution file must have a large capacity. Distribution data varies greatly depending on each branch, season, etc., and while there is a large amount of distribution data for one branch, there is a small amount of distribution data for other branches, and it varies depending on the day or month. I'll replace it. Therefore, the method of fixedly allocating the memory area of the distribution file to each terminal is wasteful. The present invention aims to improve this problem, and instead of allocating the memory area of the distribution file to each terminal in a fixed manner, it is allocated each time for each terminal or batch, and the allocated area is the area for the distribution file. An empty area management table is provided in the system, and when creating distribution data, selection is made from the empty areas registered in the table. Then, the address of the memory area where the distribution data is written is written in a data management table for each terminal, and when a data transmission request is received from a terminal, this management table is checked and the distribution data for that terminal is transferred from the distribution file. The data is read and sent to the corresponding terminal. In this way, the memory area for the distribution file can be effectively allocated to the terminal where the distribution data is stored, and the capacity of the file can be made as small as possible. This will be explained in detail below with reference to the drawings. A, B, C in the drawing
. . . is an intelligent terminal placed at each branch office, and is connected to the center CPUIO through a public line.

FRおよびPRは各端末に付属のフロッピーディスクお
よびプリンタである。DFはセンタ側に置かれる配信フ
ァイルであり、18は該ファイルの管理部、20は端末
別データ管理部、22は空きエリア管理部である。配信
ファイルDFに書き込まれるデータには種々の種類のも
のがあるがその1つは在庫に関するデータである。16
は在庫処理、14はそのファイルを示す。
FR and PR are floppy disks and printers attached to each terminal. DF is a distribution file placed on the center side, 18 is a management unit for the file, 20 is a terminal-specific data management unit, and 22 is a free area management unit. There are various types of data written to the distribution file DF, one of which is data related to inventory. 16
indicates inventory processing, and 14 indicates its file.

各支店からは売上、在庫、不足商品送出要求などのデー
タがセンタへ送られてくるが、これらのデータはフロッ
ピーFRを利用して一括伝送されてくるのでバッチ処理
12し、受信デー外こヱラーがある(例えば当該支店に
は有るはずのない商品コードが煽っている、在庫量に過
不足がある等)と、そのエラーデータも配信ファイルD
Fに書き込み、端末側からこれを読み取らせてチェック
させる。配信ファイルDFに書き込むデータは端末別、
バッチ別(同じ端末に属するものであってもそのデータ
発生時点が異なって、間に他の端末のものが入ると別デ
ータとする)である。第2図は配信ファイルDFおよび
テーブル20,22を詳細に示す図である。配信ファイ
ルDFが図示の如く、そのメモリ領域0−a.には端末
Aの第1群データが書き込まれ、a2−a3には端末B
の第1群デ−夕、a3一a4には端末Aの第2群データ
・・・・・・が書き込まれており、メモリ領域a,一a
2、キー念は空きとすると、端末別データ管理テーブル
20および空きエリア管理テーブル22には図示のよう
に端末名、バッチナンバ、ファイル内アドレスが書き込
まれる。端末側から送信要求があると先ず端末別データ
管理テーブル20が参照され、当該端末に対する配信デ
ータの配信ファイル上のメモリ領域のアドレスが求めら
れ、該アドレスに従って配信ファイルが読み出されてそ
の読み出しデータが当該端末へ送出される。配信データ
が送出されると、例えば端末Bから送信要求があってメ
モリ領域a2−a3のデータが送出されると、該データ
領域は突き領域となり、テーブル20からは消され代っ
てテーブル22に登録される。配信ファイルDFに配信
データを書き込む際はエリア管理テーブル22を眺め、
該配信データを充分書き込める空き領域を求めてそれに
該配信データを書き込む。配信データを書き込める空き
エリアがない場合は当然バッファフル扱いとして書き込
みを禁止する。このような場合2つの空きエリアに分割
して書き込めば書き込めるケースも生じ得るが、データ
の分割は何処で分割すべきかなどの厄介な問題がある。
このような場合はむしろソートして配信ファイル上の各
空きエリアを1つに纏め、そこへ一括して書き込むのが
よい。以上の説明から明らかなように本発明によれば配
信ファイルには、端末単位にピーク日のデータ量を格納
できるスペースを持たせる必要はなく、システム全体の
ピーク日のデータ量を格納できるスペースを持たせれば
よい。
Each branch sends data such as sales, inventory, requests for sending out missing items, etc. to the center, but since this data is transmitted all at once using a floppy FR, it is batch processed (12) and the received data is filtered out. If there is a problem (for example, a product code that is not supposed to exist at the branch is causing the problem, there is an excess or deficiency in inventory, etc.), the error data will also be sent to the distribution file D.
Write to F and read it from the terminal to check. The data written to the distribution file DF is by terminal,
By batch (even if the data belongs to the same terminal, the data is generated at different times, and if there is data from another terminal in between, it is treated as different data). FIG. 2 is a diagram showing the distribution file DF and tables 20 and 22 in detail. As shown in the figure, the distribution file DF is stored in its memory area 0-a. The first group data of terminal A is written to a2-a3, and the data of terminal B is written to a2-a3.
The second group data of terminal A, etc., are written in the first group data, a3-a4, and the memory areas a, a3-a4 have been written.
2. If the key is assumed to be empty, the terminal name, batch number, and address within the file are written in the terminal data management table 20 and the empty area management table 22 as shown in the figure. When a transmission request is received from the terminal side, the terminal-specific data management table 20 is first referred to, the address of the memory area on the distribution file of the distribution data for the terminal is determined, the distribution file is read out according to the address, and the read data is read out. is sent to the terminal. When distribution data is sent out, for example, when there is a transmission request from terminal B and the data in memory areas a2-a3 is sent out, the data area becomes a stop area and is deleted from the table 20 and is instead stored in the table 22. be registered. When writing distribution data to the distribution file DF, look at the area management table 22,
A free area in which the distribution data can be sufficiently written is found and the distribution data is written therein. If there is no free area in which to write the distribution data, the buffer is treated as full and writing is prohibited. In such a case, it may be possible to write by dividing the data into two empty areas, but there is a problem of where to divide the data.
In such a case, it is better to sort the free areas on the distribution file into one, and then write the data all at once. As is clear from the above explanation, according to the present invention, there is no need for the distribution file to have a space that can store the data amount on peak days for each terminal, but a space that can store the data amount on peak days for the entire system. Just let them have it.

この方式によれば、端末単位にピーク日が異なる用途で
は配信ファイル容量は従釆の2/3〜1/2で済む。
According to this method, in applications where peak days differ for each terminal, the distribution file capacity can be reduced to 2/3 to 1/2 of that of a conventional system.

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

第1図は本発明の実施例を示すブロック図、第2図は第
1図の一部の拡大図である。 図面でA,B,C・・・・・・は端末、DFは配信ファ
イル、20は端末別データ管理テーフル、22は空きエ
リア管理テーブルである。 第1図 第2図
FIG. 1 is a block diagram showing an embodiment of the present invention, and FIG. 2 is an enlarged view of a part of FIG. 1. In the drawing, A, B, C, . . . are terminals, DF is a distribution file, 20 is a data management table for each terminal, and 22 is a free area management table. Figure 1 Figure 2

Claims (1)

【特許請求の範囲】[Claims] 1 複数の支店に設置される端末装置と、これらの端末
装置に回線を介して接続され各支店単位のデータ処理を
行う処理装置を備えたセンタとを有し、各支店の端末装
置の要求に基いて当該支店に対するデータの処理結果を
センタより配信するデータ伝送システムにおいて、 前
記処理装置の処理した各支店毎の処理結果が各処理単位
で一時格納されるフアイルと、このフアイルにおける各
処理結果の格納アドレス情報を各支店の端末別・処理単
位別に識別可能に保持するデータ管理部と、このフアイ
ルの空き領域に関する情報を保持する空きエリア管理部
とを前記センタに設け、 前記処理装置の処理したデー
タとエラーデータとを含む処理結果を空きエリア管理部
を参照して当該処理結果を配信する端末別にフアイルに
格納するとともに、配信要求のあつた端末に対応した処
理結果を前記データ管理部を参照してフアイルから読出
し当該端末に送出することを特徴とする処理データ伝送
方式。
1. It has terminal equipment installed at multiple branches and a center equipped with a processing equipment that is connected to these terminal equipment via a line and processes data for each branch. In a data transmission system in which data processing results for each branch are distributed from a center based on the data processing results, there is a file in which processing results for each branch processed by the processing device are temporarily stored in each processing unit, and a file in which each processing result in this file is stored. The center is provided with a data management unit that holds storage address information in an identifiable manner for each terminal and processing unit of each branch, and a free area management unit that holds information regarding the free space of this file. The processing results including data and error data are stored in a file for each terminal to which the processing results are to be distributed by referring to the free area management section, and the processing results corresponding to the terminal that has made the distribution request are referred to the data management section. A processing data transmission method characterized by reading data from a file and sending it to the terminal.
JP55105416A 1980-07-31 1980-07-31 Processing data transmission method Expired JPS601670B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP55105416A JPS601670B2 (en) 1980-07-31 1980-07-31 Processing data transmission method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP55105416A JPS601670B2 (en) 1980-07-31 1980-07-31 Processing data transmission method

Publications (2)

Publication Number Publication Date
JPS5730029A JPS5730029A (en) 1982-02-18
JPS601670B2 true JPS601670B2 (en) 1985-01-16

Family

ID=14406995

Family Applications (1)

Application Number Title Priority Date Filing Date
JP55105416A Expired JPS601670B2 (en) 1980-07-31 1980-07-31 Processing data transmission method

Country Status (1)

Country Link
JP (1) JPS601670B2 (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5938874A (en) * 1982-08-27 1984-03-02 Casio Comput Co Ltd Data collecting system
JPS6027056A (en) * 1983-07-22 1985-02-12 Fujitsu Ltd Buffer control system
JP2520868B2 (en) * 1984-10-25 1996-07-31 ジューキ株式会社 Automatic sewing machine for zippers
JPH074457B2 (en) * 1986-09-25 1995-01-25 ブラザー工業株式会社 Sewing machine cloth presser
JPH01121985A (en) * 1987-11-06 1989-05-15 Nec Corp Cyclic range system
JPH01140327A (en) * 1987-11-27 1989-06-01 Canon Inc Output device for computer data

Also Published As

Publication number Publication date
JPS5730029A (en) 1982-02-18

Similar Documents

Publication Publication Date Title
US5813000A (en) B tree structure and method
US5642503A (en) Method and computer system for implementing concurrent accesses of a database record by multiple users
US5204812A (en) User access of multiple documents based on document relationship classification
US5815556A (en) Method and apparatus for extracting a subset of data wanted by a customer from a group of subsets of data wanted by different customers
US20190026325A1 (en) Memory object pool use in a distributed index and query system
US6192366B1 (en) Integrated database system and computer-readable recording medium recorded with program for managing database structure thereof
JPS601670B2 (en) Processing data transmission method
US5666527A (en) System for dynamically changing logical data structure of database
US20230109530A1 (en) Synchronous object placement for information lifecycle management
US20190171626A1 (en) System and Method for Storing and Retrieving Data in Different Data Spaces
EP0633531A1 (en) Memory management system and method
Line National interlending systems: existing systems and possible models
US5706512A (en) Computer program product for queuing and retrieving data objects to and from a shared storage medium
EP0518311A2 (en) File store method, file access method, and distributed processing system using such methods
EP0426593A2 (en) User access of multiple documents based on document relationship classification
JPS593567A (en) Buffer number setting system of tree structure
CN111221910A (en) Fragment storage method for improving block chain read-write performance
JP2720775B2 (en) File parallel processing unit
JPH07101394B2 (en) Automatic matching method
JPH0667954A (en) File access system
JP2565717B2 (en) IC card
JPH02116936A (en) Reorganizing system
CN113535775A (en) Method and device for accessing database and computing equipment
JPS595372A (en) File processing system
JPS63239540A (en) Data management system in memory medium