Information Storage and Retrieval System

1. A method, utilizing a digital data processing system having a memory system, for creating a digital coded multiple layer data base in such memory system comprising the steps of: a. forming, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another one, said event signals, together, representing a sequence of entries, some of said entries being the same and at least one being different; b. forming a first and second event-time indication, respectively, for each said event signal and for each said entry, representing the order of occurrence thereof; and c. entering in the memory system a stored multi layered data base representing said input comprising the steps of 1. forming a first data base layer comprising the step of storing in said memory system retrievable first layer event-time signals representing the first event-time indications and which represent the order of occurrence of the event signals; and 2. forming a second data base layer comprising the step of storing in said memory system retrievable second layer event-time signals which represent the second event-time indications and which represent the order of occurrence of the corresponding entries.

2. A method according to claim 1 wherein said step of forming in said first layer event-time signal is operative for adding an additional one of such events to existing retrievable event-time signals in the stored data base and comprises the step of: adding a representation of the first event-time indication for the additional event to the retrievable first layer event-time signals existing in said stored data base.

3. A method according to claim 2 wherein said step of forming in said second layer event-time signal is operative for adding an additional one of such entries to the existing data base event-time signals and comprises the step of: adding a representation of the second event-time indication for the additional entry to the retrievable second layer event-time signals existing in said stored data base.

4. A method according to claim 1 wherein said step of storing a retrievable first layer vector signal comprises the steps of: a. testing to determine if a newly formed input entry is not already represented in the first data base layer; and b. operative in response to a determination that an entry is not represented for selectively adding representations for the newly formed entry to the first data base layer utilizing said step of storing in said memory system a retrievable first layer event-time signal.

5. A method according to claim 4 wherein said step of selective adding comprises the step of adding, to the first layer, retrievable event-time signals a representation of the event-time indications representing the order of occurrence of event signals in the entry which is not present.

6. A method according to claim 4 comprising the additional steps of: a. storing in a first area of the memory system a signal indicating each different event signal that has previously been formed; b. said step of testing comprising the steps of 1. testing, for each newly formed event signal, the first memory system area to thereby determine if each of the newly formed event signals is different from any of those previously formed and therefore is new; 2. storing a new entry indicating signal responsive to an indication by the preceding test that any event signal within the newly formed entry is new; and 3. responding to the lack of the new entry indicating signal after forming all event signals of the newly formed entry for testing to determine if such newly formed entry is represented by said stored first layer event-time signals; and c. responding to the lack of presence in the last mentioned test or to the presence of the new entry indicating signal for performing said step of adding the newly formed entry.

7. A method according to claim 4 wherein said step of testing comprises the step of interrogating said retrievably stored first layer event-time signals.

8. A method according to claim 1 wherein the event signals of the input comprise at least one representing a delimiter, at least one such delimiter event signal being formed in each said entry and in said order of occurrence so as to define the boundary thereof, the step of forming a first layer event-time signal comprising the step of forming event-time signals representing the first event-time indications which represent the order of ocurrence of such delimiter event signals.

9. A method, utilizing a digital data processing system having a memory system, for creating a digital coded multiple layer data base in such memory system comprising the steps of: a. forming, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another, said event signals representing, in order of occurrence, a plurality of first level entries, said first level entries representing, in order of occurrence, at least one second level entry, some of said first level entries being the same and at least one being different; b. forming a first entry delimiter signal indicating a boundary among said event signals of each said first level entry; c. forming a second entry delimiter signal indicating a boundary among said first level entries of each said second level entry; d. forming a first event-time indication representing the order of occurrence of each said event signal and each said first entry delimiter signal; e. forming a second event-time indication representing the order of occurrence of each first entry signal and each said second delimiter signal; and f. entering the memory system a stored multi layered data base representing said input comprising the steps of 1. forming a first data base layer comprising the step of storing said memory system a retrievable first layer vector signal corresponding to each said different valued event signal and said first delimiter signal and including the step of forming in each said first layer vector signal a representation of those first event-time indications which represent the order of occurrence of the corresponding valued event signals or said first delimiter signals; and 2. forming a second data base layer comprising the step of storing in said memory system a plurality of retrievable second layer vector signals, those first level entries which are the same having a corresponding second layer vector signal and entries which are different each having a different corresponding second layer vector signal, at least one second level vector signal being included for said second delimiter, and including the step of forming in each said second layer vector signal a representation of those second event-time indications which represent the order of occurrence of the corrsponding first level entries.

10. A method, utilizing a digital data processing system having a memory system, for creating a digital coded multiple layer data base in such memory system comprising the steps of: a. forming, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another, said event signals representing, in order of occurrence, a plurality of first level entries, said first level entires representing, in order of occurrence, at least one second level entry, some of said first level entries being the same and at least one being different, said event signals including at least one representing, for each first level entry, a first delimiter and including at least one representing, for each second level entry, a second delimiter; b. forming a first event-time indication representing the order of occurrence of each said event signal including those representing said first entry delimiter; c. forming a second event-time indication representing the order of occurrence of each first entry signal including those representing said second delimiter; and d. entering in the memory system a stored multi layered data base representing said input comprising the steps of 1. forming a first data base layer comprising the step of storing in said memory system a retrievable first layer vector signal corresponding to each said different valued event signal and for said first delimiter event signal and including the step of forming in each said first layer vector signal a representation of those first event-time indications which represent the order of occurrence of the corresponding valued event signals or said first delimiter event signals; and 2. forming a second data base layer comprising the step of storing in said memory system a plurality of retrievable second layer vector signals, those first level entries which are the same having a corresponding second layer vector signal and entries which are different each having a different corresponding second layer vector signal, at least one second level vector signal being included for said second delimiter event signals, and including the step of forming in each said second layer vector signal a representation of those second event-time indications which represent the order of occurrence of the corresponding first level entries or second entry delimiter signals.

11. A method according to claim 10 wherein said first delimiter event signal and said second delimiter event signal each form a unique event signal among said event signals.

12. A method according to claim 10 wherein said steps of forming in each said first layer vector signal a representation is operative for adding additional ones of such input events to existing first layer vector signal in the stored data base and comprises the step of: a. adding a representation of the first event-time indication for the additional event to a retrievable first layer vector signal existing in said stored data base, the first layer vector signal being the one which corresponds to such additional event.

13. A method according to claim 10 wherein said steps of forming in each said second layer vector signal a representation is operative for adding an additional one of such input first level entries to an existing second layer vector signal in the stored data base and comprises the step of: a. adding a representation of the second event-time indication for the additional second level entry to a retrievable second layer vector signal existing in said stored data base, the second layer vector signal being the one which corresponds to such additional second level entry.

14. A method according to claim 10 comprising the steps of: a. inspecting the event signals and for detecting those which represent said first delimiter; and b. forming the next one of said second event-time indications responsive to the detection of one of said detected event signals which represent said first delimiter.

15. A method according to claim 14 wherein said step of forming the next one of said event-time indications comprises the step of counting said detected event signals.

16. A method according to claim 13 wherein said step of forming said first event-time indications comprises the step of counting each said detected event signal.

17. A method according to claim 10 comprising the additional steps of: a. temporarily storing each said event signal, as it is formed, the temporarily storing step including the step of storing a plurality of said event signals representing at least one first level entry, b. retrieving the temporarily stored event signals from the temporary store, one by one, and c. forming the next one of said first event-time counts upon retrieval of each said first event signals, said step of forming in said first layer vector signal a representation comprising the step of storing a value representing that first event-time count, which is being formed, into the particular first layer vector signal which corresponds to a retrieved one of said first layer event signals.

18. A method according to claim 17 comprising the additional step of testing the retrieved event signals for detecting ones representing said first delimiter, and said step of forming said second event-time indication comprising the step of forming the next second event-time indication responsive to such detection.

19. A method according to claim 17 comprising the additional step of testing the event signals for detecting one representing said second delimiter; said step of forming in each second layer vector signal being responsive to such detection of an event signal representing a second delimiter for performing the step thereof and to thereby store a representation of all second event-time indications for the corresponding second level entry.

20. A method, utilizing a digital data processing system having a memory system, for structuring a digital coded data base in such memory system comprising the steps of: a. forming ordered and coded input event signals representing first and second level entries, one or more input event signals representing a first level entry and one or more first level entries representing events in the second level entry, said input event signals and first level entries each including some which are the same and some which are different; b. forming a first event-time count representing the order of occurrence of individual ones of said input event signals; c. forming a second event-time count representing the order of occurrence of individual ones of said first level entries; and d. entering in the memory system a stored data base representing said input event signals comprising the steps of 1. forming a first layer comprising the step of a. forming a first layer event signal representative of those of said input event signals which represent the same value, a different first layer event signal being formed for input event signals representing different values; b. selecting a first storage area in the memory system corresponding to each said different input event signal; and c. selectively storing in each said first storage area a first layer vector signal which represents said first event-time counts for those of said input event signals which correspond to such first storage area, the selectively storing step being arranged to store only those first level entries not previously stored in the first layer and comprising the step of testing a first level entry to determine if the first event-time count for each one of the input event signals making up a first level entry is already represented in said stored first layer vector signals, and said step of selective storing, storing one or more vector signals representing only those first event-time counts which correspond to a first level entry which does not pass the last mentioned test; and 2. forming a second layer comprising the steps of a. forming a second layer event signal representative of those first level entries which represent the same value, a different second layer event signal being formed for each different valued first level entry; b. selecting a second storage area in said memory system corresponding to each one of said first level entries which differs from the others; and c. storing in each said second storage area a second level vector signal which represents said second event-time counts for those of said first level entries which correspond to such second storage area.

21. A method, utilizing a digital data processing system having a memory system, for structuring a digital coded data base in such memory system and for retrieving comprising the steps of: a. forming different input events for the data base; b. converting each input event to a unique input event signal in an input code, the input event signals representing first and second level entries, one or more input event signals representing a first level entry and one or more first level entries representing events in the second level entry; c. creating a data base in the memory system including the steps of 1. forming a first and a second event-time count representing the order of occurrence of, respectively, said input event signals and said first level entries; and 2. entering in the memory system a stored data base representing said input event signals comprising the steps of a. forming a first layer comprising the steps of 1. forming a first layer event signal representative of those of said input event signals which represent the same value, a different first layer event signal being formed for input event signals representing different values, and 2. selectively storing in said memory system a first layer vector signal corresponding to each said different valued input event signal, each said first layer vector signal representing the first event-time counts for the corresponding valued input event signal, the selectively storing comprising the steps of a. testing to determine if the first event-time count for each one of the input event signals making up a first level entry is already represented in said stored first layer vector signals, and b. enabling the selectively storing step for a first layer entry which does not pass the last mentioned test, and b. forming a second layer comprising the steps of 1. forming a second layer event signal representative of those first level entries which represent the same value, a different second layer event signal being formed for each different valued first level entry, and 2. storing in said memory system a second layer vector signal corresponding to each said different valued first level entry, each said second layer vector signal representing the second event-time counts for the corresponding valued first level entry; d. retrieving selected data from the data base including the steps of 1. forming a request represented by a plurality of request event signals which request may be stored in the data base, 2. forming a request event time signal for each said request event signal which together represent the relative order of occurrence of said request event signals, 3. utilizing said request event signals and request event time signals to interrogate the memory system and locate stored data including the request, and 4. forming an ordered set of layer event signals representing the located data; e. converting each said last formed layer event signal to an output event signal coded in the input code; and f. outputting the output event signals.

22. A method, utilizing a digital data processing system having a memory system, for structuring a digital coded data base in such memory system and for retrieving therefrom comprising the steps of: a. forming different input data events for the data base; b. converting each input data event to a unique input event signal in an input code; c. creating a data base in the memory system including the steps of 1. forming for each input event signal an event time indication which represents its relative order of occurrence; 2 interrogating the input event signal and forming a uniquely coded layer event signal for each different input event signal; 3. responding to the event time indication and the layer event signals for forming in the memory system a data base file which comprises a separately locatable event vector signal for each different layer event signal and including the step of forming in each such event vector signal a representation of those event-time indications which represent the order of occurrence of its layer event signal; d. retrieving selected data from the data base including the steps of 1. utilizing said request event signals and request event-time signals for locating the event vector signal in the data base in the memory system which represents the same event-time value as each event-time signal to be output; and 2. for each one of the plurality of event-time signals to be output forming the layer event signal which corresponds to the event vector signal that has been located; e. converting each said layer event signal to an output event signal coded in the input code; and f. outputting the output event signals.

23. A method, utilizing a digital data processing system having a memory system, for structuring a digital coded data base in such memory system and for retrieving portions of the data base, the structuring comprising the steps of: a. forming, in order of occurrence, a plurality of coded input event signals representing first and second level entries, one or more input event signals representing a first level entry and one or more first level entries representing events in the second level entry, said input event signals and first level entries each including some representing the same and some representing different values; b. forming a first event-time count representing the order of occurrence of individual ones of said input event signals; c. forming a second event-time count representing the order of occurrence of individual ones of said first level entries; and d. entering in the memory system a stored data base representing said input event signals comprising the steps of 1. forming a first layer comprising the steps of a. forming a first layer event signal representative of those of said input event signals which represent the same value, a different first layer event signal being formed for input event signals representing different values, and b. selectively storing in said memory system a first layer vector signal corresponding to each said different valued input event signal, each said first layer vector signal representing the first event-time counts for the corresponding input event signal, the selectively storing step being arranged to store only those first level entries not previously stored in the first layer and comprising the steps of 1. testing a first level entry to determine if the first event-time count for each one of the input event signals making up a first level entry is already represented in said stored first layer vector signals, and said step of selective storing, storing one or more vector signals representing only those first event-time counts which correspond to a first level entry which does not pass the last mentioned test, and 2. forming a second layer comprising the steps of a. forming a second layer event signal representative of each of a plurality of first level entries, a different second layer event signal being formed for each different first level entry, and b. storing in said memory system a second layer vector signal corresponding to each said different first level entry, each said second layer vector signal representing the second event-time count for the corresponding first level entry.

24. A digital data processing system having a memory, means for creating a digital coded multiple layer data base in such memory comprising: a. means for receiving, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another one, said event signals, together, representing a sequence of entries, some of said entries being the same and at least one being different; b. means for forming a first and a second event-time indication, respectively, for each said event signal and for each said entry, representing the order of occurrence thereof; and c. means for entering in the memory system a stored multi layered data base representing said input comprising 1. means for forming a first data base layer comprising means for storing in said memory retrievable first layer event-time signals representing the first event-time indications and which represent the order of occurrence of the event signals; and 2. means for forming a second data base layer comprising means for storing in said memory retrievable second layer event-time signals which represent the second event-time indications and which represent the order of occurrence of the corresponding entries.

25. A system according to claim 24 wherein said means for forming a first layer event-time signal is operative for adding an additional one of such events to existing retrievable event-time signals in the stored data base and comprises: means for adding a representation of the first event-time indication for the additional event to a retrievable first layer event-time signal existing in said stored data base.

26. A system according to claim 25 wherein said means for forming a second layer event-time signal is operative for adding an additional one of such entries to existing event-time signals in the stored data base and comprises: means for adding a representation of the second event-time indication for the additional entry to the retrievable second layer event-time signals existing in said stored data base.

27. A system according to claim 24 wherein said means for storing first layer event-time signals comprises: a. means for testing to determine if a newly formed input entry is not already represented in the first data base layer; and b. said means for storing in said memory retrievable first layer event-time signals comprising means operative in response to a determination that an entry is not represented for selectively adding representations for the newly formed entry to the first data base layer.

28. A system according to claim 27 wherein said means for selective adding comprises means for adding, to the first layer retrievable event-time signals a representation of the event-time indications representing the order of occurrence of event signals in the entry which is not present.

29. A system according to claim 27 comprising: a. means for storing in a first area of the memory system a signal indicating each different event signal that has previously been formed; b. said means for testing comprising 1. means for testing, for each newly formed event signal, the first memory system area to thereby determine if each of the newly formed event signals is different from any of those previously formed and therefore is new; 2. means for storing a new entry indicating signal responsive to an indication by the preceding test that any event signal within the newly formed entry is new; and 3. means responding to the lack of the new entry indicating signal after forming all event signals of the newly formed entry for testing to determine if such newly formed entry is represented by said stored first layer event-time signals; and c. the means for adding the newly formed entry being responsive to the lack of presence in the last mentioned test or to the presence of the new entry indicating signal for adding the newly formed entry.

30. A system according to claim 27 wherein said means for testing comprises means for interrogating said retrievably stored first layer event-time signals.

31. A system according to claim 24 wherein the event signals of the input comprise at least one representing a delimiter, at least one such delimiter event signal being formed in each said entry and in said order of occurrence so as to define the entry boundary, the means for forming a first layer event-time signal comprising means for forming event-time signals respresenting the first event-time indications which represent the order of occurrence of such delimiter event signals.

32. A digital data processing system having a memory system, for creating a digital coded multiple layer data base in such memory system comprising: a. means for forming, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another, said event signals representing, in order of occurrence, a plurality of first level entries, said first level entries representing, in order of occurrence, at least one second level entry, some of said first level entries being the same and at least one being different; b. means for forming a first entry delimiter signal indicating a boundary among said event signals of each said first level entry; c. means for forming a second entry delimiter signal indicating a boundary among said first level entries of each said second level entry; d. means for forming a first event-time indication representing the order of occurrence of each said event signal and each said first entry delimiter signal; e. means for forming a second event-time indication representing the order of occurrence of each first entry signal and each said second delimiter signal; and f. means for entering in the memory system a stored multi layered data base representing said input and comprising 1. means for forming a first data base layer comprising means for storing in said memory system a retrievable first layer vector signal corresponding to each said different valued event signal and said first delimiter signal and including means for forming in each said first layer vector signal a representation of those first event-time indications which represent the order of occurrence of the corresponding valued event signals or said first delimiter signals; and 2. means for forming a second data base layer comprising means for storing in said memory system a plurality of retrievable second layer vector signals, those first level entries which are the same having a corresponding second layer vector signal and entries which are different each having a different corresponding second layer vector signal, at least one second level vector signal being included for said second delimiter, and means for forming in each said second layer vector signal a representation of those second event-time indications which represent the order of occurrence of the corresponding first level entries or second entry delimiter.

33. A digital data processing system having a memory system, for creating a digital coded multiple layer data base in such memory system comprising: a. means for forming, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another, said event signals representing, in order of occurrence, a plurality of first level entries, said first level entries representing, in order of occurrence, at least one second level entry, some of said first level entries being the same and at least one being different, said event signals including at least one representing, for each first level entry, a first delimiter and including at least one representing, for each second level entry, a second delimiter; b. means for forming a first event-time indication representing the order of occurrence of each said event signal including those representing said first entry delimiter; c. means for forming a second event-time indication representing the order of occurrence of each first entry signal including those representing said second delimiter; and d. means for entering in the memory system a stored multi layered data base representing said input comprising 1. means for forming a first data base layer comprising means for storing in said memory system a retrievable first layer vector signal corresponding to each said different valued event signal and for said first delimiter event signal and including the step of forming in each said first layer vector signal a representation of those first event-time indications which represent the order of occurrence of the corresponding valued event signals or said first delimiter event signals; and 2. means for forming a second data base layer comprising means for storing in said memory system a plurality of retrievable second layer vector signals, those first level entries which are the same having a corresponding second layer vector signal and entries which are different each having a different corresponding second layer vector signal, at least one second level vector signal being included for said second delimiter event signals, and including means for forming in each said second layer vector signal a representation of those second event-time indications which represent the order of occurrence of the corresponding first level entries or second entry delimiter signals.

34. A system according to claim 33 including means for forming said first delimiter event signal and said second delimiter event signal as a unique event signal among said event signals.

35. A system according to claim 33 wherein said means for forming in each said first layer vector signal a representation is operative for adding additional ones of such input events to existing first layer vector signals in the stored data base and comprises: means for adding a representation of the first event-time indication for the additional event to a retrievable first layer vector signal existing in said stored data base, the first layer vector signal being the one which corresponds to such additional event.

36. A system according to claim 33 wherein said means for forming in each said second layer vector signal a representation is operative for adding an additional one of such input first level entries to existing second layer vector signals in the stored data base and comprises: means for adding a representation of the second event-time indication for the additional second level entry to a retrievable second layer vector signal existing in said stored data base, the second layer vector signal being the one which corresponds to such additional second level entry.

37. A system according to claim 33 comprising: a. means for inspecting the event signals and for detecting those which represent said first delimiter; and b. means for forming the next one of said event-time indications responsive to the detection of one of said detected event signals which represent said first delimiter.

38. A system according to claim 37 wherein said means for forming the next one of said event-time indications comprises means for counting said detected event signals.

39. A system according to claim 36 wherein said means for forming said first event-time indications comprises the step of counting each said detected event signal.

40. A system according to claim 33 comprising: a. means for temporarily storing each said event signal, as it is formed, the temporarily storing means including means for storing a plurality of said event signals representing at least one first level entry; b. means for retrieving the temporarily stored event signals from the temporary store, one by one; and c. means for forming the next one of said first event-time counts upon retrieval of each said first event signals; said means for forming in said first layer vector signal a representation comprising means for storing a value representing that first event-time count, which is being formed, into the particular first layer vector signal which corresponds to a retrieved one of said first layer event signals.

41. A system according to claim 40 comprising: a. means for testing the retrieved event signals for detecting ones representing said first delimiter; said means for forming said second event-time indication comprising means for forming the next second event-time indication responsive to such detection.

42. A system according to claim 40 comprising: means for testing the event signals for detecting one representing said second delimiter; said means for forming in each said second layer vector signal being responsive to such detection of an event signal representing a second delimiter and to thereby store a representation of all second event-time indications for the corresponding second level entry.

43. A digital data processing system having a memory system, for structuring a digital coded data base in such memory system comprising: a. means for forming ordered and coded input event signals representing first and second level entries, one or more input event signals representing a first level entry and one or more first level entries representing events in the second level entry, said input event signals and first level entries each including some which are the same and some which are different; b. means for forming a first event-time count representing the order of occurrence of individual ones of said input event signals; c. means for forming a second event-time count representing the order of occurrence of individual ones of said first level entries; and d. means for entering in the memory system a stored data base representing said input event signals comprising 2. means for forming a first layer comprising a. means for forming a first layer event signal representative of those of said input event signals which represent the same value, a different first layer event signal being formed for input event signals representing different values; b. means for selecting a first storage area in the memory system corresponding to each said different input event signal; and c. means for selectively storing in each said first storage area a first layer vector signal which represents said first event-time counts for those of said input event signals which correspond to such first storage area, the means for selectively storing comprising means for storing only those first level entries not previously stored in the first layer and means for testing a first level entry to determine if the first event-time count for each one of the input event signals making up a first level entry is already represented in said stored first layer vector signals, and said means for selective storing comprising storing means for one or more vector signals representing only those first event-time counts which correspond to a first level entry which does not pass the last mentioned test; and 2. means for forming a second layer comprising a. means for forming a second layer event signal representative of those first level entries which represent the same value, a different second layer event signal being formed for each different valued first level entry; b. means for selecting a second storage area in said memory system corresponding to each one of said first level entries which differs from the others; and c. means for storing in each said second storage area a second level vector signal which represents said second event-time counts for those of said first level entries which correspond to such second storage area.

44. A digital data processing system having a memory system, for structuring a digital coded data base in such memory system and for retrieving therefrom comprising: a. means for forming different input events for the data base; b. means for converting each input event to a unique input event signal in an input code, the coded input event signals representing first and second level entries, one or more input event signals representing a first level entry and one or more first level entries representing events in the second level entry; c. means for creating a data base in the memory system comprising 1. means for forming a first and a second event-time count representing the order of occurrence of, respectively, said input event signals and said first level entries; and 2. means for entering in the memory system a stored data base representing said input event signals comprising a. means for forming a first layer comprising 1. means for forming a first layer event signal representative of those of said input event signals which represent the same value, a different first layer event signal being formed for input event signals representing different values, and 2. means for selectively storing in said memory system a first layer vector signal corresponding to each said different valued input event signal, each said first layer vector signal representing the first event-time counts for the corresponding valued input event signal, the means for selectively storing comprising a. means for testing to determine if the first event-time count for each one of the input event signals making up a first level entry is already represented in said stored first layer vector signals, and b. means for enabling the means for selectively storing for a first layer entry which does not pass the last mentioned test, and b. means for forming a second layer comprising 1. means for forming a second layer event signal representative of those first level entries which represent the same value, a different second layer event signal being formed for each different valued first level entry, and 2. means for storing in said memory system a second layer vector signal corresponding to each said different valued first level entry, each said second layer vector signal representing the second event-time counts for the corresponding valued first level entry; d. means for retrieving selected data from the data base comprising 1. means for forming a request represented by a plurality of request event signals which request maybe stored in the data base, 2. means for forming a request event-time signal for each said request event signal which together represent the relative order of occurrence of said request event signals, 3. means for utilizing said request event signals and request event time signals to interrogate the memory system and locate stored data including the request, and 4. means for forming an ordered set of layer event signals representing the located data; e. means for converting each said last formed layer event signal to an output event signal coded in the input code; and f. means for outputting the output event signals.

45. A digital data processing system having a memory system for structuring a digital coded data base in such memory system and for retrieving therefrom comprising: a. means for forming different input data events for the data base; b. means for converting each input data event to a unique input event signal in an input code; c. means for creating a data base in the memory system comprising 1. means for forming for each input event signal an event-time indication which represents its relative order of occurrence; 2. means for interrogating the input event signal and forming a uniquely coded layer event signal for each different input event signal; 3. means for responding to the event-time indication and the layer event signals for forming in the memory system a data base file which comprises a separately locatable event vector signal for each different layer event signal and comprising means for forming in each such event vector signal a representation of those event-time indications which represent the order of occurrence of its layer event signal; d. means for retrieving selected data from the data base comprising 1. means for utilizing said request event signals and request event-time signals for locating the event vector signal in the data base in the memory system which represents the same event-time value as each event-time signal to be output; and 2. means, operative for each one of the plurality of event-time signals to be output, for forming the layer event signal which corresponds to the event vector signal that has been located; e. means for converting each said layer event signal to an output event signal coded in the input code; and f. means for outputting the output event signals.

46. A digital data processing system, having a memory system, for structuring a digital coded data base in such memory system and for retrieving therefrom comprising: a. means for forming, in order of occurrence, a plurality of coded input event signals representing first and second level entries, one or more input event signals representing a first level entry and one or more first level entries representing events in the second level entry, said input event signals and first level entries each including some representing the same and some representing different values; b. means for forming a first event-time count representing the order of occurrence of individual ones of said input event signals; c. means for forming a second event-time count representing the order of occurrence of individual ones of said first level entries; and d. means for entering in the memory system a stored data base representing said input event signals comprising 1. means for forming a first layer comprising a. means for forming a first layer event signal representative of those of said input event signals which represent the same value, a different first layer event signal being formed for input event signals representing different values, and b. means for selectively storing in said memory system a first layer vector signal corresponding to each said different valued input event signal, each said first layer vector signal representing the first event-time counts for the corresponding input event signal, means for selectively storing comprising means for storing only those first level entries not previously stored in the first layer and comprising 1. means for testing a first level entry to determine if the first event-time count for each one of the input event signals making up a first level entry is already represented in said stored first layer vector signals, and said means for selective storing comprising means for storing one or more vector signals representing only those first event-time counts which correspond to a first level entry which does not pass the last mentioned test, and 2. means for forming a second layer comprising a. means for forming a second layer event signal representative of each of a plurality of first level entries, a different second layer event signal being formed for each different first level entry, and b. means for storing in said memory system a second layer vector signal corresponding to each said different first level entry, each said second layer vector signal representing the second event-time count for the corresponding first level entry.

47. A method, utilizing a digital data processing system having a memory system, for creating and retrieving a digital coded multiple layer data base in such memory system comprising the steps of: a. forming, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another one, said event signals, together, representing a sequence of entries, some of said entries being the same and at least one being different; b. forming a first and a second event-time indication, respectively, for each said event signal and each said entry, representing the order of occurrence thereof; c. entering in the memory system a stored multi layered data base representing said input comprising the steps of 1. forming a first data base layer representing the first event-time indications; and 2. forming a second data base layer representing the second event-time indications which in turn represent the order of occurrence of the corresponding first layer entries; d. retrieving from the first data base layer comprising the step of forming event signals corresponding to selected first event-time indications represented by the first data base layer; and e. selectively retrieving from the second data base layer comprising the steps of 1. forming a second level event identification signal, and thereby identify a corresponding first level entry, corresponding to selected second event-time indications represented in the second data base layer; and 2. selecting the first event-time indications for use in the step of retrieving from the first data base layer including the step of selecting first event-time indications, represented in the first layer, which are within the first level entries that are identified by such formed second level event identification signal.

48. A digital data processor having a memory system, for creating and retrieving a digital coded multiple layer data base in such memory system comprising: a. means for forming, in a desired order of occurrence, and as input, a plurality of coded event signals, at least some event signals representing the same event and at least one event signal representing an event which is different from another one, said event signals, together, representing a sequence of entries, some of said entries being the same and at least one being different; b. means for forming a first and a second event-time indication, respectively, for each said event signal and each said entry, representing the order of occurrences thereof; c. means for entering in the memory system a stored multi layered data base representing said input comprising 1. means for forming a first data base layer representing the first event-time indications; and 2. means for forming a second data base layer representing second event-time indications which in turn represent the order of occurrence of the corresponding first layer entries; d. means for retrieving from the first data base layer comprising means for forming event signals corresponding to those selected first event-time indications represented by the first data base layer; and e. means for selectively retrieving from the second data base layer comprising: 1. means for forming a second level event identification signal, and thereby identify a corresponding first level entry, corresponding to selected second event-time indications represented in the second data base layer; and 2. means for selecting those first event-time indications for use by the means for retrieving from the first data base layer including means for selecting first event-time indications, represented in the first layer, which are within the first level entries that are identified by such formed second level event identification signal.

49. A data processing method of retrieving, from a memory system, data which is contained in a multiple layered data base, each layer representing an ordered sequence of events and entries in which one or more events represent each entry, in each layer some events being the same and at least one being different, each layer comprising a plurality of separately retrievable event-time signals representing an event-time value for each occurrence of the events which identify the order of occurrence of the events, said data base comprising at least first and second layers, each of a plurality of events in said second layer having a different corresponding entry in said first layer, the method comprising the steps of: a. forming at least one second layer entry identification signal designating a selected second layer entry; b. generating a first layer entry identification signal designating each first layer entry which corresponds to event-time values represented in the designated second layer entry; and c. generating first layer event signals corresponding to the event-time values which are represented in the designated first layer entries.

50. A method according to claim 49 wherein said step of generating first layer event signals comprises the step of ordering the first layer event signals according to the order identified by the event-time values represented in the designated first layer entries.

51. A method according to claim 49 wherein said selected second layer entry contains a plurality of said event-time values and wherein said step of generating a first layer entry identification signal comprises the step of generating one of said first layer entry identification signals for each one of said plurality of event-time values in the selected second layer entry, at least one of said entries designated by such first layer entry identification signals containing a plurality of said first layer event-time values, and wherein said step of generating first layer event signals comprises the step of generating a first layer event signal for each one of a plurality of said first layer event-time values located in each one of the entries designated by each one of the first layer entry identification signals.

52. A method according to claim 51 including the steps of: a. ordering the first layer event signals within each entry of the first layer according to the order identified by the corresponding event-time values of the first layer; and b. ordering the event signals into entry groups according to the designated entries in the first layer and ordering such entry groups according to the order identified by the event-time values represented in the selected second layer entry.

53. A data processing method of retrieving, from a memory system, data which is contained in a multiple layered data base, each layer representing a sequence of entries, each entry having a sequence of events, some events being the same and at least one being different, said data base comprising at least first and second layers each being represented by a plurality of separately retrievable event-time signals, each said retrievable event-time signal representing at least one event-time value which in turn represents the order of occurrence of the corresponding events in the entries, each of a plurality of events n said second layer having a corresponding entry in said first layer, the method comprising the steps of: a. interrogating selected first layer event-time signals to form at least one first layer entry identification signal which designates event-time values in the second layer; b. interrogating the designated event-time values in the second layer to form at least one second layer entry identification signal; c. generating first layer entry identification signals designating the first layer entries which correspond to the second layer event-time values which are represented by event-time values in the designated second layer entry; and d. generating the first layer event signals corresponding to the first layer event-time values in the identified first layer entries.

54. A data processing method of retrieving, from a memory system, data which is contained in a multiple layered data base, each layer representing a sequence of entries, each entry having a sequence of events, some events being the same and at least one being different, said data base comprising at least first and second layers each being represented by a plurality of separately retrievable event-time signals, each said retrievable event-time signal representing at least one event-time value which in turn represents the order of occurrence of the corresponding event in the entries, each of a plurality of events in said second layer having a corresponding entry in said first layer, the method comprising the steps of: a. forming a request comprising at least one first layer event signal which designates at least one event-time value represented by the first layer event-time signal; b. interrogating the designated event-time values in the first layer to form at least one first layer entry identification signal which designates at least one second layer event; c. interrogating the designated event in the second layer to form at least one second layer entry identification signal; d. generating a first layer entry identification signal designating the first layer entries which correspond to second layer event-time values in the designated second layer entry; and e. generating a first layer event signal for output corresponding to each of the first event-time values represented in the designated first layer entry.

55. A method according to claim 54 wherein a series of ordered first layer event signals are formed and including the steps of: a. forming a delimiter signal identifying the boundary of a first level entry in the event signals; and b. responding to said delimiter signal for enabling said step of interrogating the designated event-time values.

56. A method according to claim 55 including the steps of: a. forming a further delimiter signal identifying the boundary of a second level entry in the event signals; and b. responding to said further delimiter signal for enabling said step of interrogating the second layer.

57. A method according to calim 54 wherein a series of ordered first layer event signals are formed and including the steps of: a. forming a delimiter signal identifying the boundary of a second level entry in the event signals; and b. responding to said delimiter signal for enabling said step of interrogating the second layer.

58. A method according to claim 54 wherein a series of ordered first layer event signals are formed and including the steps of: a. forming in said ordered first layer event signals, a delimiter event signal which represents by position the boundary of a first level entry; and b. responding to said delimiter event signal for enabling said step of interrogating the event-time values in the first layer.

59. A method according to claim 58 including the steps of: a. temporarily storing said first layer event signals in order; b. reading out the temporarily stored first layer event signals in order; c. monitoring said read out first layer event signals to detect one representing the delimiter; the step of responding being operative in response to the detection of a first layer event signal representing a delimiter.

60. A method according to claim 54 wherein a series of ordered first layer event signals are formed and including the steps of: a. forming in said ordered first layer event signals, a delimiter event signal which represents by position the boundary of a second level entry; and b. responding to said first layer event signal representing said delimiter for enabling said step of interrogating the second layer.

61. A method according to claim 60 including the steps of: a. temporarily storing said first layer event signals in order; b. reading out the temporarily stored first layer event signals in order; c. monitoring said read out first layer event signals to detect one representing such delimiter; the step of responding being operative in response to the detection of a first layer event signal representing a delimiter.

62. A data processing method of retrieving, from a memory system, data which is contained in a multiple layered data base, the data base representing a sequence of second level entries, each second level entry representing at least one first level entry, each first level entry representing at least one event, some first level entries being the same and at least one being different, some events being the same and at least one being different, the events including a first delimiter identifying a boundary of each first level entry and a second delimiter identifying a boundary of each second level entry, said data base comprising at least a first layer corresponding to said first level entries and a second layer corresponding to said second level entries, each layer being represented by a plurality of separately retrievable vector signals one for each different event of the corresponding layer, each said retrievable vector signal representing at least one event-time value which in turn represents the order of occurrence of the corresponding event, a vector signal being provided in said first layer for said first delimiter event and a vector signal being provided in said second layer for said second delimiter event, the data base events and first level entries forming the events and entries, respectively, in said first layer and the first level entries and second level entries forming the events and entries, respectively, in said second layer, the method comprising the steps of: a. forming a signal designating a desired second layer entry; b. utilizing event-time values in the second delimiter vector signal to locate the event-time values in the designated second layer entry of the second layer; c. generating a first layer entry identification signal designating each first layer entry which corresponds to a second layer vector signal which represents at least one of the located event-time values; d. utilizing the event-time values in the first delimiter vector signal to locate the event-time values in the designated first layer entry of the first layer; and e. generating a first layer event signal corresponding to each first layer vector signal which represents one of the located event-time values.

63. A data processing method of retrieving, from a memory system, data which is contained in a stored layered data base, said data base comprising at least first and second layers, each said first and second layer being represented by retrievable event-time signals representing one or more event-time values which in turn represent the order of occurrence of the corresponding events in the data base, the method comprising the steps of: a. forming events representing a request, the request being composed of a series of entries, a plurality of events representing a first level entry, a plurality of first level entries representing a second level entry; b. forming a first layer event coded signal representing each said request event in order of occurrence; c. selecting and retrieving event-time signals from the first layer; d. interrogating the retrieved event-time signals to form at least one first layer entry identification signal representing at least one entry in said first layer and identifying event-time values represented in the second layer event-time signals; e. selecting and retrieving the second layer event-time signals which represents the identified first layer event-time values; f. interrogating the event-time values represented by the retrieved second layer event-time signals to form at least one second layer entry identification signal; g. generating first layer entry identification signals for output representing the first layer entries which, according to event-time values of the second layer, are present in a second layer entry which is identified by said at least one second layer entry identification signal, the first layer entry identification signals for output being arranged in order of occurrence in the second layer of the data base as represented by event-time values of the second layer; h. generating first layer event coded signals for output representing the first layer events which, according to the event-time values of the first layer, are present in first layer entries of the data base which are identified by said first layer entry identification signals; i. ordering the first layer event coded signals for output in order of occurrence, within each first layer entry, as represented by the event-time values of the first layer, ordering the entries thereof in order of occurrence as represented by event-time values of the second layer; and j. outputting said first layer event coded signals for output.

64. A data processing means for retrieving, from a memory system, data which is contained in the multiple layered data base, each layer representing an ordered sequence of events and entries in which one or more events represent each entry, in each layer some events being the same and at least one being different, each layer comprising a plurality of separately retrievable event-time signals representing an event-time value for each occurrence of events which identify the order of occurrence of the events, said data base comprising at least first and second layers, each of a plurality of events in said second layer having a different corresponding entry in said first layer, the processing means comprising: a. means for forming at least one second layer entry identification signal designating a selected second layer entry; b. means for generating a first layer entry identification signal designating each first layer entry which corresponds to event-time values represented in the designated second layer entry; and c. means for generating first layer event signals corresponding to the event-time values which are represented in the designated first layer entries.

65. A means according to claim 64 wherein said means for generaing first layer event signals comprises means for ordering the first layer event signals according to the order identified by the event-time values represented in the designated first layer entries.

66. A means according to claim 64 wherein said selected second layer entry contains a plurality of said event-time values and wherein said means for generating a first layer entry identification signal comprises means for generating one of said first layer entry identification signals for each one of said plurality of event-time values in the selected second layer, at least one of said entries designated by such first layer entry identification signals containing a plurality of said first layer event-time values, and wherein said means for generating first layer event signals comprises means for generating a first layer event signal for each one of a plurality of said first layer event-time values located in each one of the entries designated by each one of the first layer entry identification signals.

67. A means according to claim 66 including: a. means for ordering the first layer event signals within each entry of the first layer according to the other identified by the corresponding event-time values of the first layer; and b. means for ordering the event signals into entry groups according to the designated entries in the first layer and ordering such entry groups according to the order identified by the event-time values represented in the selected second layer entry.

68. Data processing means for retrieving, from a memory system, data which is contained in a multiple layered data base, each layer representing a sequence of entries, each entry having a sequence of events, some events being the same and at least one being different, said data base comprising at least first and second layers each being represented by a plurality of separately retrievable event-time signals, each said retrievable evnt-time signal representing at least one event-time value which in turn represents the order of occurrence of the corresponding events in the entries, each of a plurality of events in said second layer having a corresponding entry in said first layer, the data processing means comprising: a. means for interrogating selected first layer event-time signals to form at least one first layer entry identification signal which designates event-time values in the second layer; b. means for interrogating the designated event-time values in the second layer to form at least one second layer entry identification signal; c. means for generating first layer entry identification signal designating the first layer entries which correspond to the second layer event-time values which are represented by event-time values in the designated second layer entry; and d. means for generating the first layer event signals corresponding to the first layer event-time values in the identified first layer entries.

69. Data processing means for retrieving, from a memory system, data which is contained in a multiple layered data base, each layer representing a sequence of entries, each entry having a sequence of events, some events being the same and at least one being different, said data base comprising at least first and second layers each being represented by a plurality of separately retrievable event-time signals each said retrievable event-time signal representing at least one event-time value which in turn represents the order of occurrence of the corresponding event in the entries, each of a plurality of events in said second layer having a corresponding entry in said first layer, the data processing means comprising: a. means for forming a request comprising at least one first layer event signal which designates at least one event-time value represented by the first layer event-time signal; b. means for interrogating the designated event-time value in the first layer to form at least one first layer entry identification signal which designates at least one second layer event-time signal; c. means for interrogating the designated event in the second layer to form at least one second layer entry identification signal; d. means for generating a first layer entry identification signal designating the first layer entries which correspond tosecond layer event-time value in the designated second layer entry; and e. means for generating a first layer event signal for output corresponding to each of the first event-time values represented in the designated first layer entry.

70. A means according to claim 69 wherein a series of ordered first layer event signals are formed and including: a. means for forming a delimiter signal identifying the boundary of a first level entry in the event signals; and b. means for responding to said delimiter signal for enabling said means for interrogating the designated event-time values.

71. A means according to claim 70 including: a. means for forming a further delimiter signal identifying the boundary of a second level entry in the event signals; and b. means for responding to said further delimiter signal for enabling said means for interrogating the second layer.

72. A means according to claim 69 wherein a series of ordered first layer event signals are formed and including: a. means for forming a delimiter signal identifying the boundary of a second level entry in the event signals; and b. means for responding to said delimiter signal for enabling said means for interrogating the second layer.

73. A means according to claim 69 wherein a series of ordered first layer event signals are formed and including: a. means for forming in said ordered first layer event signals a delimiter event signal which represents by position the boundary of a first level entry; and b. means for responding to said delimiter event signal for enabling said means for interrogating event-time value in the first layer.

74. A means according to claim 73 including: a. means for temporarily storing said first layer event signals in order; b. means for reading out the temporarily stored first layer event signals in order; c. means for monitoring said read out first layer event signals to detect one representing the delimiter; the means for responding being operative in response to the detection of a first layer event signal representing a delimiter.

75. A means according to claim 69 wherein a series of ordered first layer event signals are formed and including: a. means for forming in said ordered first layer event signals, a delimiter event signal which represents by position the boundary of a second level entry; and b. means responding to said first layer event signal representing said delimiter for enabling said means for interrogating the second layer.

76. A means according to claim 75 including: a. means for temporarily storing said first layer event signals in order; b. means for reading out the temporarily stored first layer event signals in order; c. means for monitoring said read out first layer event signals to detect one representing such delimiter; the means for responding being operative in response to the detection of a first layer event signal representing a delimiter.

77. A data processing method of retrieving, from a memory system, a portion of a stored data base, the data base being represented by retrievable event-time signals which represent event-time values which in turn represent the order of occurrence for corresponding events in the stored data base, the event-time values representing the order of occurrence of events which make up a series of entries each containing at least one event, the method comprising the steps of: a. forming a request comprising a series of coded event signals representing the events of an entry; b. interrogating selected event-time values represented in the data base to locate a data base entry containing event-time values which represent events having a selectable predetermined degree of match with the events represented by the event signals of the request and forming an entry identification signal identifying such data base entry; and c. generating coded event signals for output representing the events which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output being arranged in order of occurrence as represented by event-time values in such entry.

78. A method according to claim 77 wherein said step of interrogating comprises the step of locating a data base entry containing event-time values which represent events which either exactly or inexactly match the events of the request.

79. A method according to claim 78, comprising the steps of: a. forming at least one of different valued signals identifying different allowable degress of match between the events of the request and the events of an entry in the data base; and b. said step of locating comprising the step of locating a data base entry having said allowable degree of match.

80. A method according to claim 77 wherein said step of interrogating to locate an entry with a predetermined degree of match comprises the step of: locating a data base entry which has at least a predetermined number of event-time values representing events positioned within a preselected number of event positions relative to the same events in the request.

81. A data processing method accordng to claim 80 wherein said predetermined number of events is specified by a pipe cutoff value and including the step of providing an input to the data processing system for selecting said pipe cutoff value.

82. A method according to claim 80 wherein said predetermined number of events is computed and comprising the steps of: a. forming a pipe cutoff signal representing the predetermined number of events as a fraction of the number of events in an entry of the request; b. forming a number of events signal for individual entries of the request, representing the number of events therein; and c. utilizing the values represented by said pipe cutoff signal and said number of events signal to form a signal representing the predetermined number of events to be used.

83. A method according to claim 80 wherein said preselected number of event-time values is specified by a pipe width value and including the step of providing an input to the data processing system for altering said pipe width value.

84. A method according to claim 80 wherein said predetermined number of events is computed, comprising the steps of: a. forming a signal representing a pipe cutoff value which represents the predetermined number of events as a fraction of the number of events in an entry; b. counting the number of events, which are represented by event signals, within an entry of the request; c. computing a number value representing the product of said pipe cutoff value and the value represented by the count from the preceding step; d. counting the number of events which are represented by event-time values in the data base and which fall within such preselected number of event positions of the same event in the request; and e. comparing the count, from the last named step of counting, with said number value and, upon a predetermined relation, forming a pass signal indicating that the corresponding entry is located; said step of forming an entry identification signal comprising the step of forming one such signal representing an entry for which a pass signal is formed.

85. A method according to claim 84 wherein said step of forming an entry identification signal comprises the steps of: a. forming an intermediate entry identification signal representing at least one of such located entries; b. interrogating, within the entry identified by said at least one intermediate entry identification signal, the event-time values thereof to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request; and c. forming said entry identification signal representing such data base entry.

86. A method according to claim 85 additionally comprising the step of only locating those data base entries which have at last a preselected degree of match, as to number of events, as well as order and presence of events.

87. A method according to claim 85 additionally comprising the steps of: a. storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. responding to such stored signal for enabling the step of interrogating and locating to comprise the step of only locating a data base entry which has at last a preselected degree of match, as to number of events, as well as order and presence of events.

88. A method according to claim 87 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

89. A method according to claim 85 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

90. A method according to claim 77 wherein said step of forming an entry identification signal comprises the steps of: a. forming an intermediate entry identification signal representing at least one of such ascertained entries; b. further interrogating, within the entry identified by said at last one intermediate entry identification signal, the event-time values of the event-time signals to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request; and c. forming said entry identification signal representing such data base entry.

91. A method according to claim 90 additionally comprising the step of only locating those data base entries which have a selectable preselected degree of match, as to number of events, as well as order and presence of events.

92. A method according to claim 90 additionally comprising the steps of: a. storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. responding to such a stored signal for enabling the step of locating to comprise the step of only locating a data base entry which has at least a preselected degree of match, as to number of events, as well as order and presence of events.

93. A method according to claim 92 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

94. A method according to claim 90 wherein said preselected degree of match is specified by a brightnes value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

95. A method according to claim 77 wherein said step of forming an entry identification signal comprises the step of locating a data base entry which has a selectable preselected degree of match, as to order and presence of events, with the entry of the request.

96. A method according to claim 95 additionally comprising the step of only loating those data base entries which have a selectable preselected degree of match, as to number of events, as well as order and presence of events.

97. A method according to claim 77 comprising the step of selecting those event-time signals from the data base which correspond to the events represented by the event signals of the request.

98. A method according to claim 78 comprising the steps of: a. reading out the selected retrievable event-time signals from the memory system; b. forming an event-time value signal representing event-time values of such read out event-time signals; and the step of interrogating utilizing such formed event-time value signal for the step of interrogation of the selected event-time values.

99. A method according to claim 77 wherein the stored data base comprises at least one event-time signal whose event-time values represented thereby identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, and wherein the step of interrogating comprises the step of interrogating event-time values having values between the values of two successive ones of said delimiter events to thereby determine if the corresponding entry has the predetermined degree of match.

100. A method according to claim 77 wherein the stored data base comprises at least one event-time signal whose event-time values represented thereby identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, wherein the step of forming an entry identification signal comprises the steps of: a. counting the delimiter event-time values to thereby indicate successive entries; and b. forming a signal corresponding to the count for the entry which has such predetermined degree of match.

101. A method according to claim 77 wherein the stored data base comprises at least one event-time signal whose event-time values represented thereby identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, and wherein the step of generating comprises the steps of: a. locating a pair of successive delimiter event-time values identifying the bounds of the entry which corresponds to the entry identification signal; and b. generating coded event signals only for event-time values which lie between such pair of successive event-time values.

102. A method according to claim 101 wherein said step of locating a pair of successive event-time values comprises the steps of: a. counting successive delimiter event-time values until a count is reached having a predetermined relation to the value represented by the entry identification signal; b. utilizing the delimiter event-time value corresponding to such count as one of the pair of successive event-time values.

103. A data processing method of retrieving, from a memory system, a portion of a stored data base, the data base being represented by retrievable event-time signals which represent event-time values which in turn represent the order of occurrence for correspondng events in the stored data base, the evetnt-time values representing the order of occurrence of events which make up a series of entries each containing at least one event, the method comprising the steps of: a. forming a request comprising a series of coded event signals representing the events of an entry; b. forming at least one further coded signal representing the relative order of occurrence of individual event signals in the entry of the request; c. interrogating selected event-time values represented in the data base and utilizing said further coded signals in locating a data base entry containing event-time values which represent events having a predeterimed degree of match with the events represented by the event signals of the request and forming an entry identification signal identifying such data base entry; and d. generating coded event signals for output representing the events which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output being arranged in order of occurrence as represented by event-time values in such entry.

104. A method according to claim 103 wherein said step of interrogating to locate an entry with a predetermined degree of match comprises the step of: a. locating a data base entry which has at leaast a predetermined number of event-time values representing event positioned within a preselected number of event positions of the same events in the request.

105. A method according to claim 104, wherein said step of forming at least one further coded signal comprises the step of forming a coded bias signal corresponding to each of at least some of said event signals of the request; the step of interrogating and locating comprising the steps of: a. combining the value represented by each said bias signal with an event-time value, for the same event signal as for the bias signal, to thereby form biased event-time values; b. storing a pipe width signal representing bounds of a permissible mismatch and hence the preselected number of event positions; c. counting the number of biased signals represented values which fall within preselected bounds of each of selected possible event-time values of the data base, said preselected bounds being identified by said stored pipe width signal; and d. the step of locating an entry including the step of utilizing the count for locating such entry which has such predetermined number of events.

106. A method according to claim 105 comprising the steps of: a. forming a signal representing at least one possible event-time value in at least one entry of the data base; and b. the step of counting comprising the step of utilizing the at least one possible event-time value signal to identify each such selected possible event-time value.

107. A method according to claim 106 wherein said step of interrogating and locating comprises the step of locating a data base entry containing event-time values which represent events which either exactly or inexactly match the events of the request.

108. A method according to claim 107 comprising the steps of: a. forming at least one of different valued signals identifying different allowable degrees of match between the events of the request entry and the events of a data base entry; and b. said step of utilizing the count for locating comprising the step of locating a data base entry having said allowable degree of match.

109. A method according to claim 104 wherein said predetermined number of event-time values is specified by a pipe cutoff value and including the step of providing an input to the data processing system for selecting said pipe cutoff value.

110. A method according to claim 104 wherein said predetermined number of event-time values is computed and comprising the steps of: a. forming a pipe cutoff signal representing the predetermind number of event-time values as a fraction of the number of events in an entry of the request; b. forming a number of events signal for individual entries of the request, representing the number of events therein; and c. utilizing the values represented by said pipe cutoff signal and said number of events signal to form a signal representing the predetermined number of event-time values to be used in locating a data base entry.

111. A method according to claim 105 including the step of providing an input to the data processing system for selecting the value of said pipe width signal.

112. A method according to claim 104 wherein the step of locating a data base entry comprises the steps of: a. forming a signal representing a pipe cutoff value which represents the predetermined number of event-time values as a fraction of the number of events in an entry; b. counting the number of events, which are represented by event signals, within an entry of the request; c. computing a number value representing the product of said pipe cutoff value and the value representing by the count from the preceding step; d. counting the number of events which are represented by event-time values within a selected entry of the dafta base and which fall within such preselected number of event positions of the same event in the request; and e. comparing the count, from the last named step of counting, with said number value and, upon a predetermined relation, forming a pass signal indicating that the corresponding entry is ascertained; said step of forming an entry identification signal comprising the step of forming one such signal representing such selected entry responsive to such pass signal.

113. A method according to claim 103 wherein said step of forming an entry identification signal comprises the steps of: a. forming an intermediate entry identification signal representing at least one of such ascertained entries; b. interrogating, within the data base entry identified by said at least one intermediate entry identification signal to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request; and c. forming said entry identification signal representing such data base entry.

114. A method according to claim 113 wherein the step of locating additionally comprises the step of only locating those data base entries which have at least a preselected degree of match, as to number of events, as well as order and presence of events.

115. A method according to claim 113 wherein the step of locating additionally comprises the steps of: a. storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. responding to such a stored signal for enabling the step of locating to comprise the step of only ascertaining a data base entry which has at least a preselected degree of match, as to number of events, as well as order and presence of events.

116. A method according to claim 115 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

117. A method according to claim 113 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

118. A method according to claim 112 wherein said step of forming an entry identification signal comprises the steps of: a. forming an intermediate entry identification signal representing at least one of such ascertained entries; b. interrogating, within the entry identified by said at least one intermediate entry identification signal, the event-time values of the selected event-time signals to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request; and c. forming said entry identification signal representing such data base entry.

119. A method according to claim 118 wherein the step of locating additionally comprises the step of only locating those data base entries which have at least a preselected degree of match, as to number of events, as well as order and presence of events.

120. A method according to claim 118 wherein the step of locating additionally comprises the steps of: a. storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. responding to such a stored signal for enabling the step of locating to comprise the step of only ascertaining a data base entry which has at least a preselected degree of match, as to number of events, as well as order and presence of events.

121. A method according to claim 120 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for specifying said brightness value cutoff signal.

122. A method according to claim 118 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for specifying said brightness value cutoff signal.

123. A data processing method of retrieving, from a memory system, a portion of a stored data base, the data base being represented by a separately retrievable vector signal for each one of a plurality of different valued events, events of the same value being represented by the same retrievable vector signal, each said vector signal representing at least one event-time value each of which in turn represents the order of occurrence of the corresponding event in the stored data base, the vector signals representing a series of entries each containing at least one event, at least one vector signal having event-time values which identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, the method comprising the steps of: a. forming a request comprising a series of coded event signals representing the events of an entry; b. forming at least one further coded signal representing the relative order of occurrence of individual event signals in the entry of the request; c. interrogating selected vector signals, which correspond to the events of the request, and comprising the step of utilizing said further coded signals and event-time values from the delimiter event vector signal in locating an entry containing event-time values which represent events having a predetermined degree of match with the events represented by the event signal of the request and forming an entry identification signal identifying such entry; and d. generating coded event signals for output representing the event which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output arranged in order of occurrence as represented by event-time values in such entry.

124. A method according to claim 123 wherein said step of locating an entry with a predetermined degree of match comprises the steps of: a. utilizing at least one event-time value from the delimiter event vector signal to locate the event-time values of a data base entry; and b. interrogating the located event-time values to ascertain whether there is at least a predetermined number of event-time values representing events positioned within a preselected number of event positions of the same events in the request.

125. A method according to claim 124 wherein said step of forming at least one further coded signal comprises the step of forming a coded bias signal corresponding to each of at least some of said event signals of the request; the step of locating comprising the steps of: a. combining the value represented by each said bias signal with an event-time value in the selected vector signal, for the same event signal as for the bias signal, to thereby form biased event-time values; b. storing a pipe width signal representing bounds of a permissible mismatch and hence the preselected number of event positions; c. counting the number of biased signals representing values which fall within preselected bounds of each of selected possible event-time values of the data base, said preselected bounds being identified by said stored pipe width signal; and d. utilizing the count for locating such entry which has such predetermined number of events.

126. A method according to claim 125 comprising the steps of: a. utilizing at least one pair of successive event-time values from the delimiter vector signal for forming a signal representing at least one possible event-time value located within limits represented by said pair and hence within at least one entry of the data base; and b. the step of counting comprising the step of utilizing the at least one possible event-time value signal to identify each such selected possible event-time value.

127. A method according to claim 126 wherein said step of interrogating and locating comprises the step of: a. locating a data base entry containing event-time values which represent events which may not exactly match the events of the request.

128. A method according to claim 127 comprising the steps of: a. forming a signal identifying an allowable degree of match between the events of the request entry and the events of a data base entry; and b. said step of utilizing the count for locating comprising the step of locating a data base entry having said allowable degree of match.

129. A method according to claim 124 wherein said predetermined number of event-time values is specified by a pipe cutoff value and including the step of providing an input of the data processing system for altering said pipe cutoff value.

130. A method according to claim 124 wherein said predetermined number of event-time values is computed and comprising the steps of: a. forming a pipe cutoff signal representing the predetermined number of event-time values as a fraction of the number of events in an entry of the request; b. forming a number of events signal for individual entries of the request, representing the number of events therein; and c. utilizing the values represented by said pipe cutoff signal and said number of events signal to form a signal representing the predetermined number of event-time values to be used in locating a data base entry.

131. A method according to claim 125 including the step of providing an input to the data processing system for altering the value of said pipe width signal.

132. A method according to claim 124 wherein the step of locating a data base entry comprises the steps of: a. forming a signal representing a pipe cutoff value which represents the predetermined number of event-time values as a fraction of the number of events in an entry; b. counting the number of events, which are respesented by event signals, within an entry of the request; c. computing a number value representing the product of said pipe cutoff value and the value represented by the count from the preceding step; d. utilizing at least one pair of successive event-time values from the delimiter vector signal for forming a signal representing at least one possible event-time value located within limits represented by said pair and hence within at least one entry of the data base; e. counting the number of events which are represented by event-time values within a selected entry of the data as defined by said pair of successive event-time values and which fall within such preselected number of event positions of the same event in the request; and f. comparing the count, from the last named step of counting, with said number value and, upon a predetermined relation, forming a pass signal indicating that the corresponding entry is ascertained; said step of forming an entry identification signal comprising the steps of: a. counting the event-time values represented by the delimiter vector signal to form a count corresponding to each said data base entry; and b. utilizing said count for forming an entry signal representing the at least one entry responsive to such pass signal.

133. A data processing method of retrieving, from a memory system, a portion of a stored data base, the data base being represented by retrievable event-time signals which represent event-time values which in turn represent the order of occurrence of the corresponding events in the stored data base, the event-time signals representing the order of occurrence of events which make up a series of entries each containing at least one event, the method comprising the steps of: a. forming a request comprising a series of coded event signals representing the events of an entry; b. forming at least one signal identifying an allowable degree of match between the events of the request and the events of an entry in the data base; c. locating a data base entry containing event-time values which represent events which either exactly or inexactly match the events of the request, comprising the steps of: 1. interrogating selected data base event-time values for locating at least one data base entry which has at least a predetermined number of event-time values representing events positioned within a preselected number of event positions relative to the same events in the request, 2. forming an intermediate entry identification signal identifying said at least one data base entry, 3. further interrogating, within the data base entry identified by said at least one intermediate entry identification signal to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request, and 4. forming an entry identification signal representing the last located data base entry; and d. generating coded event signals for output representing the events which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output being arranged in order of occurrence as represented by event-time values in such entry.

134. A method according to claim 133 wherein said step of further interrogating may locate plural entries and wherein said step of forming an entry identification signal comprises the step of: a. forming an entry identification signal representing each of said plural entries.

135. A method according to claim 134 comprising the step of: a. computing a value for each said entry identification signal representing the actual degree of match as to order and presence of events between the corresponding data base entry and the entry of the request.

136. A method according to claim 135 comprising the step of: a. ordering the entry identification signals in order by the corresponding degree of match value.

137. A method according to claim 136 comprising the step of storing the ordered entry identification signals in such order together each with a signal representing the degree of match value.

138. A method according to claim 136 wherein said step of generating comprises the step of performing said step of generating coded signals for output representing each data base entry identification by each said entry identification signal and in sequence according to said ordering.

139. A method according to claim 133 wherein said step of generating comprises the step of generating an event signal for each of a plurality of event-time values in an entry which contains a greater number of event-time values than there are events in the original request.

140. A data processing method of retrieving, from a memory system, data which is contained in a multiple layered data base, each layer representing an ordered sequence of entries and events in which one or more events represent each entry, in each layer some such events being the same and at least one being different, each layer comprising retrievable event-time signals which represent event-time values which in turn identify the order of occurrence of the corresponding events, said data base comprising at least first and second layers, each of a plurality of events in said second layer having a corresponding entry in said first layer, the method comprising the steps of: a. forming a request comprising plural entries, each entry being represented by a least one coded event signal, the entries and events being ordered in order of occurrence; b. interrogating the first data base layer and locating, for each of a plurality of the request entries, at least one first layer entry having event-time values which represent events bearing at least a predetermined degree of match to events represented by the corresponding request event; c. interrogating those second layer even-time values for events which correspond to the located first layer entries to locate at least one second layer entry containing event-time values which represent first layer entries having a predetermined degree of match with the request entries; d. generating a first layer entry identification signal representing each first layer entry (second layer event) which, according to second layer event-time values, are present in the located second layer entry; and e. generating a first layer event signal corresponding to each event-time value contained in each first layer entry which is identified by each said first layer entry identification signal.

141. A method according to claim 140 comprising the steps of: a. ordering the generated first layer event signals, within each entry, according to the corresponding first layer event-time values; and b. ordering entries which comprise said event signals according to the corresponding second layer event-time values.

142. A method according to claim 140 wherein said step of interrogating and locating a second layer entry comprises the step of: a. locating a second layer entry containing second layer event-time values which represent first layer entries which either exactly or inexactly match the entries of the request.

143. A method according to claim 142 comprising the steps of: a. forming at least one of different valued signals representing different allowable degrees of match between the entries of the request and the first layer entries represented by second layer data base entries; and b. said step of interrogating and locating a second layer entry comprising the step of locating a second layer entry having at least said allowable degree of match.

144. A method according to claim 140 wherein said step of interrogating and locating second layer entries comprises the step of: a. locating a second layer entry which has at least a predetermined number of event-time values representing first layer entries (second layer events) positioned within a preselected number of entry positions relative to the corresponding entries in the request.

145. A data processing method according to claim 144 wherein said predetermined number of entries is specified by a pipe cutoff value and including the step of providing an input to the data processing system for selecting said pipe cutoff value.

146. A method according to claim 144 wherein said predetermined number of entries is computed and comprising the steps of: a. forming a pipe cutoff signal representing the predetermined number of entries as a fraction of the number of entries in the request; b. forming a number of entries signal for individual entries of the request, representing the number of entries therein; and c. utilizing the values represented by said pipe cutoff signal and said number of entries signal to form a signal representing the predetermined number of entries to be used.

147. A method according to claim 144 wherein said preselected number of entry positions is specified by a pipe width value and including the step of providing an input to the data processing system for selecting said pipe width value.

148. A method according to claim 144 wherein said predetermined number of entries is computed, comprising the steps of: a. forming a signal representing a pipe cutoff value which represents the predetermined number of entries as a fraction of the number of entries in the request; b. counting the number of entries in the request; c. computing a number value representing the product of said pipe cutoff value and the value represented by the count from the preceding step; d. counting the number of first layer entries which are represented by second layer event-time values and which fall within such preselected number of entry positions of the same entry in the request; the second layer event-time values being those represented by the located first layer entries; and e. comparing the counts, from the last named step of counting, with said number value for a predetermined relation indicating that the corresponding second layer entry is a located one.

149. A method according to claim 148 wherein the second layer entry that is recited as being located is an intermediate second layer entry, and comprising the step of: a. further interrogating, within the located at least one intermediate second layer entry among the event-time values of the second layer event-time signals which correspond to the located first layer entry, to thereby locate a second layer entry which has at least a preselected degree of match, as to order and presence of first layer entries represented thereby, with the entries of the request, such located second layer entry being the one used in the step of generating a first layer entry identification signal.

150. A method according to claim 149 additionally comprising the step of only locating those second layer entries which have at least a preselected degree of match, as to number of represented first layer entries, as well as order and presence of entries.

151. A method according to claim 149 additionally comprising the steps of: a. storing a signal indicating if relative number of entries between a request and the data base is to be accounted for; and b. responding to such a stored signal for enabling the step of interrogating and locating to comprise the step of only locating a data base entry which has at least a preselected degree of match, as to number of represented first layer entries, as well as order and presence of entries.

152. A method according to claim 151 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

153. A method according to claim 149 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an inut to the data processing system for selecting said brightness value cutoff signal.

154. A method according to claim 140 wherein said step of interrogating and locating comprises the step of: a. locating a second layer data base entry which has at least a preselected degree of match, as to order and presence of entries, with the request.

155. A method according to claim 154 wherein the step of locating additionally comprises the step of only locating those data base entries which have at least a preselected degree of match, as to number of events, as well as order and presence of events.

156. A method according to claim 140 additionally comprising the steps of: a. storing a signal indicating if relative number of entries between a request and the data base is to be accounted for; and b. responding to such a stored signal for enabling the step of interrogating and locating to comprise the step of only locating a data base entry which has at least a preselected degree of match, as to number of entries, as well as order and presence of entries.

157. A method according to claim 154 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

158. A method according to claim 152 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

159. A method according to claim 140 comprising the steps of forming signals representing the boundaries of said second layer entries, and wherein the step of interrogating the second layer event -time values signals comprises the step of interrogating second layer event-time values representing occurrences of events which lie between the values represented by two successive ones of said boundary signals to thereby determine if the corresponding second layer entry has the predetermined degree of match.

160. A method according to claim 140 wherein the stored data base comprises at least one event-time signal whose event-time values represent the order of occurrence of delimiter events, at least one delimiter event defining a boundary of each of said second layer entries, and wherein the step of forming an entry identification signal comprises the steps of: a. counting the event-time values of the delimiter event-time values to thereby indicate successive entries; and b. forming a signal corresponding to the count for the second layer entry which has such predetermined degree of match.

161. A method according to claim 144 wherein the stored data base comprises at least one event-time signal whose event-time values represent the order of occurrence of delimiter events, at least one delimiter event defining a boundary of each of said entries, and wherein the step of generating comprises the steps of: a. locating a pair of successive event-time values in such at least one delimiter event-time signal identifying the bounds of the located second layer entry; and b. generating first layer entry identification signals only for second layer event-time values which lie between such pair of successive event-time values.

162. A method according to claim 161 wherein said step of locating a pair of successive event-time values comprises the steps of: a. counting successive event-time values of the at least one delimiter event-time signal until a count is reached having a predetermined relation to the located second layer entry; and b. utilizing the delimiter event-time value corresponding to such count as one of the pair of successive event-time values.

163. A method according to claim 140 comprising the step of forming at least one further coded signal representing the order of occurrence of individual entries in the request, the step of interrogating including the step of utilizing said further coded signal to locate the at least one second layer entry.

164. A method according to claim 163 wherein said step of forming at least one further coded signal comprises the step of forming a coded bias signal corresponding to each of at least some of said entries of the request, the step of interrogating and locating at least one second layer entry comprising the steps of: a. combining the value represented by each said bias signal with a second layer event-time value to thereby form biased event-time values; b. storing a pipe width signal representing bounds of a permissible mismatch and hence the preselected number of entry positions; c. counting the numbr of biased signals representing values which fall within preselected bounds of each of selected possible second layer event-time values, said preselected bounds being identified by said stored pipe width signal; and d. the step of locating an entry including the step of utilizing the count for locating such second layer entry which represents such predetermined number of first layer entries.

165. A method according to claim 164 comprising the steps of: a. forming a signal representing at least one possible second layer event-time value in at least one second layer entry of the data base; and b. the step of counting comprising the step of utilizing the at least one possible event-time value signal to identify each such selected possible event-time value.

166. A data processing means for retrieving, from a memory system, a portion of a stored data base, the data base being represented by retrievable event-time signals which represent event-time values which in turn represent the order of occurrence of the corresponding event in the stored data base, the event-time values representing the order of occurrence of a series of entries each containing at least one event, the processing means comprising: a. means for forming a request comprising a series of coded event signals representing the events of an entry; b. means for interrogating selected event-time values represented in the data base to locate a data base entry containing event-time values which represent events having a selectable predetermined degree of match with the events represented by the event signals of the request and forming an entry identification signal identifying such data base entry; and c. means for generating coded event signals for output representing the events which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output being arranged in order of occurrence as represented by event-time values in such entry.

167. A means according to claim 166 wherein said means for interrogating comprises means for locating a data base entry containing event-time values which represent events which either exactly or inexactly match the events of the request.

168. A means according to claim 167 comprising: a. means for forming at least one of different valued signals identifying different allowable degrees of match between the events of the request and the events of an entry in the data base; and b. said means for locating comprising means for locating a data base entry having said allowable degree of match.

169. A means according to claim 166 wherein said means for interrogating to locate an entry with a predetermined degree of match comprises means for locating a data base entry which has at least a predetermined number of event-time values representing events positioned within a preselected number of event positions relative to the same events in the request.

170. A means according to claim 169 wherein said predetermined number of events is specified by a pipe cutoff value and including means for providing an input to the data processing system for selecting said pipe cutoff value.

171. A means according to claim 169 wherein said predetermined number of events is computed and comprising: a. means for forming a pipe cutoff signal representing the predetermined number of events as a fraction of the number of events in an entry of the request; b. means for forming a number of events signal for individual entries of the request, representing the number of events therein; and c. means for utilizing the values represented by said pipe cutoff signal and said number of events signal to form a signal representing the predetermined number of events to be used.

172. A means according to claim 169 wherein said preselected number of event-time values is specified by a pipe width value and including means for providing an input to the data processing system for altering said pipe width value.

173. A means according to claim 169 wherein said predetermined number of events is computed, comprising: a. means for forming a signal representing a pipe cutoff value which represents the predetermined number of events as a fraction of the number of events in an entry; b. means for counting the number of events, which are represented by event signals, within an entry of the request; c. means for computing a number value representing the product of said pipe cutoff value and the value represented by the count from the preceding step; d. means for counting the number of events which are represented by event-time values in the data base and which fall within such preselected number of event positions of the same event in the request; and e. means for comparing the count, from the last named step of counting, with said number value and, upon a predetermined relation, forming a pass signal indicating that the corresponding entry is located; said means for forming an entry identification signal comprising the means for forming one such signal representing an entry for which a pass signal is formed.

174. A means according to claim 173 wherein said means for forming an entry identification signal comprises the steps of: a. means for forming an intermediate entry identification signal representing at least one of such located entries; b. means for interrogating, within the entry identified by said at least one intermediate entry identification signal, the event-time values thereof to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request; and c. means for forming said entry identification signal representing such data base entry.

175. A means according to claim 174 additionally comprising means for only locating those data base entries which have at least a preselected degree of match, as to number of events, as well as order and presence of events.

176. A means according to claim 174 additionally comprising: a. means for storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. means for responding to such a stored signal for enabling the step of interrogating and locating to comprise the means for only locating a data base entry which has at least a preselected degree of match, as to number of events, as well as order and presence of events.

177. A means according to claim 176 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

178. A means according to claim 174 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

179. A means according to claim 166 wherein said means for forming an entry identification signal comprises: a. means for forming an intermediate entry identification signal representing at least one of such located entries; b. means for further interrogating, within the entry identified by said at least one intermediate entry identification signal, the event-time values of the event-time signals to locate a data base entry which has at least a preseleted degree of match, as to order and presence of events, with the entry of the request; and c. means for forming said entry identification signal representing such data base entry.

180. A means according to claim 179 additionally comprising means for only locating those data base entries which have a selectable preselected degree of match, as to number of events, as well as order and presence of events.

181. A means according to claim 179 additionally comprising: a. means for storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. means for responding to such a stored signal for enabling the step of locating to comprise the step of only locating a data base entry which has at least a preselected degree of match, as to number of events, as well as order and presence of events.

182. A means according to claim 181 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

183. A means according to claim 179 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

184. A means according to claim 166 wherein said means for forming an entry identification signal comprises means for locating a data base entry which has at least a selectable preselected degree of match, as to order and presence of events, with the entry of the request.

185. A means according to claim 184 additionally comprising means for only locating those data base entries which have a selectable preselected degree of match, as to number of events, as well as order and presence of events.

186. A means according to claim 166 comprising means for selecting those retrievable event-time signals from the data base which correspond to the events represented by the event signals of the request.

187. A means according to claim 167 comprising: a. means for reading out the selected retrievable event-time signals from the memory system; b. means for forming an event-time value signal representing event-time values of such read out event-time signals; and the means for interrogating utilizing such formed event-time value signal for the step of interrogation of the selected event-time values.

188. A means according to claim 166 wherein the stored data base comprises at least one event-time signal whose event-time values represented thereby identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, and wherein the means for interrogating comprises means for interrogating event-time values having values between the values of two successive ones of said delimiter events to thereby determine if the corresponding entry has the predetermined degree of match.

189. A means according to claim 166 wherein the stored data base comprises at least one event-time signal whose event-time values represented thereby identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, wherein the means for forming an entry identification signal comprises: a. means for delimiter event-time values to thereby indicate successive entries; and b. means for forming a signal corresponding to the count for the entry which has such predetermined degree of match.

190. A means according to claim 166 wherein the stored data base comprises at least one event-time signal whose event-time values represented thereby identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, and wherein the means for generating comprises: a. means for locating a pair of successive delimiter event-time values identifying the bounds ot the entry which corresponds to the entry identification signal; and b. means for generating coded event signals only for event-time values which lie between such pair of successive event-time values.

191. A means according to claim 190 wherein said step of locating a pair of successive event-time values comprises: a. means for counting successive delimiter event-time values until a count is reached having a predetermined relation to the value represented by the entry identification signal; and b. means for utilizing the delimiter event-time value corresponding to such count as one of the pair of successive event-time values.

192. A data processing means for retrieving, from a memory system, a portion of a stored data base, the data base being represented by retrievable event-time signals which represent event-time values which in turn represent the order of occurrence for corresponding events in the stored data base, the event-time values representing the order of occurrence of events which make up a series of entries each containing at least one event, the processing means comprising: a. means for forming a request comprising a series of coded event signals representing the events of an entry; b. means for forming at least one further coded signal representing the relative order of occurrence of individual event signals in the entry of the request; c. means for interrogating event-time values represented in the data base and utilizing said further coded signals in locating a data base entry containing event-time values which represent events having a predetermined degree of match with the events represented by the event signals of the request and forming an entry identification signal identifying such data base entry; and d. means for generating coded event signals for output representing the events which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output being arranged in order of occurrence as represented by event-time values in such entry.

193. A means according to claim 192 wherein said means for interrogating to locate an entry with a predetermined degree of match comprises means for locating a data base entry which has at least a predetermined number of event-time values representing events positioned within a preselected number of event positions of the same events in the request.

194. A means according to claim 193 wherein said means for forming at least one further coded signal comprises the step of forming a coded bias signal corresponding to each of at least some of said event signals of the request, the means for interrogating and locating comprising: a. means for combining the value represented by each said bias signal with an event-time value, for the same event signal as for the bias signal, to thereby form biased event-time values; b. means for storing a pipe width signal representing bounds of a permissible mismatch and hence the preselected number of event positions; c. means for counting the number of biased signals representing values which fall within preselected bounds of each of selected possible event-time values of the data base, said preselected bounds being identified by said stored pipe width signal; and d. the means for locating an entry including means for utilizing the count for locating such entry which has such predetermined number of events.

195. A means according to claim 194 comprising: a. means for forming a signal representing at least one possible event-time value in at least one entry of the data base; and b. the means for counting comprising means for utilizing the at least one possible event-time value signal to identify each such selected possible event-time value.

196. A means according to claim 195 wherein said means for interrogating and locating comprises means for locating a data base entry containing event-time values which represent events which either exactly or inexactly match the events of the request.

197. A means according to claim 196 comprising: a. means for forming at least one of different valued signals identifying different allowable degrees of match between the events of the request entry and the events of a data base entry; and b. said means for utilizing the count for locating comprising means for locating a data base entry having said allowable degree of match.

198. A means according to claim 193 wherein said predetermined number of event-time values is specified by a pipe cutoff value and including means for providing an input to the data processing system for selecting said pipe cutoff value.

199. A means according to claim 193 wherein said predetermined number of event-time values is computed and comprising: a. means for forming a pipe cutoff signal representing the predetermined number of event-time values as a fraction of the number of events in an entry of the request; b. means for forming a number of events signal for individual entries of the request, representing the number of events therein; and c. means for utilizing the values represented by said pipe cutoff signal and said number of events signal to form a signal representing the predetermined number of event-time values to be used in locating a data base entry.

200. A means according to claim 194 including means for providing an input to the data processing system for selecting the value of said pipe width signal.

201. A means according to claim 193 wherein means for locating a data base entry comprises: a. means for forming a signal representing a pipe cutoff value which represents the predetermined number of event-time values as a fraction of the number of events in an entry; b. means for counting the number of events, which are represented by event signals, within an entry of the request; c. means for computing a number value representing the product of said pipe cutoff value and the value represented by the count from the preceding step; d. means for counting the number of events which are represented by event-time values within a selected entry of the data base and which fall within such preselected number of event positions of the same event in the request; and e. means for comparing the count, from the last named step of counting, with said number value and, upon a predetermined relation, forming a pass signal indicating that the corresponding entry is ascertained; said means for forming an entry identification signal comprising means for forming one such signal representing such selected entry responsive to such pass signal.

202. A means according to claim 193 wherein said means for forming an entry identification signal comprises: a. means for forming an intermediate entry identification signal representing at least one of such ascertained entries; b. means for interrogating, within the data base entry identified by said at least one intermediate entry identification signal to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request; and c. means for forming said entry identification signal representing such data base entry.

203. A means according to claim 202 wherein the means for locating additionally comprises means for only locating those data base entries which have at least a preselected degree of match, as to number of events, as well as order and presence of events.

204. A means according to claim 202 wherein the means for locating additionally comprises: a. means for storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. means for responding to such a stored signal for enabling the means for locating to comprise means for only ascertaining a data base entry which has at least a preselected degree of match, as to number of events, as well as order and presence of events.

205. A means according to claim 204 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

206. A means according to claim 202 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

207. A means according to claim 202 wherein said means for forming an entry identification signal comprises: a. means for forming an intermediate entry identification signal representing at least one of such ascertained entries; b. means for interrogating, within the entry identified by said at least one intermediate entry identification signal, the event-time values of the selected event-time signals to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request; and c. means for forming said entry identification signal representing such data base entry.

208. A means according to claim 207 wherein the means for locating additionally comprises means for only locating those data base entries which have at least a preselected degree of match, as to number of events, as well as order and presence of events.

209. A means according to claim 207 wherein the means for locating additionally comprises: a. means for storing a signal indicating if relative number of events between a request and the data base is to be accounted for; and b. means for responding to such a stored signal for enabling the means for locating to only ascertain a data base entry which has at least a preselected degree of match, as to number of events, as well as order and presence of events.

210. A means according to claim 209 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for specifying said brightness value cutoff signal.

211. A means according to claim 207 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for specifying said brightness value cutoff signal.

212. A data processing means for retrieving, from a memory system, a portion of a stored data base, the data base being represented by a separately retrievable vector signal for each one of a plurality of different valued events, events of the same value being represented by the same retrievable vector signal, each said vector signal representing at least one event-time value each of which in turn represents the order of occurrence of the corresponding event in the stored data base, the vector signals representing a series of entries each containing at least one event, at least one vector signal having event-time values which identify the order of occurrence of a delimiter event, an identified delimiter event defining a boundary of each of said entries, the means comprising: a. means for forming a request comprising a series of coded event signals representing the events of an entry; b. means for forming at least one further coded signal representing the relative order of occurrence of individual event signals in the entry of the request; c. means for interrogating selected vector signals, which correspond to the events of the request, and comprising means for utilizing said further coded signals and event-time values from the delimiter event vector signal in locating an entry containing event-time values which represent events having a predetermined degree of match with the events represented by the event signals of the request and forming an entry identification signal identifying such entry; and d. means for generating coded event signals for output representing the event which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output being arranged in order of occurrence as represented by event-time values in such entry.

213. A means according to claim 212 wherein said means for locating an entry with a predetermined degree of match comprises: a. means for utilizing at least one event-time value from the delimiter event vector signal to locate the event-time values of a data base entry; and b. means for interrogating the located event-time values to ascertain whether there is at least a predetermined number of event-time values representing events positioned within a preselected number of event positions of the same events in the request.

214. A means according to claim 213 wherein said means for forming at least one further coded signal comprises means for forming a coded bias signal corresponding to each of at least some of said event signals of the request, the means for locating comprising: a. means for combining the value represented by each said bias signal with an event-time value in the selected vector signal, for the same event signal as for the bias signal, to thereby form biased event-time values; b. means for storing a pipe width signal representing bounds of a permissible mismatch and hence the preselected number of event positions; c. means for counting the number of biased signals representing values which fall within preselected bounds of each of selected possible event-time values of the data base, said preselected bounds being identified by said stored pipe width signal; and d. means for utilizing the count for locating such entry which has such predetermined number of events.

215. A means according to claim 214 comprising: a. means for utilizing at least one pair of successive event-time values from the delimiter vector signal for forming a signal representing at least one possible event-time value located within limits represented by said pair and hence within at least one entry of the data base; and b. the means for counting comprising means for utilizing the at least one possible event-time value signal to identify each such selected possible event-time value.

216. A means according to claim 215 wherein said means for interrogating and locating comprises means for locating a data base entry containing event-time values which represent events which may not exactly match the events of the request.

217. A means according to claim 216 comprising: a. means for forming a signal identifying an allowable degree of match between the events of the request entry and the events of a data base entry; and b. said means for utilizing the count for locating comprising means for locating a data base entry having said allowable degree of match.

218. A means according to claim 213 wherein said predetermined number of event-time values is specified by a pipe cutoff value and including means for providing an input to the data processing system for altering said pipe cutoff value.

219. A means according to claim 213 wherein said predetermined number of event-time values is computed and comprises: a. means for forming a pipe cutoff signal representing the predetermined number of event-time values as a fraction of the number of events in an entry of the request; b. means for forming a number of events signal for individual entries of the request, representing the number of events therein; and c. means for utilizing the values represented by said pipe cutoff signal and said number of events signal to form a signal representing the predetermined number of event-time values to be used in locating a data base entry.

220. A means according to claim 214 including means for providing an input to the data processing means for altering the value of said pipe width signal.

221. A means according to claim 213 wherein the means for locating a data base entry comprises: a. means for forming a signal representing a pipe cutoff value which represents the predetermined number of event-time values as a fraction of the number of events in an entry; b. means for counting the number of events, which are represented by event signals, within an entry of the request; c. means for computing a number value representing the product of said pipe cutoff value and the value represented by the count from the preceding step; d. means for utilizing at least one pair of successive event-time values from the delimiter vector signal for forming a signal representing at least one possible event-time value located within limits represented by said pair and hence within at least one entry of the data base; e. means for counting the number of events which are represented by event-time values within a selected entry of the data base as defined by said pair of successive event-time values and which fall within such preselected number of event positions of the same event in the request; and f. means for comparing the count, from the last named means for counting, with said number value and, upon a predetermined relation, forming a pass signal indicating that the corresponding entry is ascertained; said means for forming an entry identification signal comprising: a. means for counting the event-time values represented by the delimiter vector signal to form a count corresponding to each said data base entry; and b. means for utilizing said count for forming an entry signal representing the at least one entry responsive to such pass signal.

222. A data processing means for retrieving, from a memory system, a portion of a stored data base, the data base being represented by retrievable event-time signals which represent event-time values which in turn represent the order of occurrence of the corresponding events in the stored data base, the event-time signals representing the order of occurrence of events each of which make up a series of entries each containing at least one event, the processing means comprising: a. means for forming a request comprising a series of coded event signals representing the events of an entry; b. means for forming at least one signal identifying an allowable degree of match between the events of the request and the events of an entry in the data base; c. means for locating a data base entry containing event-time values which represent events which either exactly or inexactly match the events of the request and comprising 1. means for interrogating selected data base event-time values for locating at least one data base entry which has at least a predetermined number of event-time values representing events positioned within a preselected number of event positions relative to the same events in the request, 2. means for forming an intermediate entry identification signal identifying said at least one data base entry, 3. means for further interrogating, within the data base entry identified by said at least one intermediate entry identification signal to locate a data base entry which has at least a preselected degree of match, as to order and presence of events, with the entry of the request, and 4. means for forming an entry identification signal representing the last located data base entry; and d. means for generating coded event signals for output representing the events which, according to data base event-time values, are present in the entry of the data base which is identified by said entry identification signal, said event signals for output being arranged in order of occurrence as represented by event-time values in such entry.

223. A means according to claim 222 wherein said means for further interrogating may locate plural entries and wherein said means for forming an entry identification signal comprises means for forming an entry identification signal representing each of said plural entries.

224. A means according to claim 223 comprising means for computing a value for each said entry identification signal representing the actual degree of match as to order and presence of events between the corresponding data base entry and the entry of the request.

225. A means according to claim 224 comprising means for ordering the entry identification signals in order by the corresponding degree of match value.

226. A means according to claim 225 comprising means for storing the ordered entry identification signals in such order together each with a signal representing the degree of match value.

227. A means according to claim 225 wherein said means for generating comprises means for so generating coded signals for output representing each data base entry identified by each said entry identification signal and in sequence according to said ordering.

228. A means according to claim 222 wherein said means for generating comprises means for generating an event signal for each of a plurality of event-time values in an entry which contains a greater number of event-time values than there are events in the original request.

229. A data processing means for retrieving, from a memory system, data which is contained in a multiple layered data base, each layer representing an ordered sequence of entries and events in which one or more events represent each entry, in each layer some such events being the same and at least one being different, each layer comprising retrievable event-time signals which represent event-time values which in turn identify the order of occurrence of the corresponding events, said data base comprising at least first and second layers, each of a plurality of events in said second layer having a corresponding entry in said first layer, the processing means comprising: a. means for forming a request comprising plural entries, each entry being represented by at least one coded event signal, the entries and events being ordered in order of occurrence; b. means for interrogating the first data base layer and locating, for each of a plurality of the request entries, at least one first layer entry having event-time values which represent events bearing at least a predetermined degree of match to events represented by the corresponding request event; c. means for interrogating those second layer event-time values for events which correspond to the located first layer entries to locate at least one second layer entry containing event-time values which represent first layer entries having a predetermined degree of match with the request entries; d. means for generating a first layer entry identification signal representing each first layer entry which, according to second layer event-time values, are present in the located second layer entry; and e. means for generating a first layer event signal corresponding to each event-time value contained in each first layer entry which is identified by each said first layer entry identification signal.

230. A means according to claim 229 comprising: a. means for ordering the generated first layer event signals, within each entry, according to the corresponding first layer event-time values; and b. means for ordering entries which comprise said event signals according to the corresponding second layer event-time values.

231. A means according to claim 229 wherein said means for interrogating and locating a second layer event comprises means for locating a second layer entry containing second layer event-time values which represent first layer entries which either exactly or inexactly match the entries of the request.

232. A means according to claim 231 comprising: a. means for forming at least one of different valued signals representing different allowable degrees of match between the entries of the request and the first layer entries represented by second layer entries; and b. said means for interrogating and locating a second layer entry comprising means for locating a second layer entry having at least said allowable degree of match.

233. A means according to claim 229 wherein said means for interrogating and locating second layer event vector signals comprises means for locating a second layer entry which has at least a predetermined number of event-time values representing first layer entries (second layer events) positioned within a preselected number of entry positions relative to the corresponding entries in the request.

234. A means according to claim 233 wherein said predetermined number of entries is specified by a pipe cutoff value and including means for providing an input to the data processing system for selecting said pipe cutoff value.

235. A means according to claim 233 wherein said predetermined number of entries is computed and comprising: a. means for forming a pipe cutoff signal representing the predetermined number of entries as a fraction of the number of entries in the request; b. means for forming a number of entries signal for individual entries of the request, representing the number of entries therein; and c. means for utilizing the values represented by said pipe cutoff signal and said number of entries signal to form a signal representing the predetermined number of entries to be used.

236. A means according to claim 233 wherein said preselected number of entry positions is specified by a pipe width value and including means for providing an input to the data processing system for selecting said pipe width value.

237. A means according to claim 233 wherein said predetermined number of entries is computed, comprising: a. means for forming a signal representing a pipe cutoff value which represents the predetermined number of entries as a fraction of the number of entries in the request; b. means for counting the number of entries in the request; c. means for computing a number value representing the product of said pipe cutoff value and the value represented by the count from the preceding step; d. means for counting the number of first layer entries which are represented by second layer event-time values and which fall within such preselected number of entry positions of the same entry in the request, the second layer event-time values being those represented by the located first layer entries; and e. means for comparing the counts, from the last named means for counting, with said number value for a predetermined relation including that the corresponding second layer entry is a located one.

238. A means according to claim 237 wherein the second layer entry that is recited as being located is an intermediate second layer entry, and comprising means for further interrogating, within the located at least one intermediate second layer entry among the event-time values of the second layer event-time signals which correspond to the located first layer entry, to thereby locate a second layer entry which has at least a preselected degree of match, as to order and presence of first layer entries represented thereby, with the entries of the request, such located second layer entry being the one used in the step of generating a first layer entry identification signal.

239. A means according to claim 238 additionally comprising means for only locating those second layer entries which have at least a preselected degree of match, as to number of represented first layer entries, as well as order and presence of entries.

240. A means according to claim 238 additionally comprising: a. means for storing a signal indicating if relative number of entries between a request and the data base is to be accounted for; and b. means for responding to such a stored signal for enabling the step of interrogating and locating to comprise means for only locating a data base entry which has a least a preselected degree of match, as to number of represented first layer entries, as well as order and presence of entries.

241. A means according to claim 246 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

242. A means according to claim 238 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

243. A means according to claim 229 wherein said means for interrogating and locating comprises means for locating a second layer data base entry which has at least a preselected degree of match, as to order and presence of entries with the request.

244. A means according to claim 243 wherein the means for locating additionally comprises means for only locating those data base entries which have at least a preselected degree of match, as to number of events, as well as order and presence of events.

245. A means according to claim 243 additionally comprising: a. means for storing a signal indicating if relative number of entries between a request and the data base is to be accounted for; and b. means for responding to such a stored signal for enabling the means for interrogating and locating to comprise the means for only locating a data base entry which has at least a preselected degree of match, as to number of entries, as well as order and presence of entries.

246. A means according to claim 243 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

247. A means according to claim 241 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processing system for selecting said brightness value cutoff signal.

248. A means according to claim 229 comprising means for forming signals representing the boundaries of said second layer entries, and wherein the means for interrogating the second layer event-time signals comprises means for interrogating second layer event-time values representing occurrences of events which lie between the values represented by two successive ones of said boundary signals to thereby determine if the corresponding second layer entry has the predetermined degree of match.

249. A means according to claim 229 wherein the stored data base comprises at least event-time signal whose event-time values represent the order of occurrence of delimiter events, at least one delimiter event defining a boundary of each of said second layer entries, and wherein the means for forming an entry identification signal comprises: a. means for counting the event-time values of the delimiter event-time values to thereby indicate successive entries; and b. means for forming a signal corresponding to the count for the second layer entry which has such predetermined degree of match.

250. A means according to claim 233 wherein the stored data base comprises at least one event-time signal whose event-time values represent the order of occurrence of a delimiter event, at least one delimiter event defining a boundary of each of said entries, and wherein the means for generating comprises: a. means for locating a pair of successive event-time values in such at least one delimiter event-time signal identifying the bounds of the located second layer entry; and b. means for generating first layer entry identification signals only for second layer event-time values which lie between such pair of successive event-time values.

251. A means according to claim 250 wherein said means for locating a pair of successive event-time values comprises: a. means for counting successive event-time values of the at least one delimiter event-time signal until a count is reached having a predetermined relation to the located second layer entry; and b. means for utilizing the delimiter event-time value corresponding to such count as one of the pair of successive event-time values.

252. A means according to claim 229 comprising means for forming at least one further coded signal representing the order of occurrence of individual entries in the request, the means for interrogating including means for utilizing said further coded signal to locate the at least one second layer entry.

253. A means according to claim 252 wherein said means for forming at least one further coded signal comprises means for forming a coded bias signal corresponding to each of at least some of said entries of the request, the means for interrogating and locating at least one second layer entry comprising: a. means for combining the value represented by each said bias signal with a second layer event-time value to thereby form biased event-time values; b. means for storing a pipe width signal representing bounds of a permissible mismatch and hence the preselected number of entry positions; c. means for counting the number of biased signals representing values which fall within preselected bounds of each of selected possible second layerevent-time values said preselected bounds being identified by said stored pipe width signal; and d. the means for locating an entry including means for utilizing the count for locating such second layer entry which represents such predetermined number of first layer entries.

254. A means according to claim 253 comprising: a. means for forming a signal representing at least one possible second layer event-time value in at least one second layer entry of the data base; and b. the means for counting comprising the means for utilizing the at least one possible event-time value signal to identify each such selected possible event-time value.

255. A data processing method for allowing inexact data retrieval, from a memory system, the data being contained in a multiple layered data base, each layer representing an ordered sequence of entries and events in which one or more events represent each entry, in each layer some events being the same and at least one being different, each layer comprising a plurality of retrievable event-time signals which represent event-time values which in turn represent the order of occurrence of the corresponding events, said layers being ordered from at least one higher layer to at least one lower layer, each of a plurality of events in the higher layer having a corresponding entry in the lower layer, the method comprising the steps of: a. forming a request represented by parts, the parts including lower level entry parts which represent at least one higher level entry part, each lower level entry part having at least one event part which is represented by at least one coded event signal, in the request the lower level entry parts and event parts being ordered in order of occurrence, the at least one higher level entry part corresponding to entries in the higher layer, lower level entry parts corresponding to entries in the lower layer (and events in the higher layer) and event parts corresponding to events in the lower layer; b. forming at least one signal indicating at least one allowable degree of match between the request and the data base; c. interrogating the lower layer and locating, for each of a plurality of the lower level request entries, at least one entry in the lower layer having event-time values which represent events bearing at least said indicated degree of match to events represented by the corresponding lower request event; d. interrogating those event-time values in the higher level which correspond to the located lower layer entries to locate at least one entry in such higher layer containing event-time values which represent a combination of entries in the higher layer having at least said indicated degree of match with the combination of lower entries in the request; e. generating a lower layer entry identification signal representing each lower layer entry (higher layer event) which, according to higher layer event-time values, are present in the located higher layer entry; and f. generating a lower layer event signal corresponding to the event-time values contained in each lower layer entry which is identified by each said lower layer entry identification signal.

256. A method according to claim 255 comprising the steps of: a. ordering the generated lower layer event signals, within each entry of the lower layer, according to the lower layer event-time values; and b. ordering groupings of the generated lower layer event signals, according to the event-time values of the located higher level entry, to make up entries.

257. A method according to claim 256 wherein at least one of said steps of interrogating and locating on at least one of the layers comprises the step of locating an entry in such layer which has at least a predetermined number of event-time values representing events in that layer positioned within a preselected number of positions relative to the corresponding parts of the request.

258. A data processing method according to claim 257 wherein said predetermined number is specified by a pipe cutoff value and including the step of providing an input to the data processing system for selecting said pipe cutoff value.

259. A method according to claim 257 wherein said predetermined number is computed and comprising the steps of: a. forming a pipe cutoff signal representing the predetermined number as a function of the length of a portion of the request; b. forming a number signal for a portion of the request, representing the length thereof; and c. utilizing the values represented by said pipe cutoff signal and said number signal to form a signal representing the predetermined number.

260. A method according to claim 257 wherein at least one of said steps of interrogating locates an intermediate entry, and further comprises the step of: further interrogating, within the located intermediate entry among the event-time values thereof, to thereby locate a final entry on such layer which has at least a preselected degree of match, as to order and pesence of entries represented thereby, with the corresponding parts of the request.

261. A method according to claim 260 additionally comprising the steps of only locating a final entry which has at least a preselected degree of match, as to number of events in the corresponding layer, as well as order and presence thereof.

262. A method according to claim 260 wherein said preselected degree of match is specified by a brightness value cutoff signal and including the step of providing an input to the data processing system for selecting said brightness value cutoff signal.

263. A method according to claim 255 wherein the stored data base comprises at least one event-time signal for each layer, the event-time values of which represent the order of occurrence of a delimiter event, at least one delimiter event defining a boundary of each of the entries for such layer, and wherein the steps of interrogating on each layer comprise the step of interrogating layer event-time values having values between the values represented by two successive ones of the respective delimiter event-time values to thereby determine if the corresponding layer entry has the predetermined degree of match.

264. A method according to claim 255 wherein the stored data base comprises at least one event-time signal for each layer, the event-time values of which represent the order of occurrence of a delimiter event, at least one delimiter event defining a boundary of each entry in the corresponding layer, and wherein the step of generating on at least one layer comprises the steps of: a. locating at least one pair of successive event-time values in such at least one delimiter event-time signal for the corresponding layer identifying the bounds of the entry which has been located for the corresponding step of generating; and b. generating the identification signal only for layer event-time values in the corresponding layer which lie between the located pair of successive event-time values.

265. A data processor for performing inexact data retrieval, from a memory system, the data being contained in a multiple layered data base, each layer representing an ordered sequence of entries and events in which one or more events represent each entry, in each layer some events being the same at least one being different, each layer comprising a plurality of retrievable event-time signals which represent event-time values which in turn represent the order of occurrence of the corresponding events, said layers being ordered from at least one higher layer to at least one lower layer, each of a plurality of events in the higher layer having a corresponding entry in the lower layer, the processor comprising: a. means for forming a request represented by parts, the parts including lower level entry parts which represent at least one higher level entry part, each lower level entry part having at least one event part which is represented by at least one coded event signal, in the request the lower level entry parts and event parts being ordered in order of occurrence, the at least one higher level entry part corresponding to entries in the higher layer, lower level entry parts corresponding to entries in the lower layer (and events in the higher layer), and event parts corresponding to events in the lower layer; b. means for forming at least one signal indicating at least one allowable degree of match between the request and the data base; c. means for interrogating the lower layer and locating, for each of a plurality of the lower level request entries, at least one entry in the lower layer having event-time values which represent events bearing at least said indicated degree of match to events represented by the corresponding lower request event; d. means for interrogating those event-time values in the higher level which correspond to the located lower layer entries to locate at least one entry in such higher layer contaning event-time values which represent a combination of entries in the higher layer having at least said indicated degree of match with the combination of lower entries in the request; e. means for generating a lower layer entry identification signal representing each lower layer entry (higher layer event) which, according to higher layer event-time values, are present in the located higher layer entry; and f. means for generating a lower layer event signal corresponding to the event-time values contained in each lower layer entry which is identified by each said lower layer entry identification signal.

266. A processor according to claim 265 comprising: a. means for ordering the generated lower layer event signals, within each entry of the lower layer, according to the lower layer event-time values; and b. means for ordering groupings of the generated lower layer event signals, according to the event-time values of the located higher level entry, to make up entries.

267. A processor according to claim 266 wherein at least one of said means for interrogating and locating on at least one of the layers comprises: means for locating an entry in such layer which has at least a predetermined number of event-time values representing events in that layer positioned within a preselected number of positions relative to the corresponding parts of the request.

268. A processor according to claim 267 wherein said predetermined number is specified by a pipe cutoff value and including means for providing an input to the data processor for selecting said pipe cutoff value.

269. A processor according to claim 267 wherein said predetermined number is computed and comprising: a. means for forming a pipe cutoff signal representing the predetermined number as a function of the length of a portion of the request; b. means for forming a number signal for a portion of the request, representing the length thereof; and c. means for utilizing the values represented by said pipe cutoff signal and said number signal to form a signal representing the predetermined number.

270. A processor according to claim 267 wherein at least one of said means for interrogating locates an intermediate entry, and further comprises: means for further interrogating, within the located intermediate entry among the event-time values thereof, to thereby locate a final entry on such layer which has at least a preselected degree of match, as to order and presence of entries represented thereby, with the corresponding parts of the request.

271. A processor according to claim 270 additionally comprising means for only locating a final entry which has at least a preselected degree of match, as to number of events in the corresponding layer, as well as order and presence thereof.

272. A processor according to claim 270 wherein said preselected degree of match is specified by a brightness value cutoff signal and including means for providing an input to the data processor for selecting said brightness value cutoff signal.

273. A processor according to claim 265 wherein the stored data base comprises at least one event-time signal for each layer, the event values of which represent the order of occurrence of a delimiter event, at least one delimiter event defining a boundary of each of the entries for such layer, and wherein both of the means for interrogating the layers comprise the means for interrogating layer event-time values having values between the values represented by two successive ones of the respective delimiter event-time values to thereby determine if the corresponding layer entry has the predetermined degree of match.

274. A processor according to claim 265 wherein the stored data base comprises at least one event-time signal for each layer, the event-time values of which represent the order of occurrence of a delimiter event, at least one delimiter event defining a boundary of each entry in the corresponding layer, and wherein the means for generating on at least one layer comprises: a. means for locating at least one pair of successive event-time values in such at least one delimiter event-time signal for the corresponding layer identifying the bounds of the entry which has been located by one of the means for generating; and b. means for generating the identification signal only for layer event-time values in the corresponding layer which lie between the located pair of successive event-time values.

275. Electronic data processing coded signal converting means comprising: a. means for storing at least the combination of given line value signal and given line number signal which represent a given value; b. means for forming a total number of lines value signal; c. means for converting such combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, comprising: 1. means for responding to each different value represented by a provided number of lines signal for causing the converting means to form a different predetermined one of the equivalent line signals within the set which corresponds to the combination of given line signal and given line number signal; and 2. means for forming the equivalent number value signal corresponding to the formed equivalent line signal; and d. means for converting the total number of lines value signal to one or more values representing incremental movements which may be made by said converting means and for providing a corresponding number of line value signal to the converting means.

276. Electronic data processing coded signal converting means comprising: a. means for storing at least the combination of given line value signal and given line number signal which represent a given value; b. means for forming a number of lines value signal; and c. means for converting such combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signa in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, comprising means for responding to each different value represented by the number of lines signal for causing the converting means to form a different predetermined one of the equivalent combination of line signal and line number signal within the set which corresponds to the combination of given line signal and given line number signal.

277. Means according to claim 276 wherein said means for converting comprises means for causing those relatively shifted occurrence values which are not within the group of possible occurrence values to be eliminated from the equivalent line value signal which is formed.

278. Means according to claim 276 wherein said means for forming numbers of lines value signal comprises means for only forming signals representing a component power of two.

279. Means according to claim 276 wherein said means for forming a number of lines value signal comprises means for forming one or a series of numbers of lines signals identifying increments by which a combination of given line value signal and given line number signal is to be advanced through one or more equivalent combinations in the corresponding equivalent set thereof.

280. Means according to claim 279 comprising means for enabling the converting means to use an equivalent line value signal formed by said converting means for a number of lines signal in series as the given line value signal for the next number of lines signal in such series.

281. Means according to claim 279 comprising: a. means for receiving a signal identifying a total number of lines signal; and b. said means for forming one or a series of number of lines signals comprising means for converting said total number of lines signal into signals representing its component powers of two.

282. Means according to claim 281 wherein said means for converting said total number of lines signals comprises means for converting said total number of lines signal into signals representing its component powers fo two in order from the largest value to the smallest value.

283. Means according to claim 276 wherein the converting means comprises: a. means for forming a shifted line value signal containing actual occurrence values which represent the given line value signal shifted by the number of actual occurrence values represented by the number of lines value signal; and b. means for exclusive ORing the actual occurrence values represnted by the given line value signal and the shifted line value signal to thereby form the equivalent line value signal.

284. Means according to claim 283 wherein said exclusive ORing means comprises means for ordering the actual occurrence values of the shifted and unshifted line value signals into monotonically ordered values and means for forming in said equivalent line value signal only those shifted and unshifted values which are not equal.

285. Means according to claim 284 wherein said means for ordering comprises: a. means for comparing the shifted and unshifted values; and b. means for forming signals in the equivalent line value signal representing only those actual occurrence values which are not equal.

286. Means according to claim 283 comprising means for causing shifted actual occurrence values which are not among said possible occurrence values to be excluded from the resultant equivalent line value signal.

287. Means according to claim 283 wherein said means for forming a shifted line value signal comprises: a. means for forming for individual actual occurrence values of the given line value signal an actual occurrence value signal; and b. means for combining the values represented by the number of line value signal and individual actual occurrence value signals to form shifted occurrence value signals making up such shifted line value signal.

288. Means according to claim 276 comprising means for utilizing the values represented by said number of linesvalue signal and said given line number signal to form the equivalent line number signal.

289. Means according to claim 288 wherein the utilizing means comprises means for combining the values represented by the number of lines value signal and the given line number signal.

290. Electronic data processing coded signal converting means comprising: a. storage means for storing at least the combination of given line value signal and given line number signal which represent a given value; b. means for forming a number of lines value signal; c. means for converting such combination of given line signal and given line number signal representing each different given value to any combination of equivalent line signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, comprising: 1. means for responding to each different value represented by the number of lines signal for causing the converting means to form a different predetermined one of the equivalent combination of line signal and line number signal within the set which corresponds to the combination of given line signal and given line number signal; d. at least one decoder means for converting the line number signal in the storage means from a first compact code to a second expanded code for use by the converting means; e. encoder means for converting the equivalent line value signal formed by the converting means from an expanded code as provided by the converting means back to the first compact code; and f. means for storing the equivalent line value signal in such first code.

291. Means according to claim 290 wherein said means for converting comprises: means for causing those relatively shifted occurrence values which are not within the group of possible occurrence values to be eliminated from the equivalent line value signal which is formed.

292. Means according to claim 290 wherein said means for forming numbers of lines value signal comprises: means for only forming signals representing a component power of two.

293. Means according to claim 290 wherein said means for forming a number of lines value signal comprises: means for forming one or a series of numbers of lines signals identifying increments by which a combination of given line value signals and given line number signal is to be advanced through one or more equivalent combinations in the corresponding equivalent set thereof.

294. Means according to claim 279 comprising means for enabling the converting means to use an equivalent line value signal formed by said converting means for a number of lines signal in such series as the given line value signal for the next number of lines signal in such series.

295. Means according to claim 193 comprising: a. means for receiving a signal identifying a total number of lines signal; and b. said means for forming one or a series of number of lines signals comprising means for converting said total number of lines signal into signals representing its component powers of two.

296. Means according to claim 295 wherein said means for converting said total number of lines signals comprises means for converting said total number of lines signal into signals representing its component powers of two in order from the largest value to the smallest value.

297. Electronic data processing coded signal converting means comprising: a. means for storing at least the combination of given line value signal and given line number signal which represent a given value; b. means for storing a total number of lines value signal; c. first decoder means for decoding the line value signal in the storage means from a first compact code to a second expanded code having an individual coded signal for any individual actual occurence value represented in the given line value signal; d. second decoder means for decoding the line value signal in the storage means form a first compact code to a second expanded code having an individual coded signal for any individual actual occurrence value represented in the given line value signal; e. means for converting the combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, and comprising, 1. means for combining values represented by the actual occurrence values in the decoded line value signal and provided number of lines value signal for forming a shifted line value signal, 2. means for exclusive ORing the values represented by the actual occurrence values from the combining means and the first decoder means, and 3. means for forming an equivalent line value signal representing the results of the exclusive ORing which only representss actual occurrence values included in said possible set thereof; and f. means for converting the total number of lines value signal into a value representing the component power of two thereof and providing corresponding number of lines value signals to the combining means; g. encoder means for converting the equivalentline value signal from an expanded code back to the first compact code; and h. means for storing the converted equivalent line value signal in such first code.

298. Means according to claim 297 comprising means for utilizing the values represented by said number of lines value signal and said given line number signal to form the equivalent line number signal.

299. Means according to claim 298 wherein the utilizing means comprises means for combining the values represented by the number of lines value signal and the given line number signal.

300. An electronic data processing coded signal converting means comprising: a. means for storing a given line value signal to be compacted; b. means for storing a given line number signal, the given line value and line number signals representing a given value; c. means for forming a plurality of incremental number of lines value signals; d. means for converting such combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted; e. means for responding to each different value represented by the incremental number of lines value signals for causing the converting means to form a different predetermined one of the equivalent line signal within the set which corresponds to the combination of given signals; f. means for forming such equivalent line number signal which corresponds to the formed equivalent line value signal; and g. means for enabling the converting means to utilize an equivalent line signal formed for one incremental number of lines value signal as the given line value signal for the next incremental number of lines value signal.

301. Means according to claim 300 for fast converting operations wherein the means for forming incremental number of lines value signals comprises: a. means for determining the larger of the difference between the values of the largest two actual occurrence value signals in the given line and of the difference between the values of the largest possible occurrence value and the largestactual occurrence value in the given line value; and b. means for forming at least one of such incremental number of lines value signals representative of such largest difference.

302. Means according to claim 301 wherein said means for forming at least one such incremental number of lines value signal comprises means for forming a signal representing each of the component powers of two of the largest difference.

303. An electronic data processing compactor for coded signals comprising: a. means for storing a given line value signal to be compacted; b. means for storing a given line number signal, the given line value and line number signals representing a given value; c. means for forming a plurality of incremental number of lines value signals; d. means for converting such combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at lest one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted; e. means for responding to each different value represented by the incremental number of lines value signals for causing the converting means to form a different predetermined one of the equivalent line signal within the set which corresponds to the combination of given signals; f. means for forming such equivalent line number signal which corresponds to the formed equivalent line value signal; g. means for enabling the converting means to utilize an equivalent line signal formed for one incremental number of lines value signal as the given line value signal for the next incremental number of lines value signal; h. means for interrogating the formed equivalent line value signals for one of selected length; and i. means responsive to the interrogating means for selectively storing a signal indicative of a formed equivalent line value signal having such selected length and of the corresponding equivalent line number signal.

304. A compactor according to claim 303 wherein said means for interrogating comprises: a. means for determining the length of each of plural formed equivalent line value signals and for forming a corresponding length signal for each; and b,. means for comparing the values represented by the length signals for the one which represents the shortest length.

305. A compactor according to claim 304 wherein said interrogating means comprises: a. first means for storing a signal identifying the line value signal which is the current shortest one formed from the various incremental number of lines value signals; b. second means for storing a current shortest length value signal; c. the means for comparing comprising means for comparing the values represented by the stored current shortest length value and each newly formed length signal; d. means for storing a signal in the first storing means identifying a line value signal which is compared and found to be shorter than the current one; and e. means for storing a signal in the second storing means representing the shortest length signal which is compared and found to represent the shortest length.

306. A compactor according to claim 305 wherein said means for storing a signal identifying a shortest line value signal comprises means for storing a signal representing at least the line number.

307. A compactor according to claim 306 wherein said means for storing a signal identifying a shortest line value signal additionally comprises means for storing a signal representing the line value.

308. A compactor according to claim 303 wherein a fast compacting operation is provided wherein the means for forming incremental number of lines value signals comprises: a. means for determining the larger of the difference between the values of the largest two actual occurrence value signals in the given line and of the difference between the values of the largest possible occurrence value and the largest actual occurrence value in the given line value; and b. means for forming at least one of such incremental number of lines value signals representative of such largest difference.

309. Means according to claim 308 wherein said means for forming at least one such incremental number of lines value signal comprises means for forming a signal representing each of the component powers of two of the largest difference.

310. An electronic data processing compactor for coded signals comprising: a. means for storing a given line value signal to be compacted; b. means for storing a given line number signal, the given line value and line number signals representing a given value; c. means for forming a plurality of incremental number of lines value signals; d. means for converting such combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitallly coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted; e. means for responding to each different value represented by the incremental number of lines value signals for causing the converting means to form a different predetermined one of the equivalent line signal within the set which corresponds to the combination of given signals; f. means for forming such equivalent line number signal which corresponds to the formed equivalent line value signal; g. means for enabling the converting means to utilize an equivalent line signal formed for one incremental number of lines value signal in place of the given line value signal for the next incremental number of lines value signal; h. means for providing the signals for use by the converting means corresponding to the stored given line value signal and comprising means for decoding the stored signals from a first compact code to a second expanded code for use by the converting means; i. means for encoding the equivalent line value signal, resulting from an individual incremental number of lines value signal, from such expanded code back to the compacted code; j. means for interrogating the length of the encoded equivalent line value signals for one of selected length; and k. means responsive to the interrogating means for selectively storing a signal indicative of an encoded equivalent line value signal having such selected length and of the corresponding equivalent line number signal.

311. A compactor according to claim 310 wherein said compacted code is in a hybrid coded signal form, the hybrid signal form comprising a series of binary coded words including at least one absolute coded word and at least one bit word, the bit word representing an occurrence value by the number of binary bits of displacement of a binary bit of predetermined value from an absolute word in the series of words, such words comprising a flag signal for indicating if the corresponding word is an absolute or bit word type, said decoding means comprising: a. means for detecting the absolute and bit word flag signal of the words in the givenline value signal; b. absolute word outputting means comprising means responsive to the detection of an absolute word flag signal in a word for outputting an actual occurrence value signal represented by such word; and c. absolute word forming an outputting means comprising 1. means responsive to the detection of a bit word flag signal in a word for responding to each said binary bit of predetermined value in such bit word and to a previous absolute word for forming an actual occurrence value signal representative of the actual value of said bits of predetermined value, and 2. means for outputting each said formed actual occurrence value signal.

312. A compactor according to claim 311 wherein said encoding means receives the actual occurrence values of the equivalent line value signal in series and comprising: a. means responsive to a previously and a currently received intermediate actual occurrence value signal for forming a first difference signal indicative of the difference in value therebetween; b. means for indicating absolute or bit string form of hybrid output comprising 1. means for forming a signal representing a preselected minimum difference between a previously and a currently received intermediate absolute coded signal, and 2. means for comparing the values of the minimum difference signal and the first difference signal and for forming a signal indicating if the first value is greater than or is less than or equal to the latter value; c. means for providing absolute form outputs comprising 1. means operative in response to said less than or equal to signal indication for outputting a word signal representing the currently received actual occurrence value signal and an absolute flag signal; and d. means for providing bit string form outputs comprising 1. means responsive to said greater than signal indication for forming a bit string word signal comprising a binary bit of one value associated with the number of binary bits of a second value corresponding to the value of said first difference signal, and 2. means for selectively outputting said bit string word signal in association with a bit string flag signal and in a predetermined relation to an outputted absolute form word signal.

313. A compactor according to claim 312 wherein said means for interrogating length comprises a means for counting the outputted words.

314. Electronic data processing coded signal outputting means comprising: a. means for storing at least the combination of given line value signal and given line number signal which represent a given value; b. means for converting such combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted and comprising means for responding to each different value represented by a provided number of lines signal for causing the converting means to form a different predetermined one of the equivalent combination of line signal and line number signal within the set which corresponds to the combination of given line signal and given line number signal; c. means for forming a signal having a value representing the number of such possible occurrence values; d. means for determining a value related to the values of said number of possible occurrence value signals and the given line number signal; and e. means for forming and providing such number of lines value signal representing said determined value.

315. Means according to claim 314 wherein the means for determining comprises: means for determining a value representing the difference in value represented by said number of possible occurrence values signal and said given line number signal.

316. Means according to claim 315 wherein said means for converting comprises means for causing those relatively shifted occurrence values which are not within the group of possible occurrence values to be eliminated from the equivalent line value signal which is formed.

317. Means according to claim 316 wherein said means for forming number of lines value signal comprises means for forming signals representing the component powers of two of said difference and the outputting means comprising means for enabling the equivalent line value signal formed for one component power of two signal to be used by the converting means with another component power of two signal.

318. Means according to claim 316 wherein said means for forming a number of lines value signal comprises means for forming one or a series of number of lines signals identifying increments by which a combination of given line value signal and given line number signal is to be advanced through one or more equivalent combinations in the corresponding equivalent set thereof.

319. Electronic data processing coded signal changing means comprising: a. means for storing at least the combination of given line value signal and given line number signal which represent a given value; b. means for forming a signal representing at least one change occurrence value; c. means for forming a number of lines value signal; d. means for converting such combination of given line value signal and given line number signal representing each different given value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, comprising means for responding to each different value represented by the number of lines signal for causing the converting means to form a different predetermined one of the equivalent combination of line signal and line number signal within the set which corresponds to the combination of given line signal and given line number signal; and e. means for exclusive ORing the values represented by the equivalent line value signal and the change signal for forming a changed line value signal.

320. Changing means according to claim 319 wherein said means for forming a number of lines signal comprises: means for utilizing the given line number signal for forming the number of lines value signal.

321. Changing means according to claim 320 wherein said means for forming a number of lines value signal comprises means for forming at least one signal representative of the difference between the values represented by the given line number signal and the change line number signal.

322. Means according to claim 321 wherein said means for forming at least one signal representative of the difference comprises means for forming one or a series of number of lines value signals identifying increments by which a combination of change line value signal and change line number signal is to be advanced through one or more equivalent combinations in the corresponding equivalent set thereof.

323. Means according to claim 322 wherein said means for forming number of lines signals representing increments comprises means for only forming signals representing a component power of two representative of such difference.

324. Electronic data processing method for checking for the presence of an actual occurrence value represented by a given line value which forms one of a set of unique line values, each line value in the set being represented by at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value being related to another by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, each line value being assigned a unique line number, the actual occurrence value to be checked being in a line value of the set thereof other than the given line value, comprising the steps of: a. forming a signal representing a given line; b. forming a signal representing the line number of the given line signal; c. utilizing the value represented by the given line number signal for forming a signal representing the number of lines of displacement between the given line and a desired line value of the set of line values; d. forming a test signal representing a desired possible occurrence value to be checked for presence in desired line value; e. combining the values represented by the test signal and number of lines signal to form a further test signal identifying a further possible occurrence value for test; f. comparing values represented by the test signal and the given line signal for a predetermined relation; g. comparing values represented by the further test signal and the given line signal for a predetermined relation; and h. responding to the results of both comparing steps for forming a predetermined signal indicating presence of an actual occurrence value, in the desired line value, equal in value to that represented by the test signal.

325. A method according to claim 324 wherein the step of forming the predetermined signal comprises the step of forming such a signal responsive to the detection of equality by one and inequality by the other of said comparing steps.

326. Electronic data processing method for checking for the presence of an actual occurrence value represented by a given line value which forms one of a set of unique line values, each line value in the set being represented by at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value being related to another by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, each line value being assigned a unique line number, the actual occurrence value to be checked being in a line value of the set thereof other than the given line value, comprising the steps of: a. forming a signal representing a given line; b. forming a signal representing the line number of the given line signal; c. utilizing the value represented by the given line number signal for forming a signal representing the number of lines of displacement between the given line and a desired line value of the set of line values; d. forming a test signal representing at least one possible occurrence value, a different test signal being formed for each different displacement; e. effecting an alignment between the occurrence values represented by the test signal and the given line value signal; f. comparing the aligned occurrence values represented by the test signal and the given line signal for values which are the same; and g. forming a first signal for an even number of signals which are the same and for forming a second signal for an odd number.

327. Electronic data processing method for checking for the presence of an actual occurrence value contained in a desired different form of a given value comprising: a. forming a given line value signal; b. forming a line number signal corresponding to the given line value signal; c. converting the combination of given line value and line number signals representing each different value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, and comprising the step of responding to each different value represented by a provided number of lines signal for causing the step of converting to form a different predetermined one of the combination of equivalent signals within the set which corresponds to the given signals; d. forming a length signal; e. forming a difference signal related to the difference in values represented by the given line value and line number signals; f. forming a first signal representing a largest component power of two and a second signal representing at least a second signal representing at least one remaining component power of two, the component powers of two representing the difference signal; g. providing a number of lines signal for the step of converting representing said remaining component powers of two to thereby cause a corresponding combination of equivalent signals to be formed; h. forming a test signal representing the value of an actual occurrence value which is to be checked in a desired one of the equivalent line signals of the equivalent set thereof; i. combining the values represented by the test signal and length signal to form a further test signal identifying a further occurrence value for test; j. comparing the values represented by the test signal and formed equivalent line value signal for a predetermined relation; k. comparing the values represented by the further test signal and the formed equivalent line value signal for a predetermined relation; and l. forming a signal indicating the presence of the actual occurrence value, in the desired equivalent line signal, equal in value to that represented by the test signal and in response to the results of both steps of comparing.

328. A method according to claim 327 wherein the step of providing a length signal comprising the step of providing a signal having a value at least equal in value to the largest possible occurrence value in the set thereof.

329. Electronic data processing signal changing method comprising the steps of: a. storing at least the combination of given line value signal and given line number signal which represent a given value; b. forming a change line value signal and a change line number signal representing at least one change occurrence value; c. forming a number of lines value signal; d. converting such combination of change line value signal and change line number signal to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the change signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, comprising the step of responding to each different value represented by the number of lines value signal for causing the step of converting to form a different predetermined one of the equivalent combination of line value signal and line number signal within the set which corresponds to the combination of change line signal and change line number signal; and e. exclusive ORing the values represented by the equivalent line value signal and the given line value signal for forming a changed line value.

330. A method according to claim 329 wherein said step of forming a number of lines comprises the step of utilizing the given line number signal for forming the number of lines value signal.

331. A method according to claim 330 wherein the step of forming a number of lines value signal comprises the step of forming at least one signal representative of the difference between the value represented by the given line number signal and the change line number signal.

332. A method according to claim 331 wherein the step of forming at least one signal representative of the difference comprises the step of forming one or a series of number of lines value signals identifying increments by which a combination of change line value signal and change line number signal is to be advanced through one or more equivalent combinations in the corresponding equivalent set thereof.

333. A method according to claim 332 wherein the step of forming number of lines signals representing increments comprises the step of only forming signals representing a component power of two representative of such difference.

334. Electronic data processing means for checking for the presence of an actual occurrence value represented by a given line value which forms one of a set of unique line values, each line value in the set being represented by at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value being related to another by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, each line value being assigned a unique line number, the actual occurrence value to be checked being in a line value of the set thereof other than the given line value, the processing means comprising: a. means for forming a signal representing a given line; b. means for forming a signal representing the line number of the given line signal; c. means for utilizing the value represented by the given line number signal for forming a signal representing the number of lines of displacement between the given line and a desired line value of the set of line values; d. means for forming a test signal representing a desired possible occurrence value to be checked for presence in desired line value; e. means for combining the values represented by the test signal and number of lines signal to form a further test signal identifying a further possible occurrence value for test; f. means for comparing values represented by the test signal and the given line signal for a predetermined relation; g. means for comparing values represented by the further test signal and the given line signal for a predetermined relation; and h. means for responding to the results of both comparing steps for forming a predetermined signal indicating presence of an actual occurrence value, in the desired line value, equal in value to that represented by the test signal.

335. Processing means according to claim 334 wherein the means for forming the predetermined signal comprises means for forming such a signal responsive to the detection of equality by one and inequality by the other of said means for comparing.

336. Electronic data processing means for checking for the presence of an actual occurrence value represented by a given line value which forms one of a set of unique line values, each line value in the set being represented by at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value being related to another by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, each line value being assigned a unique line number, the actual occurrence value to be checked being in a line value of the set thereof. other than the given line value, the processing means comprising: a. means for forming a signal representing a given line; b. means for forming a signal representing the line number of the given line signal; c. means for utilizing the value represented by the given line number signal for forming a signal representing the number of lines of displacement between the given line and a desired line value of the set of line values; d. means for forming a test signal representing at least one possible occurrence value, a different test signal being formed for each different displacement; e. means for effecting an alignment between the occurrence values represented by the test signal and the given line value signal; f. means for comparing the aligned occurrence values represented by the test signal and the given line signal for values which are the same; and g. means for forming a first signal for an even number of signals which are the same and for forming a second signal for an odd number.

337. Electronic data processing means for checking for the presence of an actual occurrence value contained in a desired different form of a given value comprising: a. means for forming a given line value signal; b. means for forming a line number signal corresponding to the given line value signal; c. means for converting the combination of given line value and line number signals representing each different value to any combination of equivalent line value signal and line number signal in a unique set thereof which includes the given signals, each line value signal representing at least one digitally coded actual occurrence value out of a set of monotonically ordered possible occurrence values, each line value signal being related to another in the same set by an exclusive OR of the actual occurrence values thereof and the actual occurrence values thereof relatively shifted, and comprising means for responding to each different value represented by a provided number of lines signal for causing the step of converting to form a different predetermined one of the combination of equivalent signals within the set which corresponds to the given signals; d. means for forming a length signal; e. means for forming a difference signal related to the differences in values represented by the given line value and line number signals; f. means for forming a first signal representing a largest component power of two and a second signal representing at least a second signal representing at least one remaining component power of two, the component powers of two representing the difference signal; g. means for providing a number of lines signal for the step of converting representing said remaining component powers of two to thereby cause a corresponding combination of equivalent signals to be formed; h. means for forming a test signal representing the value of an actual occurrence value which is to be checked in a desired one of the equivalent line signals of the equivalent set thereof; i. means for combining the values represented by the test signal and length signal to form a further test signal identifying a further occurrence value for test; j. means for comparing the values represented by the test signal and formed equivalent line value signal for a predetermined relation; k. means for comparing the values represented by the further test signal and the formed equivalent line value signal for a predetermined relation; and l. means for forming a signal indicating the presence of the actual occurrence value, in the desired equivalent line signal, equal in value to that represented by the test signal and in response to the results of both comparing means.

338. An electronic data processing revolver for revolving a binary coded input line signal to a new line signal in the same iso-entropicgram, comprising: a. means for storing an input line signal, the input line signal comprising a binary coded signal representing one or more actual occurrence values from a group of decreasing ordered possible occurrence values; b. means for serially providing individual actual occurrence value signals, comprising 1. first means responsive to the stored input line signal and to a first request signal for providing an actual occurrence value signal representing one of the actual occurrence values in the stored input line signal, said first means providing an actual occurrence value signal representing each said value of the input line signal in decreasing value order responsive to one of said first request signals for each such value; 2. second means responsive to the same stored input line signal and a second request signal for providing an actual occurrence value signal representing one of the actual occurence values in the stored input line signal, said second means providing an actual occurrence value signal representing each said value of the input line signal in decreasing value order responsive to one of said second request signals for each such value; c. means for providing a signal indicating a number of lines to be revolved; d. means for storing a new line; e. new line forming means comprising 1. shift means comprising means for combining values corresponding to the indicated number of line signal and the actual occurrence value signal provided by the first means and for each of the latter forming a corresponding shifted occurrence value signal, 2. first and second register means for storing, respectively, a shifted occurrence signal and an occurrence value signal provided by the second means, 3. means for selecting and storing in said new line storing means either the content of said first or second register means, 4. means for comparing the content of said first and second register means for indicating the relative values thereof, 5. enabling means comprising a. means responsive to an indication that the shifted signal in the first register means is the larger and comprising 1. means for providing said first request signal, and 2. means for enabling said selecting and storing means to select said shifted occurrence signal in the first register means for storage, b. means responsive to an indication that the unshifted occurrence signal in the second register means is the larger and comprising 1. means for providing said second request signal, and 2. means for enabling said selecting and storing means to select said unshifted occurrence signal in the second register means for the storage, and c. means responsive to an indication of equality in comparing for providing both said first and second request signals.

339. The revolver of claim 338 wherein said means for indicating the number of lines to be revolved comprises means for receiving a signal representing the total number of lines to be revolved and means for converting the value represented thereby into its component powers of two.

340. A revolver according to claim 339 comprising means for providing a first one of said component power of two signals and the stored input line signal to the first and second means to enable a response thereto and means for subsequently providing a second one of said component power of two signals and the stored new line signal, caused by the first component power of two signal, to the first and second means to enable a response thereto.

341. A revolver according to claim 338 wherein said input line is in a first code and the individual occurrence value signals are in a second code, and said first and second means comprise at least one code converter for converting the occurrence values in the input line signal represented by the first code to the individual actual occurrence value signals in the second code.

342. A revolver according to claim 341 wherein each of the first and second means comprises a code converter.

343. A revolver according to claim 342 wherein the means for providing a signal representing the number of lines to be revolved comprises means for providing such signals in the same code as said individual actual occurrence signals.

344. A revolver according to claim 338 comprising means for eliminating those shifted occurrence value signals which are outside of said group of possible occurrence values.

345. An encoder for converting to hybrid form a received series of absolute words in a decreasing value order comprising: a. means responsive to received previous and current absolute words for forming an output signal indicative of the difference therebetween; b. means for indicating absolute or bit string form of hybrid output comprising 1. means for indicating a preselected minimum difference between successively received absolute words for absolute form of output, 2. means for comparing the minimum difference indication and the previous and current difference signal and for indicating the value of the first being greater than, or less than equal to the latter; c. means for providing absolute form outputs comprising 1. means operative in response to said less than or equal to indication for outputting the stored current absolute word and an absolute flag; and d. means for providing bit string form outputs comprising 1. means responsive to said greater than indication for forming a set of ordered signals comprising a binary bit of one value separated by the number of binary bits of a second value corresponding to the value of said previous and current difference signal, and 2. means for selectively outputting said set of signals in association with a bit string flag and in a predetermined relation to an outputted absolute word.

346. An encoder for converting to hybrid form a received series of absolute coded words in decreasing value order, comprising: a. a current register for storing a currently received absolute word; b. means for storing a received absolute word in said current register; c. a previous register for storing a word received prior to the word in said current register; d. means for transferring a word from said current register to said previous register; e. means responsive to the stored previous and current absolute word for forming an output signal indicative of the difference therebetween; f. means for retaining the previous and current difference signal; g. means for indicating absolute or bit string form of hybrid output comprising 1. means for indicating a preselected minimum difference between received absolute words for absolute form of output, 2. means for comparing the minimum difference indication and the retained previous and current difference signal and for indicating the first being greater than, or less than or equal to, the latter; h. means for providing absolute form outputs comprising 1. means responsive to said greater than indication for outputting a signal representing the stored current absolute word and an absolute flag; and i. means for providing bit string form outputs comprising 1. means responsive to said less than or equal to indication for forming a set of ordered signals comprising a binary bit of one value separated by the number of binary bits of a second value corresponding to the value of said retained previous and current difference signal, and 2. means for selectively outputting a signal representing said set of ordered signals in association with a bit string flat and in a predetermined relation to an outputted absolute word.

347. The encoder of claim 335 wherein the hybrid form comprises a series of words and said means for forming a set of ordered signals comprises: a. counter means; b. a bit string word forming register; c. means operative in response to said indication for enabling said counter means to count through a sequence of states corresponding in number to the retained current and previous difference signal; d. means for indicating completion of the last mentioned counting; e. means for shifting the content of said bit string forming register one bit position in the direction of the least significant bit thereof for each said last mentioned counter means states; and f. means responsive to the last mentioned completion signal for inserting a bit signal of predetermined value at the most significant end of the bit storing register content and wherein said means for outputting comprises means for selectively outputting the content of said bit string word forming register.

348. The encoder of claim 347 comprising means for entering a first occurrence in a new bit string word under formation comprising: a. means for storing a signal representing the number of binary bits remaining to be filled in a bit string word being formed; b. combining means for forming a signal representing the difference between the value of the remaining number of binary bits to be filled signal and the previous and current difference signal; c. means for comparing the value of the previous and current difference signal and the remaining binary bits to be filled signal for indicating the first is greater than or equal to, or less than the latter; d. means responsive to said less than indication for retaining the difference signal from the combining means as the number of bits needed in the next bit string word to enter the current absolute word; e. means operative in response to said greater than or equal to indication for enabling said counter means to count through a sequence of states corresponding in number to the retained number of bits needed in the next bit string word signal; f. means for indicating completion of the last mentioned counting; g. means for shifting the content of said bit string forming register one bit position in the direction of the least significant bit thereof for each said last mentioned counter means states; and h. means responsive to the last mentioned completion signal for inserting a bit signal of predetermined value at the most significant end of the bit storing register content.

349. The encoder of claim 347 comprising means for filling out the bits of a bit string word being formed when no further occurrences can be entered therein, comprising: a. means for storing a signal representing the number of binary bits remaining to be filled in the bit string word being formed; b. combining means for forming a signal representing the difference between the value of the remaining number of binary bits to be filled signal and the previous and current difference signal; c. means for comparing the value of the previous and current difference signal and the remaining binary bits to be filled signal for indicating the first is greater than or equal to, or less than the latter; d. means operative in response to said less than indication for enabling said counter means to count through a sequence of states corresponding in number to the value of the stored remaining binary bits to be filled signal; e. means for indicating completion of the last mentioned counting; and f. means for shifting the content of said bit string forming register one bit position in the direction of the least significant bit thereof for each said last mentioned counter means states.

350. An encoder according to claim 346 having a clipping means, the clipping means comprising: a. means for storing an upper limit value and a lower limit value; and b. means for comparing a current absolute word with said upper and lower limit values and indicating if the current absolute word is out of the bounds defined by the limit values.

351. An encoder according to claim 350 comprising an interval adjusting means comprising: a. means for storing an interval value; b. means responsive to an indication that the current entry is out of bounds for incrementally changing the stored upper and lower limit value by the value of said stored interval value; and c. means for enabling said comparing means to repeat the comparing, using the incrementally changed upper and lower limit values and current entry.

352. A decoder for converting hybrid coded signals to absolute coded word signals, the hybrid signals representing a series of occurrence values of decreasing value, the hybrid signals comprising a series of received binary coded word signals including at least one absolute coded word and a bit string word, the bit string word representing an occurrence by the number of bits of displacement of a bit of predetermined value from an absolute word in the series of hybrid words, a hybrid word comprising a flag signal indicating the type of word, comprising: a. absolute word outputting means comprising means responsive to an absolute word flag signal of a received hybrid word signal for outputting the received word signal; and b. absolute word signal forming and outputting means comprising 1. means responsive to an absolute word signal and each said bit of predetermined value in a subsequent bit string word signal of a received hybrid signal for forming an absolute word signal indicative of actual value of each said bit of predetermined value, and 2. means for outputting each said formed absolute word signal.

353. A decoder for converting hybrid coded signals to absolute coded word signals, the hybrid signals representing a series of occurrence values of decreasing value, the hybrid signals comprising a series of received binary coded word signals including at least one absolute coded word and at least one bit string word, the bit string word representing an occurrence by the number of bits of displacement of a bit of predetermined value from an absolute word in the series of hybrid words, a received word comprising a flag signal indicating the type of word, comprising: a. absolute word outputting means comprising means responsive to an absolute word flag signal of a received word signal for outputting the received word signal; and b. absolute word signal forming and outputting means comprising 1. shift register means for storing a received bit string word signal, 2. means for repeatedly enabling the shifting of the content of the shift register means one bit position in the direction of the least significant bit of the bit string word signal, 3. means for providing an indication when a bit signal indicative of said predetermined value arrives at a preselected position with respect to the shift register means, 4. counter means, 5. means responsive to a flag signal indicating a received absolute word signal for setting said counter means to a state relative to a reference state corresponding to the value of such absolute word signal, 6. means for enabling said counter means to count one state towards said reference state for each such shift of said shift register means, and 7. means responsive to said indication of a bit for outputting a signal corresponding to the state of said counter means.

354. The decoder of claim 353 wherein the absolute word forming means additionally comprises means for adjusting said counter means for bits, not of said predetermined value, which remain in said shift register means after the last bit of predetermined value in a received word comprising: a. additional counter means; b. means for indicating the maximum number of bits in an absolute word for output; c. means for selectively setting said additional counter means to a state relative to a state corresponding to said indication of the maximum number of bits in an absolute word; d. means for enabling said additional counter means to count one state relative to the set state thereof towards said reference state for each said shift of said shift register means; e. means for providing an indication of the occurrence of said reference value of said additional counter means; f. means responsive to the flag signal of a received bit string word signal and the lack of the last mentioned indication for further enabling both said counter means and additional counter means to count toward the reference states thereof; and g. means responsive to the last mentioned indication for terminating further enabling of count of said counter means and additional counter means.

355. A method, utilizing a digital data processing system having a memory system for creating a digitally coded data base in such memory system from received events occurring in a desired sequence and for retrieving from the data base, a plurality of said events forming a first type entry and a plurality of first type entries forming events of a second type entry, a first delimiter event and a second delimiter event identifying the boundary of, respectively, a first type entry and a second type entry, said delimiter events being represented by at least one of said received events comprising the steps of: a. monitoring the occurrence of received events and forming a first event-time indication indicating the relative order of occurrence thereof in a first type entry; b. detecting the occurrence of received delimiter events; c. storing in said memory system, as data base, digitally coded event signal representations of the different types of received events of first type entries; d. utilizing the detection of first delimiter events and the first event-time indications for creating, in said memory system in a first data base layer, first digitally coded event time signals indicative of the relative order of occurrence in which received events of the first type entries occur; e. utilizing the detection of first delimiter events for forming second event time indications indicating the relative order of occurrence of the events in the second type entries; f. utilizing the detection of second delimiter events and utilizing the second event-time indications for creating in said memory system, in a second data base layer, second digitally coded event-time signals which indicate the relative order of occurrence in which the events of the second type entries occur in each of a plurality of the received second type entries; and g. selectively reconstructing a series of events and at least first type entries in the order of occurrence as represented in the data base comprising the steps of: 1. designating a desired entry of the second data base layer; 2. designating a plurality of desired entries in the first data base layer; 3. selecting event signal representations from the data base; and 4. utilizing indications in the designated second entry of the data base and indications in the designated first layer of the data base for outputting event signals representing the selected event signal representations in the order in which they originally occurred.

356. A method, utilizing a digital data processing system having a memory system for creating a digitally coded data base in such memory system for received events occurring in a desired sequence and for retrieving from the data base, a plurality of said received events forming a first type entry and a plurality of first type entries forming events of a second type entry, a first delimiter event and a second delimiter event identifying the boundary of, respectively, a first type entry and a second type entry, said delimiter events being represented by at least one of said received events, comprising the steps of: a. monitoring the occurrence of said received events of the first type and forming a first event-time indication indicating the relative order of occurrence thereof in a first type entry; b. detecting the occurrence of received delimiter events; c. storing in said memory system, as data base, digitally coded signal representations of the different types of received events of first type entries; d. utilizing the detection of first delimiter events and utilizing the first event-time indications for creating in said memory system in a first data base layer, first digitally coded event-time signals indicative of the relative order of occurrence in which received events of the first type entries occur; e. utilizing the detection of first delimiter events for forming second event time indications indicating the relative order of occurrence of the events in the second type entries; f. utilizing the detection of second delimiter events and utilizing the second event-time indications for creating in said memory system, in a second data base layer, second digitally coded event-time signals which indicate the relative order of occurrence in which the events of the second type entries occur in each of a plurality of the received second type entries; g. selecting event signal representations from the data base; and h. utilizing the stored digitally coded signals of the first and second data base layers for outputting selected event signals representing the selected event signal representations in the order in which they originally occurred.

357. A method, utilizing a digital data processing system having a memory system for creating and retrieving a digitally coded data base in such memory system comprising the steps of: a. monitoring the occurrence of received first type events making up a first type entry, and forming first event-time indications indicating the relative order of occurrence thereof in the first type entry; b. detecting the occurrence of received first and second delimiter events; c. utilizing the detection of first delimiter events for forming second event-time indications indicating the relative order of occurrence of a series of second type events which make up a second type entry, first type entries forming second type events; d. storing in said memory system, as data base, digitally coded signal representations of at least the different types of received first type events; e. utilizing the detection of first delimiter events and the first event-time indications for creating in said memory system in a first data base layer, first digitally coded event time signals indicative of the relative order of occurrence in which received first type events occur in each of a plurality of first type entries; f. utilizing the detection of second delimiter events and the second event-time indications for creating in said memory system, in a second data base layer, second digitally coded event-time signals which indicate the relative order of occurrence of said second type events in each of a plurality of second type entries; and g. utilizing the data base event signal representations and the data base digitally coded event time signals for retrieving from the data base selected first and second type events in the order in which they originally occurred.

358. A method utilizing a digital data processing system having a memory for creating in such memory a digitally coded data base and for retrieving therefrom, comprising the steps of: a. monitoring the occurrence of received events and forming first event-time indications indicating the relative order of occurrence of such received events in each of a plurality of first type entries; b. detecting the occurrence of delimiter events in the received first type events defining the bounds of second type events which form second type entries; c. utilizing the detection of delimiter events for forming second event-time indications indicating the relative order of occurrence of the second type events within second type entries; d. storing in said memory, as data base, digitally coded event signal representations of at least the different types of received first type events; e. storing in said memory in a first data base layer, first digitally coded event-time signals representative of the first event-time indications; f. storing in the memory in a second data base layer, second digitally coded event-time signals representative of the second event-time indications; and g. utilizing the data base for outputting event signals representing the data base event signal representations in the order of occurrence within second type events as represented in the data base.

359. A method according to claim 358 comprising the additional steps of: a. interrogating the first data base layer prior to storing therein event-time signals representing a particular first type entry to determine if the events thereof are represented by event-time signals in the same order of occurrence as they occur in the particular first type entry; and b. conditioned upon finding the lack of the same order of occurrence, storing event-time signals representing the order of occurrence of the particular first type entry in the first data base layer.

360. A method according to claim 358 comprising the additional steps of: a. interrogating the first data base layer prior to storing therein event-time signals representing a particular first type entry to determine if the events thereof are represented by event-time signals in the same order of occurrence as they occur in the particular first type entry; and b. conditioned upon finding the same order of ocurrence, not creating event-time signals representing the order of occurrence of the particular first type entry in the first data base layer.

361. A method according to claim 358 comprising the additional steps of: a. creating signals relating the order of occurrence, represented by event-time signals in the second data base layer to a particular entry in the first data base layer; and b. utilizing such relating signals for selecting indications in the first data base layer for use in the step of outputting.

362. A method utilizing a digital data processing system having a memory for creating in such memory a digitally coded data base and for retrieving therefrom, comprising the steps of: a. monitoring the occurrence of received events and forming first event-time indications indicating the relative order of occurrence of such received events in each of a plurality of first type entries; b. determining the bounds of at least second type events which form second type entries; c. utilizing the determination of bounds for forming second event time indications indicating the relative order of occurrence of the second type events within second type entries; d. storing in such memory, as data base, digitally coded event signal representations of at least the different types of received first type events; e. storing in said memory in a first data base layer, first digitally coded event-time signals representative of the first event-time indications; f. storing in the memory in a second data base layer, second digitally coded event-time signals representative of the second event-time indications; and g. utilizing the data base for outputting event signals representing the data base event signal representations in the order of occurrence within second type events as represented in the data base.

363. A method according to claim 362 comprising the steps of: forming signals representing a relation between the different types of events, represented by event signal representations and the order of occurrence for corresponding events represented in one of the layers, and utilizing such formed signals in the step of outputting.

364. Digital data processing means having a memory system and adapted for creating in the memory system a digitally coded data base from received events occurring in a desired sequence and for retrieving from the data base, a plurality of said events forming a first type entry and a plurality of first type entries forming events of a second type entry, a first delimiter event and a second delimiter event identifying the boundary of, respectively, a first type entry and a second type entry, said delimiter events being represented by at least one of said received events, the data processing means comprising: a, means for monitoring the occurrence of received events and forming a first event-time indication indicating the relative order of occurrence thereof in a first type entry; b. means for detecting the occurrence of received delimiter events; c. means for storing in said memory system, as data base, digitally coded event signal representations of the different types of received events of first type entries; d. means for utilizing the detection of first delimiter events and the first event-time indications for creating, in said memory system in a first data base layer, first digitally coded event time signals indicative of the relative order of occurrence in which received events of the first type entries occurs; e. means for utilizing the detection of first delimiter events for forming second event tiime indications indicating the relative order of occurrence of the events in the second type entries; f. means for utilizing the detection of second delimiter events and utilizing the second event-time indications for creating in said memory system, in a second data base layer, second digitaly coded event-time signals which indicate the relative order of occurrence in which the events of the second type entries occur in each of a plurality of the received second type entries; and g.means for selectively reconstructing a series of events and at least first type entries in the order of occurrence as represented in the data base comprising 1. means for designating a desired entry of the second data base layer; 2. means for designating a plurality of desired entries in the first data base layer; 3. means for selecting event signal representations from the data base; and 4. means for utilizing indications in the designated second entry of the data base and utilizing indications in the designated first layer of the data base for outputting event signals representing the selected event signal representations in the order in which they originally occurred.

365. Digital data processing means having a memory system and adapted for creating a digitally coded data base in such memory system from received events occurring in a desired sequence and for retrieving from the data base, a plurality of said received events forming a first type entry and a plurality of first type entries forming events of a second type entry, a first delimiter event and a second delimiter event identifying the boundary of, respectively, a first type entry and a second type entry, said delimiter events being represented by at least one of said received events, the data processing means comprising: a. means for monitoring the occurrence of said received events of the first type and forming a first event-time indication indicating the relative order of occurrence thereof in a first type entry; b. means for detecting the occurrence of received delimiter events; c. means for storing in said memory system, as data base, digitally coded signal representations of the different types of received events of first type entries; d. means for utilizing the detection of first delimiter events and utilizing the first event-time indications for creating in said memory system in a first data base layer, first digitally coded event-time signals indicative of the relative order of occurrence in which received events of the first type entries occur; e. means for utilizing the detection of first delimiter events for forming second event time indications indicating the relative order of occurrence of the events in the second type entries; f. means for utilizing the detection of second delimiter events and utilizing the secod event-time indications for creating in said memory system, in a second data base layer, second digitally coded event-time signals which indicate the relative order of occurrence in which the events of the second type entries occur in each of a plurality of the received second type entries; g. means for selecting event signal representations from the data base; and h. means for utilizing the second stored digitally coded signals of the first and second data base layers for outputting selected event signals representing the selected event signal representations in the order in which they originally occurred.

366. Digital data processing means having a memory system and adapted for creating and retrieving a digitally coded data base in such memory system the data processing means comprising: a. means for monitoring the occurrence of received first type events making up a first type entry, and forming first event-time indications indicating the relative order of occurrence thereof in the first type entry; b. means for detecting the occurrence of received first and second delimiter events; c. means for utilizing the detection of first delimiter events for forming second event-time indications indicating the relative order of occurrence of a series of second type events which make up a second type entry, first type entries forming second type events; d. means for storing in said memory system, as data base, digitally coded signal representations of at least the different types of received first type events; e. means for utilizing the detection of first delimiter events and the first event-time indications for creating in said memory system in a first data base layer, first digitally coded event-time signals indicative of the relative order of occurrence in which received first type events occur in each of a plurality of first type entries; f. means for utilizing the detection of second delimiter events and the second event-time indications for creating in said memory system, in a second data base layer, second digitally coded event-time signals which indicate the relative order of occurrence of said second type events in each of a plurality of second type entries; and g. means for utilizing the data base event signal representations and the data base digitally coded event time signals for retrieving from the data base selected first and second type events in the order in which they originally occurred.

367. Digital data processing means having a memory for creating in such memory a digitally coded data base and for retrieving therefrom, comprising: a. means for monitoring the occurrence of received events and forming first event-time indications indicating the relative order of occurrence of such received events in each of a plurality of first type entries; b. means for detecting the occurrence of delimiter events in the received first type events defining the bounds of second type events which form second type entries; c. means for utilizing the detection of delimiter events for forming second event-time indications indicating the relative order of occurrence of the second type events within second type entries; d. means for storing in said memory, as data base, digitally coded event signal representations of at least the different types of received first type events; e. means for storing in said memory in a first data base layer, first digitally coded event-time signals representative of the first event-time indications; f. means for storing in the memory in a second data base layer, second digitally coded event-time signals representative of the second event-time indications; and g. means for utilizing the data base for outputting event signals representing the data base event signal representations in the order of occurrence within second type events as represented in the data base.

368. Data processing means according to claim 367 comprising: a. means for interrogating the first data base layer prior to storing therein event-time signals representing a particular first type entry to determine if the events thereof are represented by event-time signals in the same order of occurrence as they occur in the particular first type entry; and b. means conditioned upon finding the lack of the same order of occurrence, storing event-time signals representing the order of occurrence of the particular first type entry in the first data base layer.

369. Data processing means according to claim 367 comprising: a. means for interrogating the first data base layer prior to storing therein event-time signals representing a particular first type entry to determine if the events thereof are represented by event-time signals in the same order of occurrence as they occur in the particular first type entry; and b. means conditioned upon finding the same order of occurrence, for not creating event-time signals representing the order of occurrence of the particular first type entry in the first data base layer.

370. Data processing means according to claim 367 comprising: a. means for creating signals relating the order of occurrence, represented by event-time signals in the second data base layer to a particular entry in the first data base layer; and b. means for utilizing such relating signals for selecting indications in the first data base layer for use by the means for outputting.

371. Digital data processing means having a memory and adapted for creating in such memory a digitally coded data base and for retrieving therefrom, comprising: a. means for monitoring the occurrence of received events and forming first event-time indications indicating the relative order of occurrence of such received events in each of a plurality of first type entries; b. means for determining bounds of at least second type events which form second type entries; c. means for utilizing the determination of bounds for forming second event-time indications indicating the relative order of occurrence of the second type events within second type entries; d. means for storing in said memory, as data base, digitally coded event signal representations of at least the different types of received first type events; e. means for storing in said memory in a first data base layer, first digitally coded event-time signals representative of the first event-time indications; f. means for storing in the memory in a second data base layer, second digitally coded event-time signals representative of the second event-time indications; and g. means for utilizing the data base for outputting event signals representing the data base event signal representations in the order of occurrence within second type events as represented in the data base.

372. Digital data processing means for creating in a memory thereof a digitally coded data base from received data, the received data being represented by plural types of entries, each of said types of entries comprising a plurality of definable entries which in turn are represented by a plurality of events, events of at least one type of entry comprising an entry of another type, comprising: a. means for forming for each such type of entry, an event-time indication of the order of occurrence for the events within the entries thereof; b. means for forming from said event-time indications and in the memory a layer of digitally coded signals, for each such type of entry, such that each layer represents the order of occurrence of the events within the entries of the corresponding type of entry; c. means for forming in the memory digitally coded event signal representations for different types of events received in the data for at least one such type of entry corresponding to one of the layers; d. means for forming signals representing the relation between the event occurrences, in one layer, and the corresponding entries, represented by event occurrences, of another layer; and e. means utilizing the stored event representations, the stored event-time signals and the signals representing the relation between events in one layer and corresponding entries in another layer for recreating events corresponding to the event representations in the order of occurrence in the received data.

373. Data processing means according to claim 372 comprising: a. means for forming signals representing a relation between the different types of events, represented by event signal representations and the order of occurrence for corresponding events represented in one of the layers, and b. means for utilizing such formed signals in the means for recreating events for output.

374. A method using a data processor for retrieving, from a memory, a portion of a stored data base, the data base being represented by digital coded signals which represent the order of occurrence of plural events within each of plural entries, the method comprising the steps of: a. forming, as a request, a series of digital coded event signals representing events of an entry; b. forming, corresponding to individual events in the entry request, individual bias values which, from one end thereof to the other when in the order of occurrence of the corresponding events, have increasing values; c. utilizing the stored data base to form digital coded signals representing the data base order of occurrence for those events which are present in the request; d. utilizing the digital coded signals which are formed representing the data base order of occurrence and the bias values for identifying those data base entries which have a predetermined degree of match in order of occurrence of events with events of the request; and e. generating coded event signals for output representing the events present in the identified data base entry in the order of occurrence specified by such data base entry.

375. A method using a data processor for retrieving, from a memory, a portion of a stored data base, the data base being represented by digital coded signals which represent the order of occurrence of plural events within each of plural entries, the method comprising the steps of: a. forming, as a request, a series of digital coded event signals representing events of an entry; b. utilizing the request to form digital coded signals representing the order of occurrence of the events within the entry of the request; c. utilizing the stored data base to form digital coded signals representing the data base order of occurrence for those events which are present in the request; d. utilizing the digital coded signals formed in the last two steps for identifying those data base entries which have a predetermined degree of match in order of occurrence of events with events of the request; and e. generating coded event signals for output representing the events in the order of occurrence in which they are represented in the identified data base entries.

376. A method according to claim 375 comprising the additional steps of: forming as input to the data processor a pipe width signal identifying a permissible mismatch between the order of occurrence of events of the request and the corresponding events in the entry of the data base; and utilizing a value corresponding to the pipe width signal in the step of identifying entries having a predetermined degree of match.

377. A method according to claim 376 comprising the additional steps of: forming as input to the data processor a further value identifying a predetermined degree of mismatch between the events of the request and the events of the data base; and utilizing a value corresponding to the further value in the step of identifying entries having a predetermined degree of match.

378. A method according to claim 377 comprising the additional steps of: forming as input to the data processor a length correction signal; responding to the length correction signal for forming a still further signal representing a value related to the number of events in individual entries of the request and in individual data base entries; and utilizing the value represented by the still further signal in the step of identifying entries having a predetermined degree of match.

379. Data processing means for retrieving, from a memory, a portion of a stored data base, the data base being represented by digital coded signals which represent the order of occurrence of plural events within each of plural entries, the processing means comprising: a. means for forming, as a request, a series of digital coded event signals representing events of an entry; b. means for forming, corresponding to individual events in the entry request, individual bias values which, from one end thereof to the other when in the order of occurrence of the corresponding events, have increasing values; c. means for utilizing the stored data base to form digital coded signals representing the data base order of occurrence for those events which are present in the request; d. means for utilizing the digital coded signals which are formed representing the data base order of occurrence and the bias values for identifying those data base entries which have a predetermined degree of match in order of occurrence of events with events of the request; and e. means for generating coded event signals for output representing the events in the order of occurrence in which they are represented in the identified data base entries.

380. A data processing means for retrieving, from a memory, a portion of a stored data base, the data base being represented by digital coded signals which represent the order of occurrence of plural events within each of plural entries, the processing means comprising: a. means for forming, as a request, a series of digital coded event signals representing events of an entry; b. means for utilizing the request to form digital coded signals representing the order of occurrence of the events within the entry of the request; c. means for utilizing the stored data base to form digital coded signals representing the data base order of occurrence for those events which are present in the request; d. means for utilizing the digital coded signals formed by the last two named means for identifying those data base entries which have a predetermined degree of match in order to occurrence of events with events of the request; and e. means for generating coded event signals for output representing the events in the order of occurrence in which they are represented in the identified data base entries.

381. Processing means according to claim 380 comprising: means for forming as input to the processing means a pipe width signal identifying a permissible mismatch between the order of occurrence of events of the request and the corresponding events in the entry of the data base; and said means for identifying entries having a predetermined degree of match comprising means for utilizing a value corresponding to the pipe width signal.

382. Processing means according to claim 381 comprising: means for forming as input to the processing means a further value identifying a predetermined degree of mismatch between the events of the request and the events of the data base; and said means for identifying entries having a predetermined degree of match comprising means for utilizing a value corresponding to the further value.

383. Processing means according to claim 382 comprising: means for forming as input to the data processor a length correction signal; means responding to the length correction signal for forming a still further signal representing a value related to the number of events in individual entries of the request and in individual data base entries; and said means for identifying entries having a predetermined degree of match comprising means for utilizing the value represented by the still further signal.

384. A method using a data processor for retrieving from a memory a portion of a stored data base, the data base comprising a plurality of layers, each layer comprising event-time values represeting the order of occurrence of events in each of a plurality of entries for the layer, the entries on at least one first layer corresponding to the events in a second layer, the method comprising the steps of: a. forming, as a request, a series of digital coded event signals representing events of first and second type entries, the events of second type entries being entries in the first type entry; b. utilizing the request to form digital coded signals representing the order of occurrence of the events within the respective entries of the request; c. utilizing the first and second layers of the stored data base to form digital coded signals representing the data base order of occurrence for those events in the data base which are present in the request; d. utilizing the digital coded signals formed in the last two steps for identifying data base entries in each said first and second layers which have a predetermined degree of match in order of occurrence of events with events of the request; and e. generating coded event signals for output representing the events, for at least one layer, in the order of occurrence in which they are represented in the identified data base entries.

385. A method according to claim 384 comprising the additional step of: forming as input to the data processor a pipe width signal identifying a permissible mismatch between the order of occurrence of events of each type of entry of the request and the corresponding events in the entries of the data base; and utilizing a value corresponding to the pipe width signal in the step of identifying entries having a predetermined degree of match.

386. A method according to claim 385 comprising the additional step of: forming as input to the data processor a further value identifying a predetermined degree of mismatch between the events of the request and the events of the data base; and utilizing a value corresponding to the further value in the step of identifying entries having a predetermined degree of match.

387. A method according to claim 386 comprising the additional step of: forming as input to the data processor a length correction signal; responding to the length correction signal for forming a still further signal representing a value related to the number of events in individual entries of the request and in individual data base entries; and utilizing the value represented by the still further signal in the step of identifying entries having a predetermined degree of match.

388. Data processing means for retrieving from a memory a portion of a stored data base, the data base comprising a plurality of layers, each layer comprising event-time values representing the order of occurrence of events in each of a plurality of entries for the layer, the entries on at least one first layer corresponding to the events in a second layer, comprising: a. means for forming, as a request, a series of digital coded event signals representing events of first and second type entries, the events of second type entries being entries in the first type entry; b. means for utilizing the request to form digital coded signals representing the order of occurrence of the events within the respective entries of the request; c. means for utilizing the first and second layers of the stored data base to form digital coded signals representing the data base order of occurrence for those events in the data base which are present in the request; d. means for utilizing the digital coded signals formed by the last two named means for identifying data base entries in each said first and second layers which have a predetermined degree of match in order of occurrence of events with events of the request; and e. means for generating coded event signals for output representing the events, for at least one layer, in the order of occurrence in which they are represented in the identified data base entries.

389. Data processing means according to claim 388 comprising: means for forming, as input to the data processing means, a pipe width signal identifying a permissible mismatch between the order of occurrence of events of each type of entry of the request and the corresponding events in the entries of the data base; and said means for identifying entries having a predetermined degree of match comprising means for utilizing a value corresponding to the pipe width signal.

390. Data processing means according to claim 389 comprising: means for forming, as input to the data processing means, a further value identifying a predetermined degree of mismatch between the events of the request and the events of the data base; and said means for identifying entries having a predetermined degree of match comprising means for utilizing a value corresponding to the further value.

391. Data processing means according to claim 390 comprising: means for forming as input to the data processing means a length correction signal; means for responding to the length correction signal for forming a still further signal representing a value related to the number of events in individual entries of the request and in individual data base entries; and said means for identifying entries having a predetermined degree of match comprising means for utilizing the value represented by the still further signal.

392. A method, utilizing a digital data processing system, for creating in a memory thereof a digitally coded data base from received data and for retrieving from the data base, the received data being represented by plural types of entries, each of said types of entries comprising a plurality of definable entries which in turn are represented by a plurality of events, events of at least one type of entry comprising an entry of another type, comprising the steps of: a. forming for each such type of entry, an event time indication of the order of occurrence for the events within the entries thereof; b. forming from said event time indications and in the memory a layer of digitally coded signals, for each such type of entry, such that each layer represents the order of occurrence of the events within the entries of the corresponding type of entry; c. forming in the memory digitally coded signal representations of different types of events received in the data for at least one such type of entry corresponding to one of the layers; d. forming signals representing the relation between the event occurrences in one layer, and the corresponding entries, represented by event occurrences, of another layer; and e. utilizing the stored event representations, the stored event time signals and the signals representing the relation between events in one layer and corresponding entries in another layer for recreating events for output corresponding to the event representations and in the order of occurrence in the received data.

393. Digital data processing means, for creating in a memory thereof a digitally coded data base from received data and for retrieving from the data base, the received data being represented by plural types of entries, each of said types of entries comprising a plurality of definable entries which in turn are represented by a plurality of events, events of at least one type of entry comprising an entry of another type, comprising: a. means for forming for each such type of entry, an event time indication of the order of occurrence for the events within the entries thereof; b. means for forming from said event time indications and in the memory a layer of digitally coded signals, for each such type of entry, such that each layer represents the order of occurrence of the events within the entries of the corresponding type of entry; c. means for forming in the memory digitally coded event signal representations for different types of events received in the data for at least one such type of entry and hence corresponding to one of the layers; d. means for forming signals representing the relation between the event occurrences, in one layer, and the corresponding entries, represented by event occurrences, of another layer; and e. means for utilizing the stored event representations, the stored event time signals and the signals representing the relation between events in one layer and corresponding entries in another layer for recreating events for output corresponding to the event representations in the order of occurrence in the received data.