US3602895A
Expired / Lapsed
US
⏱️ 0.0 years remaining
One key byte per key indexing method and means
Assignee: International Business Machines Corp
•
Filing: 1969-06-30
•
Granted: 1971-08-31
•
Expires: 1989-06-30
Abstract
Abstract Electronically controlled method and means for a compressed index in which each key has only a single key byte and a position control field. Each compressed key represents a corresponding uncompressed key of any byte length by means of a pointer associated with the corresponding uncompressed key in the source uncompressed index from which the compressed index is derived. The search reads out the pointer with any specially-selected compressed key having an equal condition between its key byte and a current search-argument byte. After ending conditions are established, the last readout pointer is correct if the search argument is in the source uncompressed index.
Inventors
- 👤 Edward Loizides
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 19: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/99931
Claims Analysis
Total Claims: 74
Claim 1
Independent Claim
92 words
A method of generating a compressed index from a sorted sequence of uncompressed keys in a machine-accessible store, comprising machine-comparing each of said uncompressed keys with its prior key in the sorted sequence to generate an unequal signal at a highest-order unequal byte position, machine-storing only one key byte from every uncompressed key from its byte position for which said machine-comparing step generates the unequal signal, and machine-inserting said one key byte from said machinestoring step into said compressed index, whereby every compressed key in said compressed index has a single key-byte.
Claim 2
Independent Claim
92 words
A method of generating a compressed index from a sorted sequence of uncompressed keys in a machine-accessible store, comprising machine-comparing each of said uncompressed keys with its prior key in the sorted sequence to generate an unequal signal at a highest-order unequal byte position, machine-storing only one key byte from every uncompressed key from its byte position for which said machine-comparing step generates the unequal signal, and machine-inserting said one key byte from said machinestoring step into said compressed index, whereby every compressed key in said compressed index has a single key-byte.
Claim 3
Independent Claim
150 words
A method of generating a compressed index from a sorted sequence of uncompressed keys, comprising machine-generating a first compressed key in said index from the highest-order byte of the first uncompressed key in said index, machine-accessing said uncompressed keys in their sorted sequence, machine-pairing each Uncompressed key, except a first and last, as a first uncompressed key in one pair of uncompressed keys and as the second uncompressed key in the next pair of uncompressed keys, machine-comparing like-ordered bytes in each pair of uncompressed keys in said index, beginning with the highest-ordered bytes of each pair, machine-generating a signal indicating inequality between compared bytes, machine-storing only one key byte into said compressed index from every uncompressed key at its highest-order byte position at which said machine-generating step provides an inequality signal, and machine-inhibiting any storage in said compressed index of any other byte in every one of said uncompressed keys.
Claim 4
Independent Claim
150 words
A method of generating a compressed index from a sorted sequence of uncompressed keys, comprising machine-generating a first compressed key in said index from the highest-order byte of the first uncompressed key in said index, machine-accessing said uncompressed keys in their sorted sequence, machine-pairing each Uncompressed key, except a first and last, as a first uncompressed key in one pair of uncompressed keys and as the second uncompressed key in the next pair of uncompressed keys, machine-comparing like-ordered bytes in each pair of uncompressed keys in said index, beginning with the highest-ordered bytes of each pair, machine-generating a signal indicating inequality between compared bytes, machine-storing only one key byte into said compressed index from every uncompressed key at its highest-order byte position at which said machine-generating step provides an inequality signal, and machine-inhibiting any storage in said compressed index of any other byte in every one of said uncompressed keys.
Claim 5
Dependent Claim
54 words
A method of generating a compressed index as defined in claim 1, comprising machine-generating a position signal for each said one key byte in relation to its uncompressed key, and machine-storing said position signal with said one key byte in said compressed index, whereby each compressed key in said index has a fixed length.
Claim 6
Dependent Claim
54 words
A method of generating a compressed index as defined in claim 3 in which each uncompressed key has an associated pointer for addressing a data location represented by a corresponding one of said uncompressed keys, further comprising, machine-transferring the pointer for each uncompressed key into association with a corresponding compressed key in said index.
Claim 7
Independent Claim
124 words
A method of searching for a search argument in a compressed index in which each compressed key has only a single key byte and has a position indication for said byte in relation to a corresponding uncompressed key, comprising machine-reading said position indication for each said compressed keys in sequence, machine-accessing a byte of said search argument with said position indication, machine-comparing said byte of said search argument with the single key byte of said compressed key, machine-generating a signal when said key byte and search argument byte are equal, and machine-storing a representation of a last of said compressed keys in said index for which said machine-generating step provides said signal, whereby said representation can indicate any correct compressed key in said index.
Claim 8
Independent Claim
124 words
A method of searching for a search argument in a compressed index in which each compressed key has only a single key byte and has a position indication for said byte in relation to a corresponding uncompressed key, comprising machine-reading said position indication for each said compressed keys in sequence, machine-accessing a byte of said search argument with said position indication, machine-comparing said byte of said search argument with the single key byte of said compressed key, machine-generating a signal when said key byte and search argument byte are equal, and machine-storing a representation of a last of said compressed keys in said index for which said machine-generating step provides said signal, whereby said representation can indicate any correct compressed key in said index.
Claim 9
Dependent Claim
66 words
A method of searching for a search argument as defined in claim 5, in which said compressed index includes a pointer for each compressed key to address the location of date represented by each key, comprising machine-registering the pointer with the compressed key acted upon by said machine-storing step, whereby any pointer acted upon by said machine-registering step represents a possible correct key in said index.
Claim 10
Independent Claim
107 words
A method of searching for a search argument in a compressed index, in which each compressed key has only a single key byte and has a position indication for said byte in relation to its uncompressed key, comprising, machine-reading said position indication with each said compressed key searched in said compressed index, machine-accessing a byte of said search argument with each said position indication, machine-comparing each said byte of said search argument with the single key byte of said compressed key, machine-signalling a signal when said machine-comparing step indicates a special relationship between said bytes, and machine-storing a special-relationship indicator when said machine-signalling step provides said signal.
Claim 11
Independent Claim
107 words
A method of searching for a search argument in a compressed index, in which each compressed key has only a single key byte and has a position indication for said byte in relation to its uncompressed key, comprising, machine-reading said position indication with each said compressed key searched in said compressed index, machine-accessing a byte of said search argument with each said position indication, machine-comparing each said byte of said search argument with the single key byte of said compressed key, machine-signalling a signal when said machine-comparing step indicates a special relationship between said bytes, and machine-storing a special-relationship indicator when said machine-signalling step provides said signal.
Claim 12
Dependent Claim
46 words
A method of searching for a search argument as defined in claim 7, comprising machine-storing a position indication for a compressed key for which said indicator has been stored, whereby said position indication may be significant to subsequent searching for said search argument in said index.
Claim 13
Dependent Claim
60 words
A method of searching for a search argument as defined in claim 7, in which said compressed index includes a pointer for each compressed key to address the location of data represented by each key, comprising machine-storing a pointeR with a last compressed key in said index for which said signal indicates equality of said bytes as said special relationship.
Claim 14
Dependent Claim
47 words
A method of searching for a search argument as defined in claim 7 in which said machine-storing step also includes, machine-storing the special-relationship indicator to represent an equality found between said bytes, whereby said indicator is significant to further searching for said search argument in said index.
Claim 15
Dependent Claim
61 words
A method of searching for a search argument as defined in claim 7, comprising machine-signalling a high or low signal as said signal in response to said compressed key having a key byte respectively greater than or less than said argument byte, and machine-storing a position indication for a compressed key providing said high or low signal from said machine-signalling step.
Claim 16
Dependent Claim
63 words
A method of searching for a search argument as defined in claim 10 comprising machine-resetting said special-relationship indicator in response to said machine-signalling step indicating the key byte in a following compressed key is less than a byte of said search argument compared by said machine-comparing step, whereby said machine-resetting step is significant to further searching for said search argument in said index.
Claim 17
Dependent Claim
66 words
A method of searching for a search argument as defined in claim 7, in which said machine-storing step stores an equal-significance indicator and an unequal-significance indicator for determining the significance of one or more subsequent compressed keys while continuing to search in said index for said search argument, and machine-controlling one or both of said significance indicators in response to said signal from said machine-signalling step.
Claim 18
Dependent Claim
26 words
A method of searching for a search argument as defined in claim 13 comprising, machine-setting each of said indicators to indicate nonsignificance prior to a search.
Claim 19
Dependent Claim
55 words
A method of searching as defined in claim 14, comprising said machine-signalling step also providing a high or low signal in response to said machine-comparing step having the key byte respectively greater than or less than the argument byte, and machine-controlling one or both of said indicators in response to said high or low signal.
Claim 20
Dependent Claim
54 words
A method of searching as defined in claim 14, said compressed index having an ascending-collating sequence, for which said machine-signalling step also provides a high signal in response to said machine-indicating step having the key byte greater than the argument byte, and machine-controlling one of said significance indicators in response to said high signal.
Claim 21
Dependent Claim
48 words
A method of searching an ascending-sequenced compressed index for a search argument as defined in claim 16, in which said machine-controlling step includes machine-resetting both of said significance indicators in response to a low signal indicating said key byte is lower than said byte of said search argument.
Claim 22
Dependent Claim
54 words
A method of searching as defined in claim 14, said compressed index having a descending-collating sequence, for which said machine-signalling step also provides a low signal in response to said machine-indicating step having the key byte less than the argument byte, and machine-controlling one of said significance indicators in response to said low signal.
Claim 23
Dependent Claim
48 words
A method of searching a descending-sequenced compressed index for a search argument as defined in claim 18, in which said machine-controlling step includes machine-resetting both of said significance indicators in response to a high signal indicating said key byte is greater than said byte of said search argument.
Claim 24
Dependent Claim
60 words
A method of searching for a search argument as defined in claim 7, comprising machine-resetting an equal indicator to a nonsignificant state for subsequent searching in said index for said search argument, and machine-resetting an unequal indicator when no position indication in any searched compressed key is currently significant to searching further in said compressed index for said search argument.
Claim 25
Dependent Claim
76 words
A method of searching as defined in claim 20 within an ascending-collated index, and upon machine-reading a next compressed key finding the equal indicator set or reset, and finding the unequal indicator reset to a nonsignificant state, comprising machine-signalling a low signal that indicates the byte of said next compressed key is less than a corresponding byte of the search argument, and machine-continuing the nonsignificant state of said unequal indicator in response to said low signal.
Claim 26
Dependent Claim
86 words
A method of searching as defined in claim 20, and upon machine-reading a next compressed key finding the equal indicator set or reset, and finding the unequal indicator reset to a nonsignificant state, comprising machine-signalling an equal signal that indicates the byte of said next compressed key is equal to a corresponding byte of the search argument, machine-setting the equal indicator to a significant state in response to said equal signal, and machine-continuing the nonsignificant state of said unequal indicator in response to said equal signal.
Claim 27
Dependent Claim
23 words
A method of searching as defined in claim 22, comprising also machine-storing a pointer associated with the compressed key providing said equal signal.
Claim 28
Dependent Claim
118 words
A method of searching as defined in claim 20 within an ascending-collated index, and upon machine-reading a next compressed key finding the equal indicator set or reset, and finding the unequal indicator reset to a nonsignificant state comprising machine-signalling a high signal that indicates the byte of said next compressed key is greater than a corresponding byte of the search argument, machine-continuing the state of said equal indicator in response to said high signal, machine-setting the unequal indicator to a significant state in response to said high signal, and also machine-storing a position indication of said next compressed key in response to said high signal for use in subsequent searching of said compressed index for said search argument.
Claim 29
Dependent Claim
78 words
A method of searching for a search argument as defined in claim 20 within an ascending-collated index, during which the equal indicator is set or reset, comprising machine-setting said unequal indicator to a significant state in response to a current key byte being greater than a corresponding byte of said search argument, also machine-storing a position indication of the current compressed key in response to said machine-setting step, and machine-reading a next compressed key in the compressed index.
Claim 30
Dependent Claim
125 words
A method of searching as defined in claim 25, and upon machine-reading the next compressed key finding the equal indicator set or reset, and finding the unequal indicator set to a significant state, comprising machine-signalling a low signal that indicates the byte of said next compressed index is less than a corresponding byte of said search argument, machine-comparing the position indication of said next compressed key with the position indication last stored by said machine-storing step, said machine-comparing step generating a high-order-shift signal when the position indication of said next compressed key has a higher order than said last registered position indication, and machine-resetting both said equal indication and said unequal indication to nonsignificant states in response to said high-order-shift signal and said low signal.
Claim 31
Dependent Claim
142 words
A method of searching as defined in claim 25, and upon machine-reading the next compressed key finding the equal indicator set or reset, and finding the unequal indicator set to a significant state, comprising machine-signalling a high signal that indicates the byte of said next compressed index is greater than a corresponding byte of said search argument, machine-comparing the position indication of said next compressed key with the position indication last stored by Said machine-storing step, said machine-comparing step generating a high-order-shift signal when the position indication of said next compressed key has a higher order than said last registered position indication, machine-setting said unequal indication to a significant state in response to said high-order-shift signal and to said high signal, and machine-storing a position indication of said next compressed key in response to said high-order-shift signal and to said high signal.
Claim 32
Dependent Claim
76 words
A method of searching as defined in claim 20 within a descending-collated index, and upon machine-reading a next compressed key finding the equal indicator set or reset, and finding the unequal indicator reset to a nonsignificant state, comprising machine-signalling a high signal that indicates the byte of said next compressed key is greater than a corresponding byte of the search argument, and machine-continuing the nonsignificant state of said unequal indicator in response to said high signal.
Claim 33
Dependent Claim
118 words
A method of searching as defined in claim 20 within a descending-collated index, and upon machine-reading a next compressed key finding the equal indicator set or reset, and finding the unequal indicator reset to a nonsignificant state, comprising machine-signalling a low signal that indicates the byte of said next compressed key is less than a corresponding byte of the search argument, machine-continuing the state of said equal indicator in response to said high signal, machine-setting the unequal indicator to a significant state in response to said low signal, and machine storing a position indication of said next compressed key in response to said low signal for use in subsequent searching of said compressed index for said search argument.
Claim 34
Dependent Claim
79 words
A method of searching for a search argument as defined in claim 20 within a descending-collated index, during which the equal indicator is set or reset, comprising machine-setting said unequal indicator to a significant state in response to a current key byte being less than a corresponding byte of said search argument, machine storing the corresponding position indication of the current compressed key in response to said machine-setting step, and machine-reading a next compressed key in the compressed index.
Claim 35
Dependent Claim
126 words
A method of searching as defined in claim 30, and upon machine-reading the next compressed key finding the equal indicator set or reset, and finding the unequal indicator set to a significant state, comprising machine-signalling a high signal that indicates the byte of said next compressed index is greater than a corresponding byte of said search argument, machine-comparing the position indication of said next compressed key with the position indication last stored by said machine-storing step, said machine-comparing step generating a high-order-shift signal when the position indication of said next compressed key has a higher order than said last stored position indication, and machine-resetting both said equal indication and said unequal indication to a nonsignificant state in response to said high-order-shift signal and said high signal.
Claim 36
Dependent Claim
149 words
A method of searching as defined in claim 25 and upon machine-reading the next compressed key finding the equal indicator set or reset, and finding the unequal indicator set to a significant state, comprising machine-signalling an equal signal that indicates the byte of said next compressed index is equal to a corresponding byte of said search argument, machine-comparing a position indication of the next compressed key with the position indication last stored by said machine-storing step, said machine-comparing step generating a high-order-shift signal when the position indication of said next compressed key has a higher order than said last stored position indication, machine-setting said equal indication to a significant state, and machine-resetting said unequal indication to a nonsignificant State, in response to said high-order-shift signal and said equal signal, and machine-storing a pointer associated with said next compressed key in response to said high-order-shift signal and said equal signal.
Claim 37
Dependent Claim
142 words
A method of searching as defined in claim 30, and upon machine-reading the next compressed key finding the equal indicator set or reset, and finding the unequal indicator set to a significant state, comprising machine-signalling a low signal that indicates the byte of said next compressed index is less than a corresponding byte of said search argument, machine-comparing the position indication of the next compressed key with the position indication last stored by said machine-storing step, said machine-comparing step generating a high-order-shift signal when the position indication of said next compressed key has a higher order than the last stored position indication, machine-setting said unequal indication to a significant state in response to said high-order-shift signal and to said high signal, and machine-storing a position indication of said next compressed key in response to said high-order-shift signal and to said low signal.
Claim 38
Dependent Claim
97 words
Means for generating a compressed index from a sorted sequence of uncompressed keys in an accessible store, comprising means for comparing each of said uncompressed keys with its prior key in the sorted sequence to generate an unequal signal at a highest-order unequal byte position, means for storing only one key byte into each compressed key in response to said comparing means, said one key byte being fetched from each uncompressed key at its byte position for which said comparing means generates the unequal signal, whereby every compressed key in said compressed index has a single key-byte.
Claim 39
Dependent Claim
97 words
Means for generating a compressed index from a sorted sequence of uncompressed keys in an accessible store, comprising means for comparing each of said uncompressed keys with its prior key in the sorted sequence to generate an unequal signal at a highest-order unequal byte position, means for storing only one key byte into each compressed key in response to said comparing means, said one key byte being fetched from each uncompressed key at its byte position for which said comparing means generates the unequal signal, whereby every compressed key in said compressed index has a single key-byte.
Claim 40
Dependent Claim
152 words
Means for generating a compressed index from a sorted sequence of uncompressed keys, comprising means for accessing said uncompressed keys in their sorted sequence, means for comparing like-ordered bytes in each pair of uncompressed keys provided by said accessing means beginning with the highest-ordered bytes of each pair; each uncompressed key in said sequence, except a first and last, being a second uncompressed key in one pair of uncompressed keys and a first uncompressed key in the next pair of uncompressed keys, means for generating an inequality signal indicating inequality between bytes compared by said comparing means, and means for storing the highest-order byte of the first uncompressed key, and for storing only one key byte into said compressed index from each other uncompressed key provided by said accessing means, the one key byte being at the byte position in the uncompressed key indicated by said inequality signal from said comparing means.
Claim 41
Dependent Claim
152 words
Means for generating a compressed index from a sorted sequence of uncompressed keys, comprising means for accessing said uncompressed keys in their sorted sequence, means for comparing like-ordered bytes in each pair of uncompressed keys provided by said accessing means beginning with the highest-ordered bytes of each pair; each uncompressed key in said sequence, except a first and last, being a second uncompressed key in one pair of uncompressed keys and a first uncompressed key in the next pair of uncompressed keys, means for generating an inequality signal indicating inequality between bytes compared by said comparing means, and means for storing the highest-order byte of the first uncompressed key, and for storing only one key byte into said compressed index from each other uncompressed key provided by said accessing means, the one key byte being at the byte position in the uncompressed key indicated by said inequality signal from said comparing means.
Claim 42
Dependent Claim
80 words
Means for generating a compressed index as defined in claim 34, further comprising means for generating a position signal for each compressed key, said generating means being actuatable by the inequality signal to indicate the position of said one key byte in its uncompressed key, and means for storing said position signal with said one key byte in said compressed index in response to actuation of said generating means, whereby each compressed key in said index has a fixed length.
Claim 43
Dependent Claim
55 words
Means for generating a compressed index as defined in claim 36 in which each uncompressed key has an associated pointer for addressing a data location represented by a corresponding one of said uncompressed keys, further comprising, means for transferring the pointer for each uncompressed key into association with a corresponding compressed key in said index.
Claim 44
Dependent Claim
133 words
Means for searching for a search argument in a compressed index in which each compressed key has only a single key byte and has a position indication for said byte in relation to a corresponding uncompressed key, comprising, means for reading said position indication for each said compressed keys in sequence, meaNs for accessing a byte of said search argument with said position indication, means for comparing said byte of said search argument with the single key byte of said compressed key, means for generating a signal when said key byte and search argument byte are equal, and means for storing a representation of a last of said compressed keys in said index for which said generating means provides said signal, whereby said representation can indicate any correct compressed key in said index.
Claim 45
Dependent Claim
133 words
Means for searching for a search argument in a compressed index in which each compressed key has only a single key byte and has a position indication for said byte in relation to a corresponding uncompressed key, comprising, means for reading said position indication for each said compressed keys in sequence, meaNs for accessing a byte of said search argument with said position indication, means for comparing said byte of said search argument with the single key byte of said compressed key, means for generating a signal when said key byte and search argument byte are equal, and means for storing a representation of a last of said compressed keys in said index for which said generating means provides said signal, whereby said representation can indicate any correct compressed key in said index.
Claim 46
Dependent Claim
69 words
Means for searching for a search argument as defined in claim 38, in which said compressed index includes a pointer for each compressed key to address the location of data represented by each key, comprising means for registering the pointer with the compressed key having a representation stored by said storing means, whereby any pointer acted upon by said registering means represents a possible correct key in said index.
Claim 47
Dependent Claim
122 words
Means for searching for a search argument in a compressed index, in which each compressed key has only a single key byte and has a position indication for said byte in relation to its uncompressed key, comprising, means for reading said position indication and the single key byte with each said compressed key in sequence, means for accessing a byte of said search argument with said position indication, means for comparing said byte of said search argument with the single key byte of said compressed key, means for signalling a signal when said comparing means indicates a special relationship between said bytes, and means for registering in a storage area a bit representation for any special relationship signalled by said signalling means.
Claim 48
Dependent Claim
122 words
Means for searching for a search argument in a compressed index, in which each compressed key has only a single key byte and has a position indication for said byte in relation to its uncompressed key, comprising, means for reading said position indication and the single key byte with each said compressed key in sequence, means for accessing a byte of said search argument with said position indication, means for comparing said byte of said search argument with the single key byte of said compressed key, means for signalling a signal when said comparing means indicates a special relationship between said bytes, and means for registering in a storage area a bit representation for any special relationship signalled by said signalling means.
Claim 49
Dependent Claim
58 words
Means for searching for a search argument as defined in claim 40, comprising said registering means also storing the position indication for any compressed key for which a certain type of said special representation has been signalled by said signalling means, whereby said position indication may be significant to subsequent searching for said search argument in said index.
Claim 50
Dependent Claim
56 words
Means for searching for a search argument as defined in claim 40, in which said compressed index includes a pointer for each compressed key to address the location of data represented by each key, comprising means for storing the pointer with a last compressed key in said index for which said signal is an equal signal.
Claim 51
Dependent Claim
47 words
Means for searching for a search argument as defined in claim 40 in which said registering means also includes, means for registering a significance indication in response to said equal signal, whereby said significance indication is significant to further searching for said search argument in said index.
Claim 52
Dependent Claim
74 words
Means for searching for a search argument as defined in claim 40, comprising said signalling means providing a high or low signal as said signal in response to said compressed key having a key byte respectively greater than or less than said argument byte, and said registering means storing a position indication for a significant compressed key providing said high signal for an ascending index, or providing said low signal for a descending index.
Claim 53
Dependent Claim
46 words
Means for searching for a search argument as defined in claim 43, comprising means for setting an unequal indication to a nonsignificant state in response to said equal signal, whereby said nonsignificant state may be used in further searching for said search argument in said index.
Claim 54
Dependent Claim
66 words
Means for searching for a search argument as defined in claim 40, comprising said registering means storing an equal-significance indicator and an unequal-significance indicator for determining the significance of one or more subsequent compressed keys while continuing to search in said index for said search argument, and means for controlling one or both of said significance indicators in response to said signal from said signalling means.
Claim 55
Dependent Claim
27 words
Means for searcHing for a search argument as defined in claim 46 comprising, means for setting each of said indicators to indicate nonsignificance prior to a search.
Claim 56
Dependent Claim
57 words
Means for searching as defined in claim 47, comprising said signalling means also providing a high or low signal in response to said comparing means having the key byte respectively greater than or less than the argument byte, and means for controlling one or both of said significance indicators in response to said high or low signal.
Claim 57
Dependent Claim
55 words
Means for searching as defined in claim 47, said compressed index having an ascending-collating sequence, for which said signalling means also provides a high signal in response to said indicating means having the key byte greater than the argument byte, and means for controlling one of said significance indicators in response to said high signal.
Claim 58
Dependent Claim
49 words
Means for searching an ascending-sequenced compressed index for a search argument as defined in claim 49, in which said controlling means includes means for resetting both of said significance indicators in response to a low signal indicating said key byte is lower than said byte of said search argument.
Claim 59
Dependent Claim
55 words
Means for searching as defined in claim 47, said compressed index having a descending-collating sequence, for which said signalling means also provides a low signal in response to said comparing means having the key byte less than the argument byte, and means for controlling one of said significance indicators in response to said low signal.
Claim 60
Dependent Claim
49 words
Means for searching a descending-sequenced compressed index for a search argument as defined in claim 51, in which said controlling means includes means for resetting both of said significance indicators in response to a high signal indicating said key byte is greater than said byte of said search argument.
Claim 61
Dependent Claim
139 words
Means for searching for a search argument as defined in claim 40, comprising said registering means including an equal indicator, and an unequal indicator, means for resetting the equal indicator to a nonsignificant state in response to said signalling means indicating one type of special relationship, means for resetting the unequal indicator when no position indication in any searched compressed key is currently significant in response to said signalling means indicating a second type of special relationship, means for setting the equal indicator to a significant state in response to said signalling means indicating a third special relationship, and means for setting the unequal indicator to a significant state in response to said signalling means indicating a fourth special relationship, whereby the states of said indicators are used for further searching for a search argument in said compressed index.
Claim 62
Dependent Claim
95 words
Means for searching as defined in claim 53 within an ascending-collated index, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being reset, to a nonsignificant state, comprising said signalling means providing a low signal that indicates the key byte from said reading means for said next compressed key is less than a corresponding byte of the search argument, whereby the nonsignificant state of said unequal indicator is continued after said low signal from said signalling means.
Claim 63
Dependent Claim
116 words
Means for searching as defined in claim 53, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being reset to a nonsignificant state, comprising said signalling means providing an equal signal that indicates the key byte from said reading means for said next compressed key is equal to a corresponding byte of the search argument, said setting means for the equal indicator being actuated to set it to a significant state in response to said equal signal, and means for continuing thE nonsignificant state of said unequal indicator in response to said equal signal from said signalling means.
Claim 64
Dependent Claim
23 words
Means for searching as defined in claim 55, comprising means for registering a pointer associated with the compressed key providing said equal signal.
Claim 65
Dependent Claim
149 words
Means for searching as defined in claim 53 within an ascending-collated index, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being reset to a nonsignificant state, comprising said signalling means providing a high signal that indicates the key byte from said reading means for said next compressed key is greater than a corresponding byte of the search argument, means for continuing the state of said equal indicator in response to said high signal, said setting means for the unequal indicator being actuated to set it to a significant state in response to said high signal, and said registering means being actuated to register the position indication of said next compressed key in response to said high signal, for use in subsequent searching of said compressed index for said search argument.
Claim 66
Dependent Claim
96 words
Means for searching for a search argument as defined in claim 53 within an ascending-collated index, during which the equal indicator is set or reset, comprising said setting means for the unequal indicator being actuated to set it to a significant state in response to a current key byte being greater than a corresponding byte of said search argument, said registering means being actuated to register the position indication of the current compressed key in response to said setting of said unequal indicator, and said reading means providing a next compressed key in the compressed index.
Claim 67
Dependent Claim
159 words
Means for searching as defined in claim 58, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being set to a significant state, comprising said signalling means providing a low signal that indicates the key byte from said reading means for said next compressed index is less than a corresponding byte of said search argument, means for also comparing the position indication provided by said reading means from said next compressed key with the position indication last registered by said registering means, said comparing means generating a left shift signal when the position indication of said next compressed key has a higher order than said last registered position indication, and said resetting means for the equal indicator and for the unequal indicator being actuated to reset said indicators to nonsignificant states in response to said left-shift signal and said low signal.
Claim 68
Dependent Claim
181 words
Means for searching as defined in claim 58, and upon said reading means providing a next compressed key, the state of equal indicator being set or reset, and the state of the unequal indicator being set to a significant state, comprising said signalling means providing a high signal that indicates the key byte provided by said reading means for said next compressed index is greater than a corresponding byte of said search argument, means for also comparing the position indication provided by said reading means from said next compressed key with the position indication last registered by said registering means, said also comparing means generating a left-shift signal when the position indication of said next compressed key has a higher order than said last registered position indication, said setting means for the unequal indicator being actuated to set it to a significant state in response to said left-shift signal and to said high signal, and said registering means being actuated to register the position indication of said next compressed key in response to said left-shift signal and to said high signal.
Claim 69
Dependent Claim
92 words
Means for searching as defined in claim 53 within a descending-collated index, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being reset to a nonsignificant state, comprising said signalling means providing a high signal that indicates the key byte provided by said reading means from said next compressed key is greater than a corresponding byte of the search argument, whereby the states of said indicators is continued in response to said high signal.
Claim 70
Dependent Claim
156 words
Means for searching as defined in claim 53 within a descending-collated index, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being reset to a nonsignificant state, comprising said signalling means providing a low signal that indicates the key byte provided by said reading means from said next compressed key is less than a corresponding byte of the search argument, said setting means for the unequal indicator being actuated to set it to a significant state in response to said low signal, and said registering means being actuated to register the position indication of said next compressed key in response to said low signal, whereby the state of said equal indicator is continued after said next compressed key with the existing states of said indicators being used in subsequent searching of said compressed index for said search argument.
Claim 71
Dependent Claim
97 words
Means for searching for a search argument as defined in claim 53 within a descending-collated index, during which the equal indicator is set or reset, comprising said setting means for the unequal indicator being actuated to set it to a significant state in response to a current key byte from said reading means being less than a corresponding byte of said search argument, said registering means being actuated to register the position indication of the current compressed key in response to said setting means, and said reading means providing a next compressed key in the compressed index.
Claim 72
Dependent Claim
157 words
Means for searching as defined in claim 63, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being set to a significant state, comprising said signalling means providing a high signal that indicates the key from said reading means for said next compressed index is greater than a corresponding byte of said search argument, means for also comparing the position indication provided by said reading means for said next compressed key with the position indication last registered by said registering means, said comparing means generating a left-shift signal when the position indication of said next compressed key has a higher order than said last registered position indication, and said resetting means for the equal indicator and for the unequal indicator being actuated to set them to a nonsignificant state in response to said left-shift signal and said high signal.
Claim 73
Dependent Claim
179 words
Means for searching as defined in claim 58, and upon said reading means providing a next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being set to a significant state, comprising, said signalling means providing an equal signal that indicates the key byte provided by said reading means for said next compressed index is equal to a corresponding byte of said search argument, means for also comparing a position indication provided by said reading means from the next compressed key with the position indication last registered by said registering means, said also comparing means generating a left-shift signal when the position indication of said next compressed key has a higher order than the last registered position indication, said resetting means for the unequal indicator being actuated to a nonsignificant state in response to said left-shift signal and to said high signal, and means for storing a pointer provided by said reading means for said next compressed key in response to said left-shift signal and to said equal signal.
Claim 74
Dependent Claim
163 words
Means for searching as defined in claim 63, and upon said reading means providing the next compressed key, the state of the equal indicator being set or reset, and the state of the unequal indicator being set to a significant state, comprising said signalling means providing a low signal that indicates the key byte provided by said reading means from said next compressed index is less than a corresponding byte of said search argument, means for also comparing the position indication provided by said reading means for the next compressed key with the position indication last registered by said registering means, said comparing means generating a left-shift signal when the position indication of said next compressed key has a higher order than the last registered position indication, and said registering means being actuated to register the position indication of said next compressed key in response to said left-shift signal and to said low signal, whereby the setting of said unequal indicator is continued.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-08-30 | 1975-03-01 | 1975-08-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-08-30 | 1979-03-01 | 1979-08-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-08-30 | 1983-03-01 | 1983-08-31 | $7700.00 | Window Closed / Lapsed |