Patent US3613086A successfully refreshed from Google Patents.
US3613086A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Compressed index method and means with single control field
Assignee: International Business Machines Corp
•
Filing: 1969-01-03
•
Granted: 1971-10-12
•
Expires: 1989-01-03
Abstract
Abstract Generating and searching a compressed key index (CK index) from a source index. The source index is a sorted sequence of uncompressed key''s (UK''s) in which a UK is a record key, as the term is ordinarily understood. The CK index comprises a plurality of compressed keys (CK''s). Each CK is a shortened representation of a UK. After its generation, the CK index can be searched for any search argument (SA). The format of a CK is generated by this invention to include a single control field (P), and at least one key (K) byte which is a byte taken from a UK. Each CK is generated from a pair of adjacent UK''s taken in their sorted sequence from the source index. The pair of UK''s are compared at corresponding byte positions from their highest-order bytes. The order of a byte position in a UK is determined by its significance in sorting the UK''s. The control field (P) in the CK format is generated to represent the highest-order unequal byte position in the pair of compared UK''s. Field (P) represents the lowest-order byte position in the CK. One key byte (K) is generated by copying a byte from the second UK in the pair at its byte location represented by the field (P). Additional key bytes are copied only when the current P (i.e. Pi) is greater than the prior generated P (i.e. Pi 1), in which case K bytes are copied from the UK byte positions (Pi 1+1) through (Pi). Also a pointer (i.e. address) is provided represented by the first UK in the pair from which the CK was generated. The CK index can be searched for any search argument (SA). The search uses one byte (A) at a time from the SA beginning with its highest-order byte. The setting of an equal-counter (EQU) indicates the position of the current byte A in the SA. While serially searching a CK index for the byte A, the control field (P) of each encountered CK is read. Then a factor value and the number of K bytes are derived for the current CK after determining if its Pi is greater than Pi 1. The factor value indicates the amount of high-order compression for the UK being represented. If Pi is greater than P 1, the prior control field (Pi 1) is the current factor value, and the current number of key bytes (K) is Pi less Pi 1. But if Pi is equal to or less than Pi 1, the current factor value is Pi, and only one K byte exists in the current CK. The current factor value is then compared to the current equal counter setting (EQU). If the factor value is greater than the search argument, the search continues by going to the next CK. But if they are equal, the highest-order K byte in the CK is compared with the current A byte. If A and K are equal, the next A byte and the next K byte (if any) are fetched, and they are compared. Whenever all K bytes in a CK compares equal with A bytes, or whenever any K byte is less than the A byte, the search passes to the next CK. Whenever any Pi is less than the current setting of the equal counter (EQU), or whenever any K byte compares high with the A byte, the search is completed after reading the pointer with the current CK, retrieving the pointer''s record, and comparing the SA to the UK in the record for verification that the correct record has been obtained. The search is then ended in an index having an ascending sequence.
Inventors
- 👤 Edward Loizides
- 👤 John R Lyon
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 22:05
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9017; G06F16/902; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99942
Claims Analysis
Total Claims: 48
Claim 1
Independent Claim
165 words
In a method for generating a compressed key from a sequence of sorted uncompressed keys comprising a source index, including the steps of machine-accessing a byte from any uncompressed key and a byte from its immediately following uncompressed key in said source index, the bytes being a pair of the same order sequentially beginning from the highest-order byte position of both said uncompressed keys, machine-comparing each said pair of bytes beginning at the highest-order position to generate an unequal signal when any said pair is unequal, machine-counting each of said byte-positions from the highestorder position, and stopping said machine-counting step in response to said unequal signal to register a particular stopped count, and registering a byte from said immediately followiNg uncompressed key at its position represented by said particular stopped count in relation to its highest-order byte, said byte being a key byte for said compressed key, whereby every compressed key generated by the use of said machine-comparing step has at least one key byte.
Claim 2
Dependent Claim
165 words
In a method for generating a compressed key from a sequence of sorted uncompressed keys comprising a source index, including the steps of machine-accessing a byte from any uncompressed key and a byte from its immediately following uncompressed key in said source index, the bytes being a pair of the same order sequentially beginning from the highest-order byte position of both said uncompressed keys, machine-comparing each said pair of bytes beginning at the highest-order position to generate an unequal signal when any said pair is unequal, machine-counting each of said byte-positions from the highestorder position, and stopping said machine-counting step in response to said unequal signal to register a particular stopped count, and registering a byte from said immediately followiNg uncompressed key at its position represented by said particular stopped count in relation to its highest-order byte, said byte being a key byte for said compressed key, whereby every compressed key generated by the use of said machine-comparing step has at least one key byte.
Claim 3
Dependent Claim
77 words
In a method for generating a compressed key as defined in claim 1, further including the steps of machine-recording said particular stopped count as a control field for said particular compressed key, and also machine-recording said particular stopped count with said key byte to represent its position as the unequal byte found by said machine-comparing step, whereby every compressed key generated with the use of said machine-comparing step includes a particular stopped count as a control field.
Claim 4
Dependent Claim
170 words
In a method for generating compressed keys as defined in claim 1, further comprising the steps of machine-accessing a next uncompressed key in said source index, said immediately following uncompressed key and a next uncompressed key comprising a current pair of uncompressed keys, repeating said machine-comparing step by comparing like-ordered bytes in said current pair beginning at their highest-ordered byte position, machine-counting the like-ordered byte positions from the highest-ordered position as they are being compared by said machine-comparing step, and stopping said machine-counting step in response to said machine-comparing step sensing the first unequal pair of bytes to register a current count of said machine-counting step as a particular stopped count, comparing said current count with a prior particular stopped count, and signalling if the former is less than the latter, and registering said current count, and a byte from said next uncompressed key at its position located by said current count in relation to its highest-order byte position, whereby a compressed key results from operation of said registration step.
Claim 5
Dependent Claim
68 words
In a method of generating compressed keys as defined in claim 3 in which said signalling step indicates said current count is greater than said prior particular stopped count, further including the step of said registering step inserting bytes into a compressed key from said next uncompressed key from a byte position located by said prior particular stopped count through its byte position located by said current count.
Claim 6
Dependent Claim
74 words
In a method for generating compressed keys as defined in claim 4, further comprising the step of machine-recording in a corresponding compressed key said current count and each of said key bytes inserted by the last operation of said registering step in the order they are found in said next uncompressed key, whereby said current count represents the position in said next uncompressed key of the lowest-order key byte in said corresponding compressed key.
Claim 7
Dependent Claim
26 words
In a method for generating compressed keys as defined in claim 3 in which said machine-recording step comprises recording each key byte after said control field.
Claim 8
Dependent Claim
118 words
In a method for generating compressed keys as defined in claim 3 including the steps of machine indicating an end-of-block signal while generating compressed keys, said next uncompressed key being the last uncompressed key used in the generation of a current block of compressed keys, machine-generating a special code to represent the control field of a last compressed key for the current block of keys being generated, and machine-accessing an address representing the location of information represented by said next uncompressed key, and machine-recording said special code and said address to represent the last compressed key for said current block, whereby said address is recorded as a pointer field with said last compressed key in said current block.
Claim 9
Dependent Claim
53 words
In a method for generating compressed keys as defined in claim 2 further comprising the steps of machine-accessing an address representing the location of informAtion represented by said any uncompressed key, and machine-recording said address, as a pointer, next to each compressed key to provide a compressed key entry in a compressed index.
Claim 10
Dependent Claim
129 words
In a method for generating compressed keys from a sorted sequence of uncompressed keys providing a source index, including the steps of machine-accessing the uncompressed keys in pairs starting at the beginning of the sorted sequence, with a last uncompressed key of one pair becoming the first uncompressed key of a next pair, machine-comparing the corresponding bytes of each pair to generate an unequal-byte signal representing the highest-order unequal byte position in said pair, and machine-recording a compressed key comprising at least a position field in response to said unequal byte signal, and a byte from a second uncompressed key in each pair at the position at which said unequal-byte signal is generated, whereby the compressed key represents the first uncompressed key in each pair from which it is
Claim 11
Dependent Claim
129 words
In a method for generating compressed keys from a sorted sequence of uncompressed keys providing a source index, including the steps of machine-accessing the uncompressed keys in pairs starting at the beginning of the sorted sequence, with a last uncompressed key of one pair becoming the first uncompressed key of a next pair, machine-comparing the corresponding bytes of each pair to generate an unequal-byte signal representing the highest-order unequal byte position in said pair, and machine-recording a compressed key comprising at least a position field in response to said unequal byte signal, and a byte from a second uncompressed key in each pair at the position at which said unequal-byte signal is generated, whereby the compressed key represents the first uncompressed key in each pair from which it is
Claim 12
Dependent Claim
139 words
In a method for generating compressed keys as defined in claim 9, in which said machine-comparing step further includes the steps of repeating said machine-comparing step to compare a next pair of uncompressed keys in said sequence to generate therefrom a next unequal-byte signal representing their highest-order unequal byte position, comparing said next unequal byte signal with a prior unequal-byte signal to generate a control signal indicating if said next unequal-byte signal is greater than said prior unequal-byte signal, and repeating said machine-recording step to record a next compressed key comprising at least a control field representing said next unequal-byte signal, and a byte from the second uncompressed key of said next pair at the position represented by said next unequal-byte signal, whereby said next compressed key represents the first uncompressed key in said next pair of uncompressed keys.
Claim 13
Dependent Claim
101 words
In a method of searching an ascending sorted index of machine-readable compressed keys representing different items of information, each compressed key having a control field representing the highest-order unequal byte position in an uncompressed key pair from which said compressed key was derived, including the steps of machine-reading a particular control field of any particular compressed key and a next control field of a next compressed key, and machine-relating said particular control field and said next control field to generate a factor signal indicating if said next control field is greater than, equal to, or less than said particular control field.
Claim 14
Dependent Claim
101 words
In a method of searching an ascending sorted index of machine-readable compressed keys representing different items of information, each compressed key having a control field representing the highest-order unequal byte position in an uncompressed key pair from which said compressed key was derived, including the steps of machine-reading a particular control field of any particular compressed key and a next control field of a next compressed key, and machine-relating said particular control field and said next control field to generate a factor signal indicating if said next control field is greater than, equal to, or less than said particular control field.
Claim 15
Dependent Claim
70 words
In a method of searching as defined in claim 11, including the step of machine-generating a factor field equal to said next control field in response to said factor signal indicating said next control field is less than said particular control field, whereby the factor field indicates the number of bytes missing from said compressed key and having a higher order than a highest-order key byte in said compressed key.
Claim 16
Dependent Claim
42 words
In a method of searching as defined in claim 11, including the steps of machine-generating a factor field equal to said particular control field in response to said factor signal indicating said next control field is greater than said particular control field.
Claim 17
Dependent Claim
48 words
In a method of searching as defined in claim 11, including the step of machine-generating a factor field equal to said particular control field or to said next control field in response to said factor signal indicating said next control field is equal to said particular control field.
Claim 18
Dependent Claim
63 words
In a method of searching for a search argument as defined in claim 13, including the step of setting a pointer-cycle storage element in response to a key byte comparing-high with a corresponding byte of the search argument, and machine-registering a pointer following said next compressed key in response to said pointer-cycle storage element being set to end the sEarch in said index.
Claim 19
Dependent Claim
153 words
In a method of searching as defined in claim 11, including the steps of said machine-relating step generating a factor value for said next compressed key in response to said factor signal reacting with said particular and next control fields, and setting the factor value in a register, machine-accessing a key byte from said next compressed key, and a byte of a search-argument at a position indicated by the factor value in said register, machine-comparing said key byte and said byte of said search argument to generate a search signal representing if said key byte is less than, greater than, or equal to said byte of said search argument, machine-setting a found element in response to said search signal representing said key byte is greater than said byte of said search argument, and signalling the ending said search of said index for said search argument in response to said found element being set.
Claim 20
Dependent Claim
225 words
In a method of searching as defined in claim 11, including the steps of said machine-relating step generating a factor value for said next compressed key, said factor value being obtained from said particular control field if said factor signal indicates said current control field is less than said particular control field, but said factor value being obtained from said next control field if said factor signal indicates said current control field is equal to or greater than said particular control field, setting the factor value into a register, machine-comparing the value in said register with a setting of an equal counter, and generating an equal signal if said value is equal to said equal counter setting, machine-accessing a first key byte of said next compressed key and a first search-argument byte, next machine-comparing said first key byte and said first search argument byte to generate a search signal indicating if said key byte is less than, greater than, or equal to said search argument byte, incrementing said equal counter setting and the factor value in said register in response to said search signal indicating said key byte is equal to said search argument byte, and then machine-comparing the value in said register with said next control field, and generating a last-key-byte signal if they compare-equal, or a not-last-key-byte signal if they do not compare-equal.
Claim 21
Dependent Claim
92 words
In a method of searching for a search argument as defined in claim 17, including the steps of repeating said next machine-comparing step for each next search argument byte and each next key byte obtained by repeating said machine-accessing step as long as the search signal indicates an equal condition, and as long as said then machine-comparing step generates a not-last-key-byte signal, and incrementing the value in said register each time said search signal indicates an equal condition. whereby said search is continued within the key bytes of said next compressed key.
Claim 22
Dependent Claim
44 words
In a method of searching for a search argument as defined in claim 17, including the steps of setting a pointer next storage element in response to said last-key-byte signal, and machine-reading a pointer following a last key byte of said next compressed key.
Claim 23
Dependent Claim
71 words
In a method of searching for a search argument as defined in claim 17, further comprising the steps of setting a control-field-cycle storage element in response to said search signal indicating a key byte is less than a search argument byte, and said machine-reading step reading a control field of a following compressed key in response to said control-field-cycle storage element being set, whereby the search of said index is continued.
Claim 24
Dependent Claim
53 words
In a method of searching for a search argument as defined in claim 17, including the steps of setting a key-byte-cycle storage element in response to completion by said reading step of reading a control-field, and machine-registering a key byte of said next compressed key in reSponse to setting said key-byte-cycle storage element.
Claim 25
Independent Claim
180 words
A system for generating a compressed key from a sequence of sorted uncompressed keys comprising a source index, comprising means for accessing a byte of from any uncompressed key and a byte from its immediately-following uncompressed key in said source index, the bytes being a pair of the same order sequentially beginning from the highest-order byte position of both said uncompressed keys, means for comparing each said pair of bytes beginning at the highest-order position to generate an unequal signal when any said pair is unequal, means for counting each of said byte-positions from the highest-order position, and stopping said counting means in response to said unequal signal to register a particular stopped count, and means for registering a byte from said immediately-following uncompressed key at its position represented by said particular stopped count in relation to its highest-order byte, said byte being a key byte for a compressed key representing the same information as is represented by said any uncompressed key, whereby every compressed key generated by the use of said comparing means has at least one key byte.
Claim 26
Independent Claim
180 words
A system for generating a compressed key from a sequence of sorted uncompressed keys comprising a source index, comprising means for accessing a byte of from any uncompressed key and a byte from its immediately-following uncompressed key in said source index, the bytes being a pair of the same order sequentially beginning from the highest-order byte position of both said uncompressed keys, means for comparing each said pair of bytes beginning at the highest-order position to generate an unequal signal when any said pair is unequal, means for counting each of said byte-positions from the highest-order position, and stopping said counting means in response to said unequal signal to register a particular stopped count, and means for registering a byte from said immediately-following uncompressed key at its position represented by said particular stopped count in relation to its highest-order byte, said byte being a key byte for a compressed key representing the same information as is represented by said any uncompressed key, whereby every compressed key generated by the use of said comparing means has at least one key byte.
Claim 27
Dependent Claim
77 words
A system for generating a compressed key as defined in claim 22, further including means for recording said particular stopped count as a control field for said particular compressed key, and means for also recording said particular stopped count with said key byte to represent its position as the unequal byte found by said comparing means, whereby every compressed key generated with the use of said comparing means includes a particular stopped count as a control field.
Claim 28
Dependent Claim
177 words
A system for generating compressed keys as defined in claim 22, further comprising means for accessing a next uncompressed key in said source index, said immediately following uncompressed key and said next uncompressed key comprising a current pair of uncompressed keys, actuating said comparing means to compare like-ordered bytes in said current pair beginning at their highest-ordered byte position, means for counting the like-ordered byte positions from the highest-ordered position as they are being compared by said comparing means, and stopping the operation of said counting means in response to said comparing means sensing a first unequal pair of bytes to register a current count of said counting means as a particular stopped count, means for comparing said current count with a prior particular stopped count, and signalling if the former is less than the latter, and means for registering the current count, and a byte from said next uncompressed key at a position located by said current count in relation to its highest-order byte position, whereby a compressed key results from operation of said registration means.
Claim 29
Dependent Claim
63 words
A system for generating compressed keys as defined in claim 24 in which said signalling means indicates said current count is greater than said prior particular stopped count, further including means for registering bytes for a compressed key from said next uncompressed key from a byte position located by said prior particular stopped count through its byte position located by said current count.
Claim 30
Dependent Claim
72 words
A system for generating compressed keys as defined in claim 25, further comprising means for recording in a corresponding compressed key said current count and each of said key bytes inserted by the last operation of said registering means in the order they are found in said next uncompressed key, whereby said current count represents the position in said next uncompressed key of the lowest-order key byte in said corresponding compressed key.
Claim 31
Dependent Claim
24 words
A system for generating compressed keys as defined in claim 24 in which said recording means records each key byte after said control field.
Claim 32
Dependent Claim
119 words
A system for generating compressed keys as defined in claim 24 including means for indicating an end-of-blOck signal while generating compressed keys, said next uncompressed key being the last uncompressed key used in the generation of a block of compressed keys, means for generating a special code to represent the control field of a last compressed key for the current block of keys being generated, means for accessing an address representing the location of information represented by said next uncompressed key, and means for recording said special code and said address to represent the last compressed key for said current block, whereby said address is recorded as a pointer field with said last compressed key in said current block.
Claim 33
Dependent Claim
53 words
A system for generating compressed keys as defined in claim 23, further comprising means for accessing an address representing the location of information represented by said any uncompressed key, and means for recording said address, as a pointer, next to each compressed key to provide a compressed key entry in a compressed index.
Claim 34
Independent Claim
131 words
A system for generating compressed keys from a sorted sequence of uncompressed keys providing a source index, including means for accessing the uncompressed keys in pairs starting at the beginning of the sorted sequence, with a last uncompressed key of one pair becoming the first uncompressed key of a next pair, means for comparing the corresponding bytes of each pair to generate an unequal-byte signal representing the highest-order unequal byte position in said pair, means for recording a compressed key comprising at least a position field in response to said unequal byte signal, and a byte from a second uncompressed key in each pair at the position at which said unequal-byte signal is generated, whereby the compressed key represents the first uncompressed key in each pair from which it is generated.
Claim 35
Independent Claim
131 words
A system for generating compressed keys from a sorted sequence of uncompressed keys providing a source index, including means for accessing the uncompressed keys in pairs starting at the beginning of the sorted sequence, with a last uncompressed key of one pair becoming the first uncompressed key of a next pair, means for comparing the corresponding bytes of each pair to generate an unequal-byte signal representing the highest-order unequal byte position in said pair, means for recording a compressed key comprising at least a position field in response to said unequal byte signal, and a byte from a second uncompressed key in each pair at the position at which said unequal-byte signal is generated, whereby the compressed key represents the first uncompressed key in each pair from which it is generated.
Claim 36
Dependent Claim
139 words
A system for generating compressed keys as defined in claim 30, in which said comparing means further includes means for actuating said comparing means to compare a next pair of uncompressed keys in said sequence to generate therefrom a next unequal-byte signal representing their highest-order unequal byte position, means for comparing said next unequal-byte signal with a prior unequal-byte signal to a control signal indicating if said next unequal-byte signal is greater than said prior unequal-byte signal, and means for actuating said recording means to record a next compressed key comprising at least a control field representing said next unequal-byte signal, and a byte from the second uncompressed key of said next pair at the position represented by said next unequal-byte signal, whereby said next compressed key represents the first uncompressed key in said next pair of uncompressed keys.
Claim 37
Independent Claim
101 words
A system of searching an ascending sorted index of machine-readable compressed keys representing different items of information, each compressed key having a control field representing the highest-order unequal byte position in an uncompressed key pair from which said compressed key was derived, including means for reading a particular control field of any particular compressed key and a next control field of a next compressed key, and means for relating said particular control field and said next control field to generate a factor signal indicating if said next control field is greater than, equal to, or less than said particular control field.
Claim 38
Independent Claim
101 words
A system of searching an ascending sorted index of machine-readable compressed keys representing different items of information, each compressed key having a control field representing the highest-order unequal byte position in an uncompressed key pair from which said compressed key was derived, including means for reading a particular control field of any particular compressed key and a next control field of a next compressed key, and means for relating said particular control field and said next control field to generate a factor signal indicating if said next control field is greater than, equal to, or less than said particular control field.
Claim 39
Dependent Claim
68 words
A system of searching as defined in claim 32, including means for generating a factor field equal to said next control field in response to said factor signal indicating said next control field is less than said particular control field, whereby the factor field indicates the number of bytes missing from said compressed key and having a higher order than a highest-order key byte in said compressed key.
Claim 40
Dependent Claim
40 words
A system of searching as defined in claim 32, including means for generating a factor field equal to said particular control field in response to said factoR signal indicating said next control field is greater than said particular control field.
Claim 41
Dependent Claim
46 words
A system of searching as defined in claim 32, including means for generating a factor field equal to said particular control field or to said next control field in response to said factor signal indicating said next control field is equal to said particular control field.
Claim 42
Dependent Claim
60 words
A system of searching for a search argument as defined in claim 31, including setting a pointer-cycle storage element in response to a key byte comparing-high with a corresponding byte of a search argument, means for registering a pointer following said next compressed key in response to said pointer-cycle storage element being set to end the search in said index.
Claim 43
Dependent Claim
159 words
A system of searching as defined in claim 32, including said machine-relating means generating a factor value for said next compressed key in response to said factor signal reacting with said particular and next control fields, and setting the factor value in a register, means for accessing a key byte from said next compressed key, and a byte of a search argument at a position indicated by the factor value in said register, means for comparing said key byte and said byte of said search argument to generate a search signal representing if said key byte is less than, greater than, or equal to said byte of said search argument, means for setting a found element in response to said search signal representing said key byte is greater than said byte of said search argument byte, and means for signalling the ending said search of said index for said search argument in response to said found element being set.
Claim 44
Dependent Claim
254 words
A system of searching as defined in claim 32, including means for activating said machine-relating means for generating a factor value for said compressed key, said factor value being obtained from said next control field if said factor signal indicates said next control field is less than said particular control field, but said factor value being obtained from said particular control field if said factor signal indicates said next control field is equal to or greater than said particular control field, setting the factor value into a register, means for comparing the value in said register with a setting of an equal counter, and generating an equal signal if said factor value is equal to said equal counter setting, means for accessing a first key byte of said next compressed key and a first search-argument byte, means for next comparing said first key byte and said first search argument byte to generate a search signal indicating if said key byte is less than, greater than, or equal to said search argument byte, means for incrementing said equal counter setting and the value in said register in response to said search signal indicating said key byte is equal to said search argument byte, and means for then comparing the value in said register with said next control field, and generating a last-key-byte signal if they compare-equal, or a not-last-key byte signal if they do not compare-equal to determine when the last key byte of said compressed key has been compared with a search argument byte.
Claim 45
Dependent Claim
94 words
A system of searching for a search argument as defined in claim 38, including means for repeating said next comparing step for each next search argument byte and each next key byte obtained by reactuation of said machine-accessing means as long as the search signal indicates an equal condition, and as long as said then comparing means generates a not-last-key-byte signal, and means for incrementing the value in said register each time said search signal indicates an equal condition, whereby said search is continued within a key byte field of said next compressed key.
Claim 46
Dependent Claim
45 words
A system of searching for a search argument as defined in claim 38, including means for setting a pointer next storage element in response to said last-key-byte sigNal, and said reading means reading a pointer following a last key byte of said next compressed key.
Claim 47
Dependent Claim
73 words
A system of searching for a search argument as defined in claim 38, further comprising means for setting a control-field-cycle storage element in response to said search signal indicating a key byte is less than a search argument byte, and means for activating said machine-reading means for reading a control field of a following compressed key in response to said control-field-cycle storage element being set, whereby the search of said index is continued.
Claim 48
Dependent Claim
53 words
A system of searching for a search argument as defined in claim 38, including means for setting a key-byte-cycle storage element in response to completion by said reading means of reading a control-field and means for registering a key byte of said next compressed key in response to setting said key-byte-cycle storage element.
References Cited (Backward Citations)
US3030609A
Cited
US3275989A
Cited
US3242470A
Cited
US3295102A
Cited
US3408631A
Cited
US3448436A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-10-11 | 1975-04-12 | 1975-10-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-10-11 | 1979-04-12 | 1979-10-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-10-11 | 1983-04-12 | 1983-10-12 | $7700.00 | Window Closed / Lapsed |