GB2190772A - Data storage/retrieval - Google Patents
Data storage/retrieval Download PDFInfo
- Publication number
- GB2190772A GB2190772A GB08710603A GB8710603A GB2190772A GB 2190772 A GB2190772 A GB 2190772A GB 08710603 A GB08710603 A GB 08710603A GB 8710603 A GB8710603 A GB 8710603A GB 2190772 A GB2190772 A GB 2190772A
- Authority
- GB
- United Kingdom
- Prior art keywords
- data
- information
- items
- item
- class
- 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.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/02—Knowledge representation; Symbolic representation
Abstract
A data storage and retrieval system has means to associatively index (label) items of data as they are stored (26) into the system, the associative indexes (labels) being embedded with each of the items of data and defining the relationships which the items have with other items of data. <IMAGE>
Description
SPECIFICATION
Electronic data storage & retrieval system
The present invention relates to a data storage and retrieval system having novel labelling for data particularly envisaged for use in developing expert systems and imparting artificial intelligence to data bases.
In general, data may be stored in electronic form by using sequential data files or random access files. The former have little or no structure and are suitable for handling only relatively small quantities of data. Data storage and retrieval into and out of sequential data files must be done in a strict lineanly progressive sequence from beginning to end of the stored data or until the required data is located. In contrast, data records contained in random access files have a specific structure.
In particular random access files have groups of data relating to a single key data item and each group being stored together in a record.
Data can only be retrieved from random access files by searching through the key data items, that is by using key words. Accordingly it is not possible to retrieve individual data items of the record since all data items related to the key data item will also be retrieved.
Such retrival may lead to the important data being obscured by the remainder of the retrieved data.
Furthermore, records in a random access file must have fixed categories of data and fixed data character lengths. Thus, there is an inefficient use of memory to store the records since much of the data storage space can be devoid of data.
Still further, unless appropriate key words are chosen in conducting a search the appropriate data records will not be retrieved from the random access files and are thus effectively lost.
Data may also be stored in expert systems and made available to people of relatively low skill in a particular field so as to boost their effective level of skill. In general, expert systems are developed on facts, belief and heuristics which form the knowledge of a given specific field. An expert in the specific field provides his/her knowledge which then forms the knowledge of the expert system. To retrieve the knowledge from the expert system questions must be asked of it. The question may have to be structured in certain language syntax or may in some cases be full text, free-form narrative questions. The expert system then interprets the question and extracts that data from its memory which most accurately answers the question. In some cases the expert system is unable to provide any answer or the answer may be incorrect due to the nature of the presentation of the question.
In an expert system the knowledge may be applied as interpretation and monitoring of situations, prediction of consequences, diagnosis and remedy of malfunctions and design due to constraints.
The knowledge of the expert system is retrieved by obtaining answers to questions posed of the expert system. Accordingly, an operator must ask a appropriate question and have some knowledge of the contents of the expert system in order to extract an appropriate answer. Furthermore, it is not possible to extract all of the knowledge from the expert system without knowing all of the appropriate questions, thus knowledge can be effectively lost in the mass of knowledge in an expert system.
Sequential access data files, random access data files and expert systems all lack suitable association of information stored in discrete data records to enable automatic retrieval of data records of related knowledge or information. Furthermore, they all lack the ability to differentiate between classes of knowledge data which might be subordinate and more detailed and/or braoder in concept.
The present invention provides a data storage and retrieval system having novel labelling for data capable of registering the association between related data records within the data records themselves. The benefits, which are absent from conventional data files and known expert systems are achieved by storing with each item of data a label which defines or reflects the relationship or association that the said item of data has with other items of data. Such indexing is herein referred to as associative indexing, and the simultaneous storage of an item of data together with such a label is herein referred to as embedding.
The invention is applicable to items of data which have related features, wherein it is desired to be able to retrieve the related items of data from a particular item of data. Items of data having interreiationships are herein referred to as structured data. Structured data as characterised by having superordinate and subordinate items of data.
Groups of the superordinate and subordinate items of data are herein termed classes of information, there being a major class of information, one or more subordinate classes of information and one or more superordinate classes of information. Each item of data in the major class of information in a structured set of information may have a subordinate class of information referred to as a first class of information. In turn, each item of data in the subordinate class of information may have a subordinate class of information referred to as a second class of information and so on.
Each class of information except the major class may also have a superordinate class of information. For example, the first class of information is superordinate to the second class of information and the major class of information is superordinate to the first class of infor mation. There is no class of information superordinate to the major class.
In accordance with one aspect of the present invention there is provided a data storage and retrieval system having novel labelling of data, the system comprising means to associatively index items of data as they are stored
into the system, the associative indexes being embedded with each of the items of data.In accordance with a further aspect of the present invention there is provided a data storage and retrieval system having novel labelling for data, the system comprising:
a) an input device configured to input items of data for storage;
b) an output device configured to output retrieved items of data;
c) a working memory unit;
d) an indexed data memory unit;
e) an instruction unit configured to receive inputted items of data and configured to embed lables with the items of data so as to associatively index the items of data; and
f) a processor unit connected to the input device, the output device, the working memory unit, the indexed data unit and the instruction unit so as to control communication between each unit of the system in conjunction with instructions stored in the instruction unit.
In accordance with a further aspect of the present invention there is provided a data storage and retrieval system having novel labelling for data, the system comprising:
a) an input device;
b) an output device;
c) a working memory unit;
d) an indexed data memory unit comprising a plurality of items of data, each item of data having an associative index embedded with it;
e) an instruction unit configured to retrieve the items of data stored in the indexed data memory unit via the associative indexes, the instruction unit also being configured to retrieve related items of data via the associative indexes; and
f) a processor unit connected to the input device, the output device, the working memory unit, the indexed data unit and the instruction unit so as to control communication between each unit of the system in conjunction with instructions stored in the instruction unit.
In accordance with a further aspect of the present invention there is provided a process for storage and retrieval of data in a data storage and retrieval system having novel labelling for data, the process characterised in that it comprises the steps of using an associative index to label such items of data to associate the item of data with other items of related data, each associative index being embedded with the data.
In accordance with a further aspect of the present invention there is provided a process for storage of structured data in a data storage and retrieval system having novel labelling for data, the process comprising the steps of:
a) defining the number of classes of information of the structured data to be stored into an indexed data memory unit of the data storage and retrieval system, the class of information comprising a major or most superior class and one or more subordinate classes of information;
b) inputting an item of data via an input device into the data storage and retrieval system;
c) labelling the item of data with an associative index to associate the item of data with other items of related data contained in one or more superior classes of information and to distinguish the item of data from other items of data in the same class of information;;
d) storing the item of data with the associative index into the indexed data memory unit;
e) inputting an item of data of a first subordinate class of information via the input device;
f) repeating steps (b) to (d) supra for all remaining subordinate classes of information in order of decreasing superiority;
g) repeating step (f) supra for the most subordinate class of information until all such items of data are stored; and
h) repeating step (g) for the next most superior class of information until all data relating to the most superior class of information has been stored.
In accordance with a further aspect of the present invention there is provided a process for deletion of structured data in a data storage and retrieval system having novel labelling for data, the system characterised in that it comprises items of data stored in classes of information in an indexed data memory unit, each of the items having an associative index embedded with it so as to associate the item of data with related items of data, the process comprising the steps of:
a) selecting a particular item of data to be deleted from a particular class of information;
b) using the associative index to locate the items of data to be deleted in the indexed data memory unit;
c) deleting the item of data located in step (b) supra;
d) using the associative index for the item of data to locate all related items of data in subordinate classes of information; and
e) deleting the related items of data located in step (d) supra.
In accordance with a further aspect of the present invention there is provided a process for retrieval of structured data from a data storage and retrieval system having novel labelling for data, the system characterised in that it comprises items of data stored in classes of information in an indexed data memory unit of the system, each of the items of data having an associative index embedded with it so as to associate the item of data with related items of data, the process characterised in that it comprises the steps of::
a) listing the classes of information of the structured data which are available for data retrieval from the indexed data memory unit, the classes of information comprising a major class of information and one or more subordinate classes of information;
b) selecting a class of information from the list of classes of information;
c) locating items of data for the selected class of information using the associative indexes;
d) listing the items of data for the selected class of information;
e) selecting an item of data from the selected class of information; and
f) retrieving the selected items of data via an output device of the electronic data storage and retrieval unit.
The data storage and retrieval system and process of the present invention will now be described by way of example with reference to the accompanying drawings in which:
Figure 1 is a block diagram of a data storage and retrieval system in accordance with one aspect of the present invention;
Figure 2 is a tree diagram of a storage organization of data used by the system of Fig.
1 and the process of Fig. 3 and 4;
Figure 3 is a flow diagram of a process for storage, addition and deletion of structured data in accordance with another aspect of the present invention for the system of Fig. 1; and
Figure 4 is a flow diagram of a process for retrieval of structured data in accordance with a further aspect of the present invetnion for the system of Fig. 1.
In Fig. 1 there is shown a data storage and retrieval system 10 comprising an input device 12 connected to a processor unit 14 via a bus 16. The input device 12 is configured to receive data from an operator of the system 10. The input device 12 may be a conventional keyboard, a data input port, a microphone, an acoustic coupler or the like.
The processor unit 14 is connected via a bidirectional bus 18 to an instruction unit 20 containing program instructions which control the operation of the processor unit 10 in accordance with the process of the present invention described hereinafter. A working memory unit 22 is connected to the processor unit 14 via a bidirectional bus 24. The working memory unit 22 is configured to store items of data intermediate to storage and retrieval of data from the system 10.
The processor unit 14 is connected to indexed data memory unit 26 via a bidirectional bus 28. The indexed data memory unit 26 is configured to store items of data associatively indexed by the processor unit 14 under control of the instruction unit 20, as described hereinafter.
The indexed data memory unit 26 may, one embodiment, be configured to store items of data in a hierorchical tree structure T, such as, for example, as shown in Fig. 2. The tree T comprises a plurality of classes of information arranged in a hieronchical structure. In Fig. 2 the hierarchy has its top at the left hand side of the page and its base at the right hand side of the page.
Each vertical line of the tree T represents a member of a class of information and where the vertical lines align vertically the entire class of information is represented. The classes of information are for the purposes of Fig. 2 denoted C1, C2, C3 ON. The major class of information C1 has only one member.
Each horizontal line of the tree T represents an item of data. Items of data in a particular member of a class of information are for the purposes of Fig. 2 denoted D1, D2,
D3 DM.
Although the present invention is described with particular reference to storage of structure data in a hierarchical tree structure T it is to be understood that other structures, including non-hierarchical structures could be used.
The system also comprises an output device 30 connected to the processor unit 14 via a bus 32. The output device 30 is configured to, inter alia, output items of data retrieval from the indexed data memory unit 26. The output device 30 may be a conventional video display unit, or a printer or a loudspeaker or the like. The input device 12, the processor unit 14, the instruction unit 20, the memory units 22 and 26 and the output device 30 may be embodied in a convention computer means such as a digital computer.
Items of data may be input to the processing unit 14 from the input device 12 via the bus 16. The item of data may be items of data for storage in the indexed data memory unit 26 or they may relate to commands to the processor unit 14 to retrieve items of data from the indexed data memory unit 26.
The items of data are stored in the working memory unit 22 via the bus 24 whilst the instruction unit 20 controls the processor unit 14 to determine where to store the items of data in the indexed data memory unit 26. The working unit 22 also stores intermediate data generated by the instruction unit 14 in determining where to store the items of data.
Where the items of data are to be stored in the indexed data memory unit 26 they pass from the working memory unit 22 to the processor 14 via the bus 24 and from the processor unit 14 to the indexed data memory unit 26 via the bus 28 under control of the instruction unit 20. The instruction unit 20 controls the processor unit 14 to store the items of data into a tree structural form such as, for example, the tree structure T shown in
Fig. 2.
Where the items of data relate to commands to retrieve items of data from the indexed data memory unit 26, the items of data are first stored in the working memory unit 22 and used by the instruction unit 20 to control the processor unit 14 to locate terms of data to be retrieved from the tree structure T in the indexed data memory unit 26. The located items of data are retrieved from the indexed data memory unit 26 via the bus 28 and sent to the output device 30 via the bus 32.
The items of data in the indexed data memory unit 26 are conveniently stored in a matrix array having a dimension MXn, where n is the number of columns and is equal to the number of classes of information an where M is the number of rows and is equal to the greatest number of items contained in the class of information. The matrix array is used to provide a convenient representation of the tree T of Fig. 2. In Figs. 3 and 4 there is shown flow diagrams of a process for storage, addition, deletion and retrieval of items of data in the system of Fig. 1. The flow diagram represents logical operation of the processor unit 14 under control of the instruction unit 20.
In the preferred embodiment of the present invention the logic of the flow diagram is implemented as a series of instructions stored in the instruction unit 20.
However, it is to be understood that the logic could be implemented as combinational logic forming a special purpose processor or as microcode.
A process for storage of items of data into the indexed data memory unit 26 will now be described with reference to Fig. 3. The steps of the storage process are represented by logic blocks numbered 40 to 56.
At logic block 40 the number of classes of information which are to be created in the indexed data memory unit 26 is entered into the input device 12 and stored in the working memory unit 22.
In one embodiment the instruction unit 20 directs the processor unit 14 to cause a message to be displayed on the output device 30.
It is intended that the message could be to ask an operator of the system 10 to insert a number representing the number of class of information N to be stored into the indexed data memory unit 26.
The logic blocks 40 to 56 may be considered in pairs. For example, logic blocks 42 and 56, 44 and 54, 46 and 52, and 48 and 50 may each be considered as pairs. Each pair of the logic blocks 42, 56 to 48, 50 forms a recursive loop and the recursive loops are rested one inside the other. In particular the recursive loop 48, 50 is rested inside the recursive loop 46, 52, which is rested inside recrusive loop 42, 56. N recursive loops are depicted in Fig. 3. Each pair of logic blocks 42, 56 to 48. 50 correspond to each class of information C1 to Cn respectively. At logic block 41 the instruction unit 20 directs the processor unit 14 to set the number of recursive loops 42, 56 to 48, 50 to the number of classes of information inputted at logic block 40, for example, N, as shown in Fig. 3.
Also at logic block 41 the operator is directed by the processor unit 14 to insert headings for each of the classes of information. The headings are then acted upon by the processory unit 14, under control of the instruction unit 20 to structure the indexed data memory unit 26 as described hereinabove.
At block 42 the processor unit 14 under control of the instruction unit 20 displays a message to ask the operator to insert a first iem of data D1 for the first class of information C1 (herein abbrieviated to item of data C1D1).
The inserted item of data C1D1 is stored into the working memory unit 22 as described hereinabove. The the instruction unit 20 then directs the processor unit 14 to determine an associative index for the item of data C1D1.
The processor unit 14 determines the associative index so that it will index the item of data C1D1 in an associative manner. Since the first item of data C1D1 has, as yet, no related items of data stored the associate index indicates only the existance of the item of data.
Once the associative index is determined it is attached to the item of data C1D1 by the processor unit 14 and then stored into the indexed data memory unit 26.
At logic block 44 the instruction unit 20 directs the processor unit 14 to display a message to ask the operator to insert a first iem of data D1 for the second class of information C2 (herein abbrieviated to item of data C2Dl).
The item of data C2Dl is again temporarily stored in the working memory unit 22 and the processor unit 14 is directed to determine the associative index to show the relationship between the item of data C2D1 to the item of data D1D1.
The item of data C2D1 must be related in fact to the item of data C1D1. For example, the items of data C2D1 may provide more detailed information for the information of the item of data C1D1.
The above steps are repented at logic blocks 46 to 48 until the first item of data
C3D1...CND1 for all of the class of information (up to class CN) has been inputted, associatively indexed and stored.
Then at logic block 50 the instruction unit 20 directs the processor unit 14 to display a message to ask the operator if he/she has finished storing items of data into the class of information CN. If there are further items of data to store a branch is taken back to logic block 48 and the operator is asked to input a second item of data D2 for the last class of information N (herein abbrieviated to CND2).
The logic block 50 is referred to as a decision and vice versa. Also, if the operator does not desire more superior information then he/she must desire more subordinate (or, for example, more specific) information.
If the operator answers in the negative, a branch is taken to logic block 68 whereat more subordinate information is retrived by using the associative indexed to retrieve all items of data which relate to the chosen item of data in a subordinate manner.
For example, where the items of data are stored in a matrix array of the type described hereinabove all items of data stored in rows of the matrix having the chosen item of data, are retrieved.
Then flow returns to logic block 62 to allow the operator to make further selections.
If the operator answers the question in the affirmative the flow proceeds to logic block 70 whereat the associative indexes are used to retrieve items of data from superordinate class of information. Then the flow block returns to logic block 62.
In summary the data retrieval process comprises the steps of:
a) listing the class of information of the structured data which are available for data retrieval from the indexed data memory unit 26, the class of information comprising a major class of information and one or more subordinate class of information;
b) selecting a class of information from the list of classes of information;
c) locating items of data for the selected class of information using the associative indexes;
d) listing the items of data located from the selected class of information;
e) selecting an item of data from the selected class of information; and
f) retrieving the selected items of data via the output device 30 of the data storage and retrieval system 10.
It is envisaged that the retrieval process could be altered to allow further selections to be made in classes of information other than classes of information which are logically adjacent to a chosen class of information.
A process for addition of items of data to the indexed data memory unit 26 is shown in
Fig. 3. The steps of the data addition process are represented by logic blocks 72 to 76.
The logic blocks 72 to 76 correspond in number to one less than the number of classes of information. The logic blocks 72 to 76 operate to tap into the data storage process at a desired class of information. For example, logic block 72 taps the logic block 42 of the data storage process.
Once the tap is in mode the data storage process operates in its normal way to add data and related data.
A process for deletion of data is shown in
Fig. 2 and is represented by logic blocks 78 to go.
The logic blocks 78, 82 and 86 operate to allow an operator to choose at which class of information items of data are to be deleted.
For example, logic block 78 corresponds to the class of information C1.
The logic blocks 80, 84, 88 and 90 operate to delete a chosen item of data from the chosen class of information. Location of the items of data is effected using the associative indexes. Then all related items of data are deleted using the associative indexes. For example, in a hierarchical data structure such as that of Fig. 2 all items of data of subordinate nature are deleted. More specifically a deletion of the item of data C2D4 (that is the fourth item of data of the second class of information) would lead to the deletion of related information at C3D1 and C3D2 and so on up to and including related information at
CND 1 to CND 11.
In summary the process for data deletion comprises the steps of:
a) selecting a particular item to be deleted from a particular class of information;
b) using the associative indexes to locate the item of data to be deleted in the indexed data memory unit 26;
c) deleting the item of data located in step (b) supra;
d) using the associative index for the item of data to locate all related items of data in subordinate classes of information; and
e) deleting the related items of data located in step (d) supra.
Fig. 3 also comprises logic blocks 92 to 100. The logic blocks 92 and 100 represent respectively the start and finish of the abovementioned processes. The logic blocks 94, 96 and 98 represent decisions to be made by an operator in choosing which one of the three above described processes is to be used. The logic block 94 permits entry to the data storage process with an affirmation. The logic block 96 permits update of the data (addition or deletion) with an affirmation. The logic block 98 permits choice between addition and deletion of data.
A negative response at the logic block 96 permits entry to the data retrieval process of
Fig. 4.
It is envisaged that in performance of the above process a video display unit of the output device 30 could be presented with a list of the classes of information and wherein the class of information under processing at a particular time si high lighted in the list.
It is envisaged that similar lists could be displayed for items of data in selected classes of information. It is also envisaged that the instruction unit 20 could be set to permit addition of classes of information. In use, a person skilled in a particular field of knowledge prepares his/her knowledge into a structured form such as by use of a superordinate and subordinate data structure as shown in the logic block since the operator is required to make a decision as to the future flow of the process.
The item of data CND2 is then inputted, associatively indexed and stored as described hereinabove.
The above steps are repeated unti all of the items of data for the class of information CN have been processed and at logic block 50 the operator answers that there are no more items of data for the class of information CN.
Then the flow continues to a decision logic block (not shown) for the class of information
C(N-1). The said decision logic block is similar to the decision logic block 50 and has a branch to a logic block which is a partner to the decision logic block to form the recursive loop member for the class of information
C(N-1).
At the said decision logic block the processor unit 14 is directed to ask the operator if he/she has finished inputting items of data for the class of information C(N-1).
If more items of data are to be inputted a branch is taken to the corresponding logic block shown dotted between logic blocks 46 and 48 in Fig. 3.
The operator then inputs the second item of data D2 for the class of information C(N-1).
Then as described hereinabove flow continues to the class of information CN and related data is inputted, associatively labelled and stored.
The above steps are repeated for each successively more superior class of information unti the major class of information C1 is reached.
Then the second item of data D2 for the class of information C1 is processed. The above described steps are then all repeated until all of the items of data processed.
In summary, the data storage process comprises the following steps:
a) defining the number of classes of information of the structural data to be stored into the indexed data memory unit 26 of the data storage and retrieval system 10, the classes of information comprising a major class and one or more subordinate classes of information;
b) inputting an item of data via the input device 12 into the data storage and retrieval system;
c) labelling the item of data with an associative index to associate the item of data with other items of related data contained in one or more superior classes of information and to distinguish the item of data from other items of data in the same class of information;
d) storing the item of data with the associative index into the indexed data memory unit 26;;
e) inputting an item of data of a first subordinate class of information via the input device 12;
f) repeating steps (b) to (d) supra for all remaining subordinate classes of information in order of decreasing superiority;
g) repeating step (f) supra for the most subordinate class of information until all such items of data are stored; and
h) repeating step (g) for the next most superior class of information until all data relating to the most superior class of information has been stored. Once all the items of data are processed they are effectively related by the instruction unit 20 by the tree T shown in
Fig. 2.
It has been found preferable structure the items of data in the classes of information so that each class of information generally has not more than about 20 items of data, more particularly not more than about 7 items of data.
The associative indexed generated indicated the relation between each class of information, each intem of data in particular class of information and the relation between a particular item of data and superordinately classed and subordinately classed items of data.
The system 10 now is supplied with knowledge regarding one or more subjects and stored in an associatively indexed manner.
The system 10 is ready for retrieval of items of data.
A process for retrieval of items of data from the indexed data memory unit 26 is shown in Fig. 4. The steps of the storage process are represented by logic blocks numbered 50 to 70.
At logic block 58 the instruction unit 20 directs the processor unit 14 to display the classes of information stored in the indexed data memeory unit 26 and which are available for inspection. Where there are numerous classes of information it is envisaged that the instruction unit 20 could direct that they be listed in alphabetical order, rather than in order of superiority of information.
At logic block 60 the operator makes an entry into the input device 12 to select one of the classes of information for inspection.
At logic block 62 the instruction unit 20 uses the associative indexed to located the closer class of information. Then the items of data in the closer class of information are caused to be displayed on the display means and the operator asked to make a choice therefrom.
The flow then proceeds to logic block 64 whereat the operator is asked as herein described whether further information is desired.
If the operator ensures that no further information is desired a branch is taken to logib block 65 at which the retrieval process ends.
Otherwise the process flows to decision logic block 66 at which the operator is asked if more superior information is required. In the case of hierarchically structured items of data more superior data means more general data tree T of Fig. 2.
The operator then stores the knowledge, items of data at a time, in accordance with the data storage process described hereinabove. As the items of data are stored they are associatively indexed and the indexes are stored with the items of data.
Once the data is stored it may be, retrieved, added to and deleted in accordance with the process described hereinabove.
The system 10 and process of the present invetnion may be used as described in the following two examples.
Example 1
To create a diagnostic system the operator may set the system 10 to have three classes of information (N=3), the classes of information being causes C1, symptoms C2 and remedies C3. By virtue of their nature causes, symptoms and remedies may be considered as hierarchical. The causes, symptoms and remedies could relate to the operation of a chemical plant. In such a case an operator could retrieve data from the system 10 with regard to a symptom noticed during operation of the chemical platn. Then by virtue of logic blocks 68 and 70 the remedies and the causes of the symptom could be retrieved, such data retrieval requiring no knowledge of the likely causes or remedies.
The above use may lead to inductive and delcarative diagnosis. For example, a cause could be deduced by an observed remedy for a particular symptom.
Example 2
The system 10 of the present invention could be used to aid in design criteria such as for a power generation facility. The classes of information in the system 10 could relate to the design criteria of the components of the facility with subordinate classes of information relating to detailing of layout, mechanical, electrical civil design together with health and occupational legislation (for example rain limits and fire hazards) and logistics (for example truck turning circles) and local environmental factors.
By virtue of use of the present invention a person of relatively low skill in a particular field may have the effective skill of the expert who created the store of data contained in the indexed data memory unit 26. The effectiveness of the system 10 then being set by the ability of the expert to input his/her knowledge in a way to accurately represent the relationship between items of the stored data.
The system 10 by virtue of associative indexing allows all items of data to be readily retrievable without having to be familiar with contents of the system 10 or to undergo complicated and time consuming search strategies. In this regard the system 10 is dissimilar to conventional data bases.
Modifications and variations such as would be apparent to a skilled addressee are deemed within the scope of the present invention;
Claims (20)
1. A data storage and retrieval system having novel labelling for data, the system characterised in that it comprises means to associatively index items of data as they are stored into the system, the associative indexes being embedded with each of the items of data.
2. A process for storage and retrieval of data in a data storage and retrieval system having novel labelling for data, the process characterised in that it comprises the steps of using an associative index to label each item of data to associate the item of data with other items of related data, each associative index being embedded with the data upon storage.
3. A data storage and retrieval system having novel labelling for data, the system comprising:
a) an input device configured to input items of data for storage;
b) an output device configured to output retrieved items of data;
c) a working memory unit;
d) an indexed data memory unit;
e) an instruction unit configured to receive inputted items of data and configured to embed labels with the items of data so as to associatively index the items of data; and
f) a processor unit connected to the input device, the output device, the working memory unit, the indexed data unit and the instruction unit so as to control communication between each unit of the system in conjunction with instructions stored in the instruction unit.
4. A data storage and retrieval system having novel labelling for data, the system comprising:
a) an input device;
b) an output device;
c) a working memory unit;
d) an indexed data memory unit comprising a plurality of items of data, each item of data having an associative index embedded with it;
e) an instruction unit configured to retrieve the items of data stored in the indexed data memory unit via the associative indexes, the instruction unit also being configured to retrieve related items of data via the associative indexes; and
f) a processor unit connected to the input device, the output device, the working memory unit, the indexed data unit and the instruction unit so as to control communication between each unit of the system in conjunction with instructions stored in the instruction unit.
5. A process for storage of structured data in a data storage and retrieval system having novel labelling for data, the process characterised in that it comprises the steps of:
a) defining the number of classes of information of the structured data to be stored into an indexed data memory unit of data storage and retrieval system, the classes of information comprising a major class and one or more subordinate classes of information;
b) inputting an item of data via an input device into the data storage and retrieval system;
c) labelling the item of data with an associative index to associate the item of data with other items of related data contained in one or more superior classes of information and to distinguish the item of data from other items of data in the same class of information;
d) storing the item of data with the associative index into the indexed data memory unit;;
e) inputting an item of data of a first subordinate class of information via the input device;
f) repeating steps (b) to (d) supra for all remaining subordinate classes if information in order of decreasing superiority;
g) repeating step (f) supra for the most subordinate class of information until all such items of data are stored; and
g) repeating step (g) for the next most superior class of information until all data relating to the most superior class of information has been stored.
6. A process according to Claim 5, characterised in that the associative index of each item of data is embedded with the item of data upon storage in the indexed data memory unit.
7. A process according to Claim 5, characterised in that the associative index for an item of data comprises a plurality of indexes, some of the indexes being used to associate the item of data with other items of data and others of the indexes being used to distinguish the item of data from other items of data.
8. A process according to Claim 7, characterised in that items of data are stored in a matrix array having a dimension mmxn, n,where n is the number of columns and is equal to the number of classes of information and where m is the number of rows and is equal to the greatest number of items of data contained in the classes of information.
9. A process according to Claim 5, characterised in that it comprises the steps of adding items of data by repeating the steps (b) to (h) and commencing entering the data items at a chosen one of ti t lasses of information, the most superior class of information referred to in step (h) being the chosen class of information at which items of data were commenced to be entered.
10. A process for deletion of structured data in a data storage and retrieval system having novel labelling for data, the system characterised in that it comprises items of data stored in classes of information in an indexed data memory unit, each of the items of data having an associative index embedded with it so as to associate the item of data with related items of data, the process characterised in that it comprises the steps of:
a) selecting a particular item of data to be deleted from a particular class of information;
b) using the associative index to locate the item of data to be deleted in the indexed data memory unit;
c) deleting the item of data located in step (b) supra;
d) using the associative index for the item of data to locate all related items of data in subordinate classes of information; and
e) deleting the related items of data located in step (d) supra.
11. A process for retrieval of structured data from a data storage and retrieval system having novel labelling for data, the system characterised in that it comprises items of data stored in classes of information in an indexed data memory unit of the system, each of the items of data having an associative index embedded with it so as to associate the item of data with related items of data, the process characterised in that it comprises the steps of::
a) listing the classes of information of the structured data which are available for data retrieved from the indexed data memory unit, the class of information comprising a major class of information and one or more subordinate classes of information;
b) selecting a class of information from the list of classes of information;
c) locating items of data for the selected class of information using the associative indexes;
d) listing the items of data located for the selected class of information;
e) selecting an item of data from the selected class of information; and
f) retrieving the selected item of data via an output device of the data storage and retrieval system.
12. A process according to Claim 11, characterised in that it comprises the further steps of:
g) using the associative indexes of the selected item of data of the selected class of information to a subordinate class of information;
h) repeating steps (d) to (f) supra;
i) repeating steps (g) and (h) supra to retrieve more subordinate classes of information.
13. A process according to Claim 11, characterised in that it comprises the further steps of:
g) using the associative indexes of the selected item of data of the selected class of information to go to a superior class of information;
h) repeating steps (d) to (f) supra;
i) repeating (g) and (h) supra to retrieve more superior classes of information.
14. A process according to Claim 11, characterised in that it comprises the step of using the associative indexes to go from one class of information to another class of information, the other class of information being adjacent or remote to the first mentioned class of information.
15. A data storage and retrieval system having novel labelling for data substantially as herein described with reference to the accompanying drawings.
16. A data storage and retrieval system having novel labelling for data substantially as herein described with reference to example 1.
17. A data storage and retrieval system having novel labelling for data and substantially as herein described with reference to example 2.
18. A process for storage of structured data in a data storage and retrieval system having novel labelling for data substantially as herein described with reference to the accompanying drawings.
19. A process for storage of structural data in a data storage and retrieval system having novel labelling for data substantially as herein described with reference to example 1.
20. A process for storage of structured data in a data storage and retrieval system having novel labelling for data substantially as herein described with reference to example 2.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AUPH573686 | 1986-05-05 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| GB8710603D0 GB8710603D0 (en) | 1987-06-10 |
| GB2190772A true GB2190772A (en) | 1987-11-25 |
Family
ID=3771598
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| GB08710603A Withdrawn GB2190772A (en) | 1986-05-05 | 1987-05-05 | Data storage/retrieval |
Country Status (2)
| Country | Link |
|---|---|
| GB (1) | GB2190772A (en) |
| ZA (1) | ZA873197B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1990000776A1 (en) * | 1988-07-07 | 1990-01-25 | Abb Atom Ab | A method and a presentation system for linking of information presented by means of a presentation unit |
| WO1992005503A1 (en) * | 1990-09-21 | 1992-04-02 | Televerket | Means for structuring technical information in establishing a knowledge base and troubleshooting in technical equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3662400A (en) * | 1970-04-28 | 1972-05-09 | Hinderstein & Silber | Subsidiary document identification system |
| GB1402571A (en) * | 1971-01-06 | 1975-08-13 | Mitches G T Jeffery A E | Method for identifying the components of a file |
| GB1458510A (en) * | 1972-12-01 | 1976-12-15 | Canadian Jurimetrics Ltd | Apparatus for updating textual data |
| EP0116761A2 (en) * | 1982-12-18 | 1984-08-29 | University of Strathclyde | Computer memory device for storing associations between data items |
| EP0143164A2 (en) * | 1983-10-03 | 1985-06-05 | Wang Laboratories Inc. | Method for storing and retrieving digital information |
| EP0196064A2 (en) * | 1985-03-27 | 1986-10-01 | Hitachi, Ltd. | System for information storage and retrieval |
-
1987
- 1987-05-05 GB GB08710603A patent/GB2190772A/en not_active Withdrawn
- 1987-05-05 ZA ZA873197A patent/ZA873197B/en unknown
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3662400A (en) * | 1970-04-28 | 1972-05-09 | Hinderstein & Silber | Subsidiary document identification system |
| GB1402571A (en) * | 1971-01-06 | 1975-08-13 | Mitches G T Jeffery A E | Method for identifying the components of a file |
| GB1458510A (en) * | 1972-12-01 | 1976-12-15 | Canadian Jurimetrics Ltd | Apparatus for updating textual data |
| EP0116761A2 (en) * | 1982-12-18 | 1984-08-29 | University of Strathclyde | Computer memory device for storing associations between data items |
| EP0143164A2 (en) * | 1983-10-03 | 1985-06-05 | Wang Laboratories Inc. | Method for storing and retrieving digital information |
| EP0196064A2 (en) * | 1985-03-27 | 1986-10-01 | Hitachi, Ltd. | System for information storage and retrieval |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1990000776A1 (en) * | 1988-07-07 | 1990-01-25 | Abb Atom Ab | A method and a presentation system for linking of information presented by means of a presentation unit |
| WO1992005503A1 (en) * | 1990-09-21 | 1992-04-02 | Televerket | Means for structuring technical information in establishing a knowledge base and troubleshooting in technical equipment |
| US5548714A (en) * | 1990-09-21 | 1996-08-20 | Televerket | Means for structuring technical information in establishing a knowledge base and troubleshooting in technical equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| GB8710603D0 (en) | 1987-06-10 |
| ZA873197B (en) | 1989-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4554631A (en) | Keyword search automatic limiting method | |
| US4879648A (en) | Search system which continuously displays search terms during scrolling and selections of individually displayed data sets | |
| JP2589777B2 (en) | Knowledge system | |
| US5206949A (en) | Database search and record retrieval system which continuously displays category names during scrolling and selection of individually displayed search terms | |
| US5220625A (en) | Information search terminal and system | |
| US7082437B2 (en) | Multimedia search system | |
| EP0727734B1 (en) | Method of automatically generating operation buttons for computer processing | |
| US5301314A (en) | Computer-aided customer support system with bubble-up | |
| US6553382B2 (en) | Data management system for retrieving data based on hierarchized keywords associated with keyword names | |
| US20020059297A1 (en) | Search formulation user interface | |
| US20020013778A1 (en) | Sequential subset catalog search engine | |
| JPS63500548A (en) | Rule-based data search method and device | |
| JPH11272689A (en) | Method and device for information retrieval processing and recording medium where information retrieval processing program is recorded | |
| JPH08305616A (en) | Data management system | |
| GB2143667A (en) | Instruction system topic-interpreting method | |
| GB2190772A (en) | Data storage/retrieval | |
| JPH08305724A (en) | Device for managing design supporting information document | |
| Engel et al. | What, where and whence: means for improving electronic data access. | |
| JPH06282478A (en) | Knowledge information storage device | |
| WO1988002147A1 (en) | Display driven data base search system with a variable search term display system | |
| JPH1166104A (en) | Individual information integrating managing method | |
| JP2821896B2 (en) | Information storage device and information storage method | |
| JPH08263571A (en) | Method and device for image retrieval | |
| EP0569188A1 (en) | Accessing a computer database | |
| JPH06337899A (en) | Information retrieving method and its device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| WAP | Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1) |