Process for allocating data sets to time values of a consecutive sequence

0001description

0002A method for assigning data records to times in a time order

0003The invention relates to a method for assigning data records to times in a time order.

0004The information of activities are often stored in records that are based on a time axis. The activities can be presented in a clear form with bar graphs. From this it can be quickly beginning and end and Überschnei¬ decisions of individual activities recognize. Darartige individual activities may relate, for example, on the availability of hotel rooms or on the deployment of personnel for various jobs.

0005It happens that records in various files associated with the current market value. Must be changed records or be reduced or increased the number of records, then often cumbersome set-up work are hereby not¬ agile until the correct mapping exists. In particular, difficulties in a reduction or increase may arise. The invention is based on the object, a method for assigning data records to times in a time Reihen¬ follow to develop, can be considered easily with the changes, extensions or reductions in the related to the time value data.

0006The object is inventively achieved in that the Zeit¬ values ​​as data strings in a field are stored, that the reading of a value to the beginning of Daten¬ strings carried by selected value and that the time of reading from the beginning of the data string to selected value, an address is assigned. Such a data string is within the capacity of the planned field arbitrarily enlarged and reduced in size. So it can very quickly and easily set the length of a timeline, ausgele¬ sen and displayed. increases the expansion and reduction of the time axis reduces the number of necessary addresses.

0007Preferably, in the data string in each case a group of bits to distinguish the units of the time sequence is provided. Each unit of the time axis is determined here by the same bit pattern. This much-digit values ​​can be stored with little effort of memory capacity.

0008In an expedient embodiment, the time values ​​as a bar graph interactively listeners displayed on a screen of a Digitalrech¬. The selection of specific addresses can hereby gen erfol¬ easily Meise by the length of a bar graph. In addition, the address storage required is the length of the bar graph can be fixed.

0009it when the address formed by the readout time of the data string is inserted into at least one instruction of the digital computer is particularly favorable. This allows the data sets, which are accessible by the selected address, to be changed in the manner specified by the command. It is therefore possible a quick and easy modification of the records. Preferably, the start and end of a data string is determined by the appearance of a bar graph on the screen by moving a cursor to the appropriate location is posi¬ tioned.

0010The cursor can by means of a mouse, that are positioned by means of a slidable on a table that is connected to the respective digital computer control unit. The operation is hereby further simplified.

0011The measures described above can be used advantageously when booking systems. Reservation systems are used eg for the seat reservation in buses trains, planes and ships as well as for the hotel room reservation.

0012The invention is described in more detail below with reference to an embodiment shown in a Zeich¬ voltage, from which further details, features and advantages will be apparent.

0013Show it:

0014FIG. 1 is a diagram of the temporal occurrence of the bits of a data string in association with addresses of memory locations of a file,

0015FIG. 2 a to e diagrams of process steps to manage a room reservation system,

0016FIG. 2 f a structure chart with the processes involved in a key scan operations,

0017Fig. 2g a structure chart for at a

0018Occupancy change occurring processes,

0019FIG. 3 is a screen display of a room assignment list and

0020Fig. 4 is a screen display of a guest-information corresponding to the occupancy. In Fig. 1, a data string (1) is shown, which consists of bit groups, of which ^■ only the bit groups (2), (4), (5), (6), (7), (8), (9), respectively. Each group of bits containing at least one bit. but it can be more. The data string is stored in a field of a memory of a digital computer. The individual bit groups, for example, (2) to (9) are based on the first Bitgrup¬ pe (0). Each group of bits corresponding to a value, such as a day of a month. The data string (1) correspond, for example, all days of the month. It's not every day as an absolute value son¬ rather as a bit group that is associated with a daily unit is stored along with the other bit groups. The readout of a given day allocated value begins with the group of bits (0) and ending with the day of each associated bit group.

0021The Ausleεedauer increases, the longer the selected bit group. The read-out times of the different days of a month, different addresses are allocated, which are for example are addresses of a file (10). In FIG. 1 Speicher¬ cells are shown of the file (10). It is the Adr eat a row of memory cells (A 10) to (A 15) designated. These addresses correspond to each example the readout times of the bit groups (2) to (7). The data string (1) is in its ver¬ different bit groups thus different values ​​zugeord¬ net that spring from a number of records, which are accessible via the values ​​corresponding addresses.

0022The groups of bits of the data string (1), for reading out from the field, starting with the group of bits (0), on a screen of a digital computer Bild¬ shown as a bar chart, which is terminated when the selected time is displayed. The selection can be made, for example, with a cursor. The Auslese¬ time a b ^ timmte address is assigned in which minde¬ least one record is, which can be read, displayed or changed. In this way it is interactive possible to select a time sequence related data quickly and easily to display, eg, to change or to bring up to date. The data string (1) may in the context of a storage area reserved for this purpose be enlarged or reduced. The length of a time axis can thus be set quickly and easily. This means that the records are fixed on the respective addresses to be affected, for example. The selected on the timeline addresses are inserted into commands that are being set on the keys of a keyboard to read records, umzu¬ group or modify their form and content.

0023The method described above can be advantageously carried out using a personal computer. As the input device keyboard, a mouse or a light pen (light pen) can be connected. The mouse, a box-like control unit, which is connected via a cable to the computer is moved on the surface of a table. In parallel, the cursor moves on the computer screen. In a Licht¬ stylus is on the screen the desired position "an¬ crossed", the cursor is projected onto the corresponding location. The cursor can be directed to a specific location where as the bar graph of the data string (1) is to be terminated.

0024The method described above can be advantageously carried out using a personal computer, to which a mouse is connected. The mouse, a box-like control unit, which is connected via a cable to the computer is moved on the surface of a table. In parallel, the cursor moves on the computer screen. The cursor can be directed to a specific location where the program Balkendia¬ the data string (1) is to be terminated.

0025In Figs. 2a-2d, the use of the method described above with a room reservation system for hotels is provided dar¬. a room file, a file occupancy and time value files are provided for the Zimmerreservierungssytem. The room contains the file room and a description, for example, refers to the location, floor, courtyard or street, and the like. In the occupancy file are the

0026SUBSTITUTE SHEET Occupancy for a certain period and the names and addresses of guests indicated. The time value files enthal¬ th data strings each for years, months and days. In a guest file names and addresses, nationality, passport number., Telephone and, where appropriate company and Salutation are stored.

0027Before the construction and representation of assignment plan for the room calendar for occupancy must be generated first. The calendar is produced by the temporal upper and lower limits in annual values ​​in the computer is eingege¬ ben after in Fig. 2a Start illustrated in a first step (11). Thereafter, in a step (12) which is Belegungsplan¬ file and initializes the time value file. Rooms file is then in a step (13) to the beginning. Be¬ beginning with the specified room is then in a step (14) created a new record for the occupancy by the data of the corresponding room Zim¬ mers are added to the file in step (15). In the next step (16) creates a cross-reference for the occupancy file. Another step (17) enables the selection of months by typing the desired x-value is entered for the input x-December 1 and January x +. 1 Thus, the availability values ​​for each room and the specified period will be created. After creating the occupancy values ​​for the respective rooms (18) is checked in the next step to see whether other unoccupied rooms are available. If so, then the steps are repeated 14 to 17 for the other selected room. If not to be occupied rooms are no longer present, a step (19) and the step (18) follows. In step (19) the annual value is increased by. 1 in a step (20) This is followed by testing whether the new value equal to the years in^" Step (11) entered upper limit. If this is not the case, then the step (13) and the further steps for the new year value are repeated. When the limit is reached, then the generation of the calendar to an end. The steps (11) to (20) are composed of individual process steps, which are shown in the flow plan of FIG. 2 b to 2 e and the structure charts shown in FIG. 2 f and 2 g. The

0028ERSATZBLÄTT Flowcharts included, the individual process steps in block form with the relevant explanations.

0029The structure and representation of various related to the reservation system necessary and / or advantageous information is done using the mouse control, which is shown in Fig. 2b. Using the mouse, the cursor on the screen to the right, left, moves up or down. The direction of movement depends on predetermined key inputs that are polled sequentially. The interrogation of the keys for the mouse control is shown in Fig. 2b with the process step (21) referred to, under which a series of process steps is to be understood, of which below those which are important to be explained in detail.

0030In a step (22), the key input is from a rensschritt Verfah (21) tested, causing a corresponding movement of the cursor. These are 4 directions for moving (high, low, left, right), as well as an opportunity to leave the plan and for further processing within the reservation system. These steps are independent, whether keyboard, mouse or light pen (light pen) are used, tested and executed.

0031Depending on certain function keys (Fig. 2 b or 2 f) (F3) to (F10)) can be carried out within the time values ​​freely definable jumps, ie it can within the Reser¬ vierungssystems at certain intervals be "scrolled": (here : daily, weekly, monthly, other systems: for minutes, hours and days as).

0032The steps (21) to (25) thus serve a specific temporal and spatial position (here Room - Nr. 105 on 07/17/89) to reach as quickly and conveniently.

0033In the following step (26) is checked whether the "ENTER" key is pressed. If yes, can now on the instantaneous

0034HE^SATZBLATT Position another treatment may be applied, including delete / modify assignments / edit (Fig. 2).

0035In step (26) due to the cursor coordinates and the targeted._^ Bit group a function selection performed. They then determined how to proceed within the Reservierungs¬ system. Depending on the cursor position is a variable called investment value here Funk¬, an agreed value assigned. Again, this value determines the next processing. In the example Bele¬ supply plan this function value, the agreed values ​​are assigned 1 to 5, each in steps (27),

0036(28), (66), (68) and (69) to be tested. These five values ​​five agreed possible processing follow:

0037"1" Initialization of the function value, value by not verein¬ disclosed keystrokes.

0038"2" Displays information about a guest of the room, its availability (data string) is selected and allows three Verar¬ beitungen (Figure 2c, d, g.): A) It can be accessed the personal data of the guest, b) the assignment can be moved to another room or on another date (steps (34) and (35)), c) the assignment can be completely deleted (steps (36), (37), Fig. 2c).

0039The steps (44) to (49) determine the appropriate Zeitwerte- for the beginning and end of the bit group. However, if on the screen at the same sensor position Cur¬ the bit groups with the agreed pattern of marks "Zimmer frei", is now a new Zim¬ merbelegung be performed manually. For this, a bit group is using a keyboard, mouse or light pen as "busy" in (Fig. 2d, Schrit-be (41a) to (41k)). The corresponding values ​​are determined by the computer (BfZ EPROM).

0040SUBSTITUTE SHEET "3" It can provide information on a selected rooms are accessed.

0041"4" cause a reload of the screen after a predictor was changed (here: change of Zimmerkate¬ gory).

0042"5" allows changing the value ranges (eg here Vor¬ or backward by a week / month / day).

0043In Fig. 2d, after the key query (41a) on the basis of the determined offsets from step (41) the visual design to be modified to a group of bits, starting from offset, durchge leads. The possible key inputs (41b), (41e), (41f) and (41g) cause the following possible changes to the Bitgrup¬ pe:

0044(41b): The desired range of size group of bits is reached and can now be processed as a reservation. (41e): Cancels formatting, processing is aborted. (41f): The area to be modified size of the bit group is a unit of time (in this case one day) extended. (41g): The area to be modified size of the group of bits is reduced by one time unit.

0045After creating the desired bit group, the process continues with step (42) and entered the altered group of bits as Re¬ vation / booking. Then the Bele¬ based payment scheme is established in his now updated form (step (44)), ie, the modified contents of the bit groups^" shown on the display.

0046First step in Belegungεplan structure (Fig. 2e) is the Über¬ test in step (50) if a properly initialized Bele¬ is supply file active (variable FILESTAT). Step (51) determined from the number of the month (eg 05) the corresponding names of the months (May). The Days file is set to the current year, ie inter alia examining whether a leap year. The check in step (53) ensures that is generated for the desired year of occupancy. If this is not the case, an empty schedule is shown (step (54)). Otherwise, for the current year and the selected predictor (here: room type, step (57)) demonstrated all zugehö¬ engined rooms succession. Are all the rooms of a category identified (step (59)), the rest of the screen is Bild¬ filled with empty strings (step (54)). Does the room agree, a data string is taken from the group of bits and display screen on the Bild¬ for selected period.

0047After demonstrating the group of bits in step (60) a counter in step (6t) is increased. If it exceeds the agreed value here (15), the structure of the assignment plan is canceled, since the screen is full. The still following rooms can mouse control (step (66), Fig. 2b) are projected onto the screen.

0048is shown in Fig. 3 a, selected portion of an occupancy plan as is visible on the screen of the monitor, FIG. In the right column (62) selected for the presentation room numbers are displayed. FIG. 3 shows a series of room numbers, Ä. B. (1030 (104), (105) etc. In the top row (64) of the display, the month specified, a reference to which the representation refers, namely supply plan to the bedroom Bele¬, and the room, including double rooms , ange¬ shows. the next line (65) in each case contains the number one day of the month. each number is assigned a unspecified column. each room number is assigned to a row. in the lines are in the form of bar charts the Belegungs¬ times shown, is being displayed in the center of the bar graph the guest's name. the name will appear centered in the bar chart, with shorter holding times it is truncated or omitted entirely in 1-day assignments. in the lower line the markings for the "Scroll" days, weeks or monatεweise appear. These fields must match Mouse Light pen or keyboard are driven, one wants .Innerhalb the plan "leaves", without using the special keys (F3) to (F10).

0049The FIG. 4 shows one possible within the room occupancy plan view of information about a guest. This representation is the occupancy view partly überla¬ siege, since it does not require the entire screen.

0050In the view of the room Belegungs¬ planes shown in FIG. 3 completed reservations / bookings / options already shown (depending on the agreed bit pattern). These can be accessed through the above steps (32) to (37) displaced (changes) or information about Zi mer or guests.

0051Under appropriate adjustment to the method described above can also be employed for the network planning. For a production facility to manufacture times are specified transmission times as Maschinenbele¬ and changed if necessary. An ON-LINE monitoring and control of machines working times and transport times is possible. disposed of to transport devices and / or machines donors, who contribute fest¬ actuation times, the data string can be directly influ- beein¬ particular. A retrieval and monitoring via a Moni¬ tor is then easily possible. Insofar as the production times and transport times are subject to a control, reference times can be entered via the screen.

0052The address obtained by the length of the data string can in particular be used as a relative address.