US4841433A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for accessing data from data attribute tables
Assignee: Nokia Bell Labs
•
Filing: 1986-11-26
•
Granted: 1989-06-20
•
Expires: 2006-11-26
Abstract
Abstract A method and apparatus for accessing data in a data base that provides for a minimum of unused storage while preserving easy expandability. A group of accessing keys are used to identify the attributes data that is being sought in a data base. In accordance with the invention, subkeys are extracted from members of the group of data accessing keys and these subkeys are advantageously rearranged to form derived accessing keys. Subkeys are densely populataed if most values of a subkey are used in most systems. One of the derived accessing keys, derived from densely populated subkeys is used for accessing the tables of data attributes that are therefore advantageously densely populated. Another derived accessing key, derived from sparsely populated subkeys, is used for accessing a sparsely populated head table. Derived keys of intermediate population density are used for accessing tables intermediate between the head tables and the tables of data attributes. The population densities of tables described above characterize a typical system even though the range of each accessing key is selected to provide for more extrmeme systems which have much larger numbers of tables of data attributes and, larger numbers of more densely populated intermediate tables. Advantageously, such an arrangement sharply reduces the amount of storage required to store data in typical systems while retaining the flexibility of permitting different accessing keys to have widely varying numbers of values in different systems.
Inventors
- 👤 Shafik J. Hakim
- 👤 Mark R. Locher
- 👤 Kenneth Y. Nieng
- 👤 Barbara A. Vagnozzi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 21:31
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9017; Y; Y10; Y10S; Y10S707/00; Y10S707/953; Y10S707/954; Y10S707/99931; Y10S707/99933; Y10S707/99941; Y10S707/99944; Y10S707/99945
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
138 words
In a data base system for storing data attributes, said data base system comprising data tables comprising a head table and a plurality of tables of data attributes, each of said tables of data attributes comprising a plurality of slots, and wherein each of said data attributes is identified by a plurality of data accessing keys, a method of accessing data attributes in said plurality of tables of data attributes, comprising the steps of: extracting at least two fixedly selected subkeys from different ones of said plurality of data accessing keys; and deriving a first derived key for accessing one of said tables of said data base by combining data of said extracted subkeys; wherein every slot of each of said tables of attributes corresponds to only one set of values of said plurality of data accessing keys.
Claim 2
Dependent Claim
138 words
In a data base system for storing data attributes, said data base system comprising data tables comprising a head table and a plurality of tables of data attributes, each of said tables of data attributes comprising a plurality of slots, and wherein each of said data attributes is identified by a plurality of data accessing keys, a method of accessing data attributes in said plurality of tables of data attributes, comprising the steps of: extracting at least two fixedly selected subkeys from different ones of said plurality of data accessing keys; and deriving a first derived key for accessing one of said tables of said data base by combining data of said extracted subkeys; wherein every slot of each of said tables of attributes corresponds to only one set of values of said plurality of data accessing keys.
Claim 3
Dependent Claim
50 words
The method of claim 1 further comprising the steps of: extracting at least two additional subkeys from different ones of said plurality of data accessing keys; and deriving a second derived key, for accessing another of said tables of said data base, by combining data of said extracted additional subkeys.
Claim 4
Dependent Claim
44 words
In the data base system of claim 2, further comprising intermediate accessing tables, located via said head table and used for locating said attributes tables, the method of claim 2 wherein said second derived key is used for accessing one of said attributes tables.
Claim 5
Dependent Claim
40 words
The method of claim 3 further comprising the step of: extracting at least two further subkeys from said plurality of data accessing keys; and deriving a third derived key, for accessing said head table, from all of said further subkeys.
Claim 6
Dependent Claim
17 words
The method of claim 1 wherein said deriving step comprises the step of concatenating said extracted subkeys.
Claim 7
Dependent Claim
120 words
A data base system comprising: processor means controlled by a program; and data tables, comprising a head table and a plurality of tables of data attributes, each of said tables of data attributes comprising a plurality of slots, and wherein each of said data attributes is identified by a plurality of data accessing keys; said processor means controlled by said program for extracting at least two fixedly selected subkeys from said plurality of data accessing keys, and for deriving, by combining data of said extracted subkeys, a derived key for accessing one of said data tables; wherein every slot of each of said tables of attributes corresponds to only one set of values of said plurality of data accessing keys.
Claim 8
Dependent Claim
120 words
A data base system comprising: processor means controlled by a program; and data tables, comprising a head table and a plurality of tables of data attributes, each of said tables of data attributes comprising a plurality of slots, and wherein each of said data attributes is identified by a plurality of data accessing keys; said processor means controlled by said program for extracting at least two fixedly selected subkeys from said plurality of data accessing keys, and for deriving, by combining data of said extracted subkeys, a derived key for accessing one of said data tables; wherein every slot of each of said tables of attributes corresponds to only one set of values of said plurality of data accessing keys.
Claim 9
Dependent Claim
51 words
The system of claim 6 wherein said processor means is further controlled by said program for extracting at least two additional subkeys from said group of data accessing keys and deriving from a plurality of said extracted additional subkeys a second derived key for accessing another table of said data tables.
Claim 10
Dependent Claim
66 words
The system of claim 7 wherein said data tables further comprise intermediate accessing tables, located via said head table, used for locating said plurality of attributes tables, and wherein said processor means is further controlled by said program, for accessing one of said intermediate accessing tables using said second derived key and for accessing one of said tables of data attributes using said first derived key.
Claim 11
Dependent Claim
48 words
The system of claim 8 wherein said processor means is further controlled by said program for extracting at least two further subkeys from said plurality of data accessing keys for deriving a third derived key, for accessing said head table, from a plurality of said extracted further subkeys.
Claim 12
Dependent Claim
26 words
The system of claim 6 wherein said processor means is further controlled by said program for deriving said first derived key by concatenating said extracted subkeys.
Claim 13
Dependent Claim
138 words
In a data base system for storing data attributes, said data base system comprising data tables comprising a head table and a plurality of tables of data attributes, each of said tables of data attributes comprising a plurality of slots, and wherein each of said data attributes is identified by a plurality of data accessing keys, a method of accessing data attributes in said plurality of tables of data attributes comprising the step of: extracting at least two fixedly selected densely populated subkeys from different ones of said plurality of data accessing keys; and deriving a first derived key for accessing a table of said data base by combining data of said extracted subkeys; wherein every slot of each of said tables of attributes corresponds to only one set of values of said plurality of data accessing keys.
Claim 14
Dependent Claim
138 words
In a data base system for storing data attributes, said data base system comprising data tables comprising a head table and a plurality of tables of data attributes, each of said tables of data attributes comprising a plurality of slots, and wherein each of said data attributes is identified by a plurality of data accessing keys, a method of accessing data attributes in said plurality of tables of data attributes comprising the step of: extracting at least two fixedly selected densely populated subkeys from different ones of said plurality of data accessing keys; and deriving a first derived key for accessing a table of said data base by combining data of said extracted subkeys; wherein every slot of each of said tables of attributes corresponds to only one set of values of said plurality of data accessing keys.
Claim 15
Dependent Claim
241 words
In a program controlled by telephone switching system comprising data tables, said data tables comprising a head table, a group of intermediate tables and a group of attributes tables, data stored i said attributes tables comprising routing index data and charging index data a method of accessing routing index data and charging index data from a prefix index, a screening index and a destination index comprising the steps of: extracting low order bits from said screening index and said destination index, and concatenating said low order bits to derive at least part of a first derived kay; extracting high order bits from said screening index and said destination index and concatenating said high order bits to derive at least part of a second derived key; extracting at least two bits, not extracted for deriving said first and said second derived key, and concatenate said at lea two bits to derive at least part of a third derived key; accessing said head table, using said second derived key, to locate an indicator of an address of one table of said group of intermediate tables; accessing said one table of said group of intermediate tables using said third derived key to locate an indicator of an address of another table of said groups of intermediate tables and attributes tables; and accessing one table of said group of attributes tables using said first derived key to locate said route index and said charging index.
Claim 16
Dependent Claim
241 words
In a program controlled by telephone switching system comprising data tables, said data tables comprising a head table, a group of intermediate tables and a group of attributes tables, data stored i said attributes tables comprising routing index data and charging index data a method of accessing routing index data and charging index data from a prefix index, a screening index and a destination index comprising the steps of: extracting low order bits from said screening index and said destination index, and concatenating said low order bits to derive at least part of a first derived kay; extracting high order bits from said screening index and said destination index and concatenating said high order bits to derive at least part of a second derived key; extracting at least two bits, not extracted for deriving said first and said second derived key, and concatenate said at lea two bits to derive at least part of a third derived key; accessing said head table, using said second derived key, to locate an indicator of an address of one table of said group of intermediate tables; accessing said one table of said group of intermediate tables using said third derived key to locate an indicator of an address of another table of said groups of intermediate tables and attributes tables; and accessing one table of said group of attributes tables using said first derived key to locate said route index and said charging index.
References Cited (Backward Citations)
US3253264A
Cited
US3366927A
Cited
US4152762A
Cited
US4215402A
Cited
US4433389A
Cited
US4700294A
Cited
US4606002A
Cited
US4577066A
Cited
US4611280A
Cited
US4600812A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-06-19 | 1992-12-19 | 1993-06-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-06-19 | 1996-12-19 | 1997-06-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-06-19 | 2000-12-19 | 2001-06-20 | $7700.00 | Window Closed / Lapsed |