JPH03250367A - Registering method for contents of order - Google Patents

Abstract

PURPOSE:To easily and surely retrieve a desired block by dividing a prescribed period to be controlled into plural blocks, storing both start and end days of each block, and comparing a desired day with the start and end days respectively in order to retrieve the desired block. CONSTITUTION:A prescribed period to be controlled is divided into plural blocks every prescribed days, and the start and end days of each block are stored. Then a desired day is compared with the start and end days respectively. Based on the result of this comparison, a block of the desired day is retrieved. Thus it is possible to reduce the repeating frequency of the processing, to simplify the algorithm, and to decrease the occurrence of mistakes. Then the desired data can be surely retrieved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Object of the Invention] (Industrial Application Field) The present invention relates to an order content registration method for accepting and registering daily order content and managing and totaling the order content.

(Prior art) For example, in an ordering system for dinner ingredients, when orders are generated almost every day and shipped every day, the minimum management aggregation unit is usually -day, but in such an ordering system, It is important to accurately receive and register the details of orders that occur on a daily basis, and to manage and aggregate them. In such a system, one year or six months is a large management unit for accounting and processing purposes, and it is possible to respond to many customers.

FIG. 7 shows the contents of a file in which the order data of each day is arranged and stored in order in the case where one day is the minimum aggregation unit in such a conventional ordering system.

In this figure, one year is the management unit, and data of order details from the 1st day to the 365th day is stored as a file, and one day's worth of data is read from this file to the main memory as needed. , displayed, further modified, etc., and stored in a file.

In the conventional method shown in FIG. 7, only one day's worth of data can be processed at a time, so it takes a long time to process each piece of data. What did you order yesterday and what did you order today?
Since it is difficult to understand the context of what to order tomorrow, etc., the processing and management unit should be changed from 18 to 1, for example.
There is a way to create blocks such as weekly units.

Figure 8 shows the list displayed when processing and managing orders on a weekly basis, but the method for creating and modifying orders using such a weekly list is unique to the customer. It has the advantage of being easy to change, making it easy to order, and also making it easy for the center that accepts and orders to make a weekly tally.

Even with this method of processing and managing on a weekly basis, if the file format for storing this data is the conventional format shown in Figure 7, it will take seven file accesses to display one screen. For example, if the current day is April 5th and you want to display a week including the current day, you can refer to the current date from the device's internal clock and extract it from the file. If you are going to read it on this day, for example on Wednesday, you will have to read it two days in advance, which will complicate the algorithm and make it more likely that mistakes will occur.

Therefore, it is preferable to manage the inside of the file by dividing it into weekly blocks.

FIG. 9 shows files managed by dividing them into weekly blocks. In other words, one year is managed by dividing it into weeks 1 to 53, and only the data for the desired week to be processed is read out from a file to the main memory, expanded, and processed, resulting in efficient processing. It can be performed.

Figures 10 and 11 are flowcharts showing an algorithm for reading out the necessary data assuming that a customer places orders for one week including the current day, and Figure 10 is an algorithm for reading out data for each day. FIG. 11 shows an algorithm for reading data from 13 FI units.

In the process of Figure 10, it is necessary to calculate which day of the year the first Monday of the week including the current day falls on, and in the process of Figure 11, it is necessary to calculate the day of the year that falls on the first Monday of the week including the current day. It is necessary to calculate what week of the year it is. In addition, in image processing, the time for accessing a file does not change, that is, the amount of data is the same, or the processing shown in FIG. 11, which is processed on a weekly basis, is simple and fast because there is no repetition.

(Problem to be solved by the invention) Even in the method of performing processing in units of one week as shown in Fig. 11, in order to search for the data to be obtained, one week including the current day is determined in which week of the year. Is it necessary to calculate whether this will be the case? Since this calculation is performed for each machine using an application program, there is a problem that errors may occur due to programming errors or processing errors on the computer.

The present invention has been made in view of the above, and an object of the present invention is to provide an order content registration method for registering order content so that desired data can be reliably retrieved.

[Structure of the invention]

(Means for Solving the Problems) In order to achieve the above object, the order content registration method of the present invention is an order content registration method that receives and registers the order content that occurs on a daily basis, and manages and aggregates the order content, which includes: A predetermined period to be managed is divided into a plurality of blocks each having a predetermined number of days, and the first and last days of each block are stored in correspondence with each block, and the desired date to be searched is set to the first day. and the last day, and search for the block of the desired day from the comparison result.

(Function) In the order content registration method of the present invention, a predetermined period to be managed is divided into multiple blocks, and the first and last dates of each block are stored and searched. Compare the desired date to this beginning and end date,
Searching for the desired day block.

(Example) Hereinafter, the present invention will be explained in detail using the drawings.

FIG. 1 is a diagram showing a file structure used in a method for registering order details according to an embodiment of the present invention. In the figure, the predetermined management period is one year, and this one year is divided into weeks to form blocks from the 1st week to the 53rd week, and each block contains data for one week from Monday to Sunday. In addition, the first and last days of a week are stored as the total number of days in the year, that is, as serial number days from the beginning of the year. Specifically, in the figure, the data for the second week is shown enlarged, but the data for the second week includes data from April 3rd (Monday) to April 9th (Sunday), as well as data from April 3rd (Monday) to April 9th (Sunday). Therefore, the serial number days from the beginning of the year for the first day (4/3) and last day (4/9) of this week are "3" and "3" respectively.
It is remembered as 9J. To search for one week's worth of data that includes the desired date from such a file, read each week's worth of data from the file to the main memory as shown at the bottom of the figure, and then search for the data that contains the desired date. Compare the size of the first day and the last day in
Data that is between the first date and the last date is confirmed as the desired data. Figure 2 is number 13! 2 is a diagram similar to FIG. 1 showing enlarged data for the second week and the 53rd lap.

FIG. 3 is a block diagram showing the configuration of an ordering system having the above-mentioned files. The ordering system shown in the figure has an external recording device 1 for storing the above-mentioned file, that is, an order file, and this ordering system is divided into a center side device and a customer side device. The center side equipment includes
A main memory 5 connected to the external recording device 1 via an access device 3 is also provided. The main memory 5 stores data read from the external recording device 1, and the read data is displayed as a list on the display device 11. Further, an internal clock 7 for managing date and time is connected to the main memory 5, as well as an instruction/input device 9 for instructing aggregation requests and the like. Furthermore, the access device 3 is provided with a formatting function device 13 that initially stores the first and last days of each block for one week, as shown in FIG. Note that the external recording device [1 is usually provided on the center side.

Also, as a device on the customer side, there is an access device to the external recording device 1! Main memory 2 connected via 21
3 is provided so that the data read into the main memory 23 is displayed on the display device 27 as a list to the customer. Two input devices are connected to two main memories.

Furthermore, the main memory 23 has an internal clock 2 that manages the date and time.
5 is connected. In addition, the customer side has an access device W21.
connected online via a telephone line.

Next, with reference to the flowchart shown in FIG. 4, the operation when reading and displaying one week's worth of data including the current day from a file will be explained.

For example, if the current day is entered as April 5th, this day's date, specifically 15, which is the serial number day of the year.
is read from the internal clock (step 110), then the file is opened (step 120) - each block of the file is read one block from the first block (step 130), and the data is read from the first day to the last day of this read block. The serial number of the current day within the range up to
5" (step 140) 0 For example, the first day and last day of the first week's block are "1" and "2", respectively, as shown in FIG. Serial number date r5. Since it does not fit in this period, it is skipped as an unnecessary block (step 150), and the next block, the second week's block, is read. As shown in Figure 2, the first and last days of this block are "3" and [9J, and the current day's serial number day "5" falls within this range, so this block is considered to be applicable. The data for the week is displayed on the display device (Step 1
60), In fact, when the previous unnecessary block is skipped, it is known that the next one is the desired data, so either the next range check is unnecessary, or the algorithm becomes complicated and maintenance is required. The method shown in FIG. 4 is adopted in consideration of safety during identification. Alternatively, in the loop shown in steps 130 to 150, only the first and last days may be read without reading all the data of each block, and the data may be read again after the identification is completed. Conceivable.

FIG. 5 is a diagram showing a specific configuration of the ordering system shown in FIG. 3. As shown in the figure, on the center side there are a DRT display 51 constituting the display device 11, a keyboard 53 constituting the instruction/input device 9, a main memory 5, an internal clock 7, an access device [3, and a format function device 13].
A host computer 55 and the like constituting the following are provided.
Also, the above display is on the customer side! 27, a home television 61, and an information terminal 63, which includes the main memory 23, etc.
A home delivery fresh storage warehouse 65 for storing the delivered food is also provided. A meal menu is displayed on the screen of the customer's TV 61, and by selecting the desired item from this display, the selected food is registered in the file at the center and delivered. It is now possible to do so.

FIG. 6 is an explanatory diagram showing the software and database in the ordering system shown in FIG. 5. As shown in the figure, the host computer on the center side includes search and communication software, drawing software, material and cooking databases, video databases, and the like. Also,
Information terminals on the customer side include search and communication software, video and nutritional databases, etc.

〔Effect of the invention〕

As explained above, according to the present invention, a predetermined period to be managed is divided into a plurality of blocks, the first date and the last date of each block are stored in correspondence with each block, and the desired period to be searched is stored. Since the day is compared with the first day and the last day to search for the block of the desired day, it is possible to easily and reliably search for the block to be searched. Blocks with an odd number of days at the end can be processed in the same way 6

[Brief explanation of drawings]

Fig. 1 is an explanatory diagram showing the file structure used in the order content registration method according to an embodiment of the present invention, and Fig. 2 is an enlarged view of the data for the 1st week, the 2nd week, and the 53rd week. 3 is a block diagram showing the configuration of the ordering system having the files shown in FIG. 1, FIG. 4 is a flowchart showing the operation of the ordering system shown in FIG. 3, and FIG. The figure is an explanatory diagram showing the specific configuration of the ordering system shown in Fig. 3, Fig. 6 is an explanatory diagram showing the software and database in the ordering system shown in Fig. 5, and Fig. 7 is an explanatory diagram showing a typical day in the conventional ordering system. An explanatory diagram showing the contents of a file in which the order data of each day is arranged and stored in order when the minimum aggregation unit is used; Fig. 8 is an explanatory diagram showing a list displayed when processing and managing on a weekly basis; Figure 9 is an explanatory diagram showing files that are managed by dividing them into weekly blocks, and Figures 10 and 11 show that the customer
This is a flowchart illustrating an algorithm for reading out the necessary data assuming that a week's worth of orders is to be made.6 ■...External recording device, 5...Main memory, 7...Internal clock, 9...Instructions - Input device, 11... Display device, 13... Format function device, 23... Main memory, 25... Internal clock, 27... Display device, 2... Instruction/input device. Representative Patent Attorney Hidekazu Miyoshi - List Tabulation Request Figure 3 Figure 6 Daily data Figure 10 Weekly data

Claims (1)

[Claims] This is an order content registration method that accepts, registers, and manages and aggregates order content that occurs on a daily basis, in which a predetermined period to be managed is divided into multiple blocks of a predetermined number of days, and each block is divided into blocks corresponding to each block. An order characterized in that the first day and the last day of are stored, a desired day to be searched is compared with the first day and the last day, and a block of the desired day is searched from the comparison result. How to register content.