System and Method for Creating and Using Computer Databases Having Schema Integrated Into Data Structure
Abstract
A symmetric objects database contains a plurality of data cells. Each data cell has a plurality of data fields which are the same or similar for each of the data cells. The data fields include an identifier field, name field, value field, signature field, classes field, children field, versions field, user ID field, date field, and control flag field. A first data cell is related or linked to a second data cell which is higher in database hierarchy than the first data cell. The linking is done through the classes field within the first data cell which contains the identifier of the second data cell. A third data cell is related or linked to a fourth data cell which is lower in database hierarchy than the second data cell. The linking is accomplished through the children field which contains the identifier of the fourth data cell. A versions field keeps track of historical changes to the database. The later version of a data cell links to the identifier of an earlier version of the data cell. The data fields within each data cell provide for a schema which is integrated into the data structure.
Claims
exact text as granted — not AI-modified1 - 69 . (canceled)
70 . A computer-implemented method of providing a database, comprising:
providing a plurality of linkable data cells having a plurality of data fields, the data fields including a classes field, a children field, and an identifier field containing a unique value for identifying the linkable data cell determined by hashing values of other data fields in the linkable data cell; relating a first linkable data cell to a second linkable data cell through the classes field, wherein the second linkable data cell is higher in database hierarchy than the first linkable data cell; and relating a third linkable data cell to a fourth linkable data cell through the children field, wherein the fourth linkable data cell is lower in the database hierarchy than the third linkable data cell.
71 . The computer-implemented method of claim 70 , wherein the classes field in the first linkable data cell contains the identifier of the second linkable data cell.
72 . The computer-implemented method of claim 70 , wherein the children field in the third linkable data cell contains the identifier of the fourth linkable data cell.
73 . The computer implemented method of claim 70 , wherein the data fields further includes a value field.
74 . The computer implemented method of claim 73 , wherein the data fields further includes a signature field, a user ID field, a date field, and a control flag field.
75 . A computer-implemented method of providing a database, comprising:
providing a plurality of linkable data cells having a plurality of data fields including an identifier field having a unique value for identifying the linkable data cell determined by hashing a value from another data field in the linkable data cell; and relating a first linkable data cell of the plurality of linkable data cells to a second linkable data cell of the plurality of linkable data cells using one of the plurality of data fields.
76 . The computer-implemented method of claim 75 , further including relating the first linkable data cell to the second linkable data cell which is higher in database hierarchy using a first linking data field.
77 . The computer-implemented method of claim 76 , wherein the first linking data field is a classes field.
78 . The computer-implemented method of claim 77 , wherein the classes field in the first linkable data cell contains an identifier of the second linkable data cell.
79 . The computer-implemented method of claim 76 , further including relating a third linkable data cell to a fourth linkable data cell which is lower in the database hierarchy using a second linking data field.
80 . The computer-implemented method of claim 79 , wherein the second linking data field is a children field.
81 . The computer-implemented method of claim 80 , wherein the children field in the third linkable data cell contains an identifier of the fourth linkable data cell.
82 . The computer-implemented method of claim 75 , wherein the data fields further include a value field.
83 . The computer-implemented method of claim 75 , wherein the data fields further include a signature field, a user ID field, a date field, and a control flag field.
84 . A computer-implemented method of providing a computer database, comprising:
providing a plurality of linkable data cells having a plurality of data fields including an identifier field having a unique value for identifying the linkable data cell determined by hashing a value from another data field in the linkable data cell; and relating the linkable data cells using values in the data fields.
85 . The computer-implemented method of claim 84 , wherein the linkable data cells are organized in different levels of database hierarchy.
86 . The computer-implemented method of claim 84 , wherein a linking field in a first linkable data cell relates to a second linkable data cell which is higher in the database hierarchy than the first linkable data cell.
87 . The computer-implemented method of claim 86 , wherein the linking field in the first linkable data cell contains an identifier of the second linkable data cell.
88 . The computer-implemented method of claim 84 , wherein a linking field in a first linkable data cell relates to a second linkable data cell which is lower in the database hierarchy than the first linkable data cell.
89 . A computer program product usable with a programmable computer processor having a computer readable program code embodied therein, comprising:
computer readable program code which provides a plurality of linkable data cells having a plurality of data fields including an identifier field having a unique value for identifying the linkable data cell determined by hashing a value from another data field in the linkable data cell; and computer readable program code which relates a first linkable data cell of the plurality of linkable data cells to a second linkable data cell of the plurality of linkable data cells using one of the plurality of data fields.
90 . The computer program product of claim 89 , further including:
computer readable program code which relates the first linkable data cell to the second linkable data cell which is higher in database hierarchy using a first linking data field; and computer readable program code which relates a third linkable data cell to a fourth linkable data cell which is lower in the database hierarchy using a second linking data field.
91 . The computer program product of claim 90 , wherein the first linking data field is a classes field.
92 . The computer program product of claim 91 , wherein the classes field in the first linkable data cell contains an identifier of the second linkable data cell.
93 . The computer program product of claim 90 , wherein the second linking data field is a children field.
94 . The computer program product of claim 93 , wherein the children field in the third linkable data cell contains an identifier of the fourth linkable data cell.
95 . A computer system for providing a database, comprising:
means for providing a plurality of linkable data cells having a plurality of data fields including an identifier field having a unique value for identifying the linkable data cell determined by hashing a value from another data field in the linkable data cell; and means for relating a first linkable data cell of the plurality of linkable data cells to a second linkable data cell of the plurality of linkable data cells using one of the plurality of data fields.
96 . The computer system of claim 95 , further including:
means for relating the first linkable data cell to the second linkable data cell which is higher in database hierarchy using a first linking data field; and means for relating a third linkable data cell to a fourth linkable data cell which is lower in the database hierarchy using a second linking data field.
97 . The computer system of claim 96 , wherein the first linking data field is a classes field.
98 . The computer system of claim 97 , wherein the classes field in the first linkable data cell contains an identifier of the second linkable data cell.
99 . The computer system of claim 96 , wherein the second linking data field is a children field.
100 . The computer system of claim 99 , wherein the children field in the third linkable data cell contains an identifier of the fourth linkable data cell.
101 . A computer-implemented method of providing a database, comprising:
providing a plurality of linkable data cells having a plurality of data fields which are identical for each linkable data cell; relating a first linkable data cell to a second linkable data cell which is higher in database hierarchy using a first linking data field; and relating a third linkable data cell to a fourth linkable data cell which is lower in the database hierarchy using a second linking data field.
102 . The computer-implemented method of claim 101 , wherein the data fields include an identifier field having a unique value for identifying the linkable data cell determined by hashing a value from another data field in the linkable data cell.
103 . The computer-implemented method of claim 101 , wherein the first linking data field is a classes field which contains the identifier of the second linkable data cell.
104 . The computer-implemented method of claim 101 , wherein the second linking data field is a children field which contains the identifier of the fourth linkable data cell.Join the waitlist — get patent alerts
Track US2007112808A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.