Patent US5991765A successfully refreshed from Google Patents.
US5991765A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for storing and manipulating data in an information handling system
Assignee: Birdstep Technology AS
•
Filing: 1997-05-06
•
Granted: 1999-11-23
•
Expires: 2017-05-06
Abstract
Abstract The present invention is directed to a database and database management system and method designed to store and manipulate any type of data and any combination of data types. The underlying data architecture is uniquely flexible, and thus to the DBMS, the data in the database will appear to be of a type consistent with the access method of the DBMS. Further, the present invention allows a number of simultaneous, different access methods to the same underlying data, delivering the ability to work with complex data within one easily managed system. One of the key aspects of the present invention is the "atomization" of the data. Atomization is the separation of the storage of data content from its definition, as well as from its occurrences or instances in the database. An atom is the most basic element in the database. Data content is stored in content atoms, data definitions are stored in type atoms, and each instance of the same data value/property is represented by instance atoms. When connected, the three different atom types form a molecule. Complex data may be represented in the database by linking together instance atoms from several molecules to form inner relations, and then by further linking together inner relations to form outer relations.
Inventors
- 👤 Olaf Vethe
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 00:55
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/25; G06F16/21; G06F16/211; G06F16/213; G06F16/22; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99941; Y10S707/99942; Y10S707/99943; Y10S707/99944
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
93 words
A memory for storing data for access by a program executing in an information handling system, comprising: a data structure stored in said memory, said data structure including information resident in a database used by the program and comprising: a plurality of content elements, wherein each content element contains a unique data item; a plurality of type elements, wherein each type element stores type data, and wherein each type element includes a unique type handle; and a plurality of instance elements, wherein each instance element links one content element and one type element.
Claim 2
Dependent Claim
93 words
A memory for storing data for access by a program executing in an information handling system, comprising: a data structure stored in said memory, said data structure including information resident in a database used by the program and comprising: a plurality of content elements, wherein each content element contains a unique data item; a plurality of type elements, wherein each type element stores type data, and wherein each type element includes a unique type handle; and a plurality of instance elements, wherein each instance element links one content element and one type element.
Claim 3
Dependent Claim
18 words
A memory according to claim 1, wherein each data item is uniquely stored in only one content element.
Claim 4
Dependent Claim
29 words
A memory according to claim 1, wherein said data structure further comprises one or more inner relations, wherein each inner relation comprises one or more instance elements linked together.
Claim 5
Dependent Claim
33 words
A memory according to claim 3, wherein said data structure further comprises one or more outer relations, wherein each outer relation comprises one or more inner relations linked together by a linking means.
Claim 6
Dependent Claim
31 words
A memory according to claim 4, wherein the linking means comprises a content atom in a first inner relation containing a pointer to an instance atom in a second inner relation.
Claim 7
Dependent Claim
31 words
A memory according to claim 1, wherein said data structure further comprises one or more history links, wherein each history link links a new instance element to an old instance element.
Claim 8
Dependent Claim
25 words
A memory according to claim 1, wherein said data structure further comprises a data dictionary, wherein said type elements are stored in said data dictionary.
Claim 9
Dependent Claim
60 words
A memory according to claim 1, wherein said data structure further comprises a search structure, said search structure comprising: one or more mini-structures, wherein each mini-structure contains one or more content elements linked together; and for each mini-structure, a vector comprising one or more bytes of data, wherein said vector determines which mini-structure to search for a desired content element.
Claim 10
Dependent Claim
95 words
A computer-readable medium for storing data for access by a program executing in an information handling system, comprising: a data structure stored on said computer-readable medium, said data structure including information resident in a database used by the program and comprising: a plurality of content elements, wherein each content element contains a unique data item; a plurality of type elements, wherein each type element stores type data, and wherein each type element includes a unique type handle; and a plurality of instance elements, wherein each instance element links one content element and one type element.
Claim 11
Dependent Claim
95 words
A computer-readable medium for storing data for access by a program executing in an information handling system, comprising: a data structure stored on said computer-readable medium, said data structure including information resident in a database used by the program and comprising: a plurality of content elements, wherein each content element contains a unique data item; a plurality of type elements, wherein each type element stores type data, and wherein each type element includes a unique type handle; and a plurality of instance elements, wherein each instance element links one content element and one type element.
Claim 12
Dependent Claim
19 words
A computer-readable medium according to claim 9, wherein each data item is uniquely stored in only one content element.
Claim 13
Dependent Claim
30 words
A computer-readable medium according to claim 9, wherein said data structure further comprises one or more inner relations, wherein each inner relation comprises one or more instance elements linked together.
Claim 14
Dependent Claim
34 words
A computer-readable medium according to claim 11, wherein said data structure further comprises one or more outer relations, wherein each outer relation comprises one or more inner relations linked together by a linking means.
Claim 15
Dependent Claim
32 words
A computer-readable medium according to claim 12, wherein the linking means comprises a content atom in a first inner relation containing a pointer to an instance atom in a second inner relation.
Claim 16
Dependent Claim
32 words
A computer-readable medium according to claim 9, wherein said data structure further comprises one or more history links, wherein each history link links a new instance element to an old instance element.
Claim 17
Dependent Claim
26 words
A computer-readable medium according to claim 9, wherein said data structure further comprises a data dictionary, wherein said type elements are stored in said data dictionary.
Claim 18
Dependent Claim
61 words
A computer-readable medium according to claim 9, wherein said data structure further comprises a search structure, said search structure comprising: one or more mini-structures, wherein each mini-structure contains one or more content elements linked together; and for each mini-structure, a vector comprising one or more bytes of data, wherein said vector determines which mini-structure to search for a desired content element.
Claim 19
Dependent Claim
112 words
An information handling system, comprising: one or more processors; one or more images of an operating system for controlling the operation of said processors; one or more programs executing in said processors; memory means; and a data structure stored in said memory means, said data structure including information resident in a database used by said programs, and comprising: a plurality of content elements, wherein each content element contains a unique data item; a plurality of type elements, wherein each type element stores type data, and wherein each type element includes a unique type handle; and a plurality of instance elements, wherein each instance element links one content element and one type element.
Claim 20
Dependent Claim
112 words
An information handling system, comprising: one or more processors; one or more images of an operating system for controlling the operation of said processors; one or more programs executing in said processors; memory means; and a data structure stored in said memory means, said data structure including information resident in a database used by said programs, and comprising: a plurality of content elements, wherein each content element contains a unique data item; a plurality of type elements, wherein each type element stores type data, and wherein each type element includes a unique type handle; and a plurality of instance elements, wherein each instance element links one content element and one type element.
Claim 21
Dependent Claim
20 words
An information handling system according to claim 17, wherein each data item is uniquely stored in only one content element.
Claim 22
Dependent Claim
31 words
An information handling system according to claim 17, wherein said data structure further comprises one or more inner relations, wherein each inner relation comprises one or more instance elements linked together.
Claim 23
Dependent Claim
35 words
An information handling system according to claim 19, wherein said data structure further comprises one or more outer relations, wherein each outer relation comprises one or more inner relations linked together by a linking means.
Claim 24
Dependent Claim
33 words
An information handling system according to claim 20, wherein the linking means comprises a content atom in a first inner relation containing a pointer to an instance atom in a second inner relation.
Claim 25
Dependent Claim
33 words
An information handling system according to claim 17, wherein said data structure further comprises one or more history links, wherein each history link links a new instance element to an old instance element.
Claim 26
Dependent Claim
27 words
An information handling system according to claim 17, wherein said data structure further comprises a data dictionary, wherein said type elements are stored in said data dictionary.
Claim 27
Dependent Claim
62 words
An information handling system according to claim 17, wherein said data structure further comprises a search structure, said search structure comprising: one or more mini-structures, wherein each mini-structure contains one or more content elements linked together; and for each mini-structure, a vector comprising one or more bytes of data, wherein said vector determines which mini-structure to search for a desired content element.
Claim 28
Dependent Claim
73 words
An information handling system according to claim 17, further comprising means for adding a data item to said data structure, said means for adding comprising: means for receiving the data item; means for creating a new content element containing the data element; means for creating a new instance element linked to the new content element; and means for linking the new content element and an appropriate type element to the new instance element.
Claim 29
Dependent Claim
40 words
An information handling system according to claim 25, further comprising: means for determining if the data item already exists in a content element in the data structure; and means for linking the new instance element to an existing content element.
Claim 30
Dependent Claim
53 words
An information handling system according to claim 17, further comprising means for searching the data structure to find a desired data item, comprising: means for selecting a mini-structure to search based on one or more bytes in the desired data item; and means for searching the mini-structure to find the desired content element.
Claim 31
Dependent Claim
64 words
An information handling system according to claim 17, further comprising means for updating a content element in said data structure, said means for updating comprising: means for creating a new content element; means for creating a new instance element; means for linking the new content element to the new instance element; and means for linking the new instance element to an old instance element.
Claim 32
Dependent Claim
48 words
An information handling system according to claim 17, further comprising means for updating a content element in said data structure, said means for updating comprising: means for changing a data item in the content element; and means for relinking the changed content element to an existing instance element.
References Cited (Backward Citations)
US4657057A
Cited
US5226161A
Cited
US4989132A
Cited
US5381547A
Cited
US5437027A
Cited
US5297279A
Cited
US5040995A
Cited
US5295261A
Cited
US5090865A
Cited
US5426747A
Cited
US5560006A
Cited
US5469562A
Cited
US5801701A
Cited
US5613058A
Cited
US5586326A
Cited
US5557795A
Cited
US5515502A
Cited
US5572673A
Cited
US5561759A
Cited
JPH07200381A
Cited
US5522071A
Cited
US5600838A
Cited
US5535383A
Cited
US5590334A
Cited
JPH0836518A
Cited
US5551024A
Cited
US5583983A
Cited
JPH08272815A
Cited
JPH08328938A
Cited
US5864864A
Cited
US5752028A
Cited
US5864862A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-11-22 | 2003-05-24 | 2003-11-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-11-22 | 2007-05-24 | 2007-11-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-11-22 | 2011-05-24 | 2011-11-23 | $7700.00 | Window Closed / Lapsed |