Associative database model for electronic-based informational assemblies

• US 6,356,897 B1
• Filed: 07/07/2000
• Issued: 03/12/2002
• Est. Priority Date: 06/17/1998
• Status: Expired due to Term

• Current Assignee: Mark David Gusack
• Original Assignee: Mark David Gusack
• Inventors: Gusack, Mark David
• Primary Examiner(s): MIZRAHI, DIANE D
• Application Number:
  US09/612,115
• Time in Patent Office: 613 Days
• Field of Search: 707/2, 707/3, 707/4, 707/10, 707/101, 707/102, 707/103, 707/104, 707/201, 717/2
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99937 Sorting
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99952 Coherency, e.g. same view to multiple users

Abstract

An indexing system and linking method for an assembly of electronic-based information stored in and ordered by a plurality of records uniquely identified over relational data tables making up a data set wherein each table is assigned a unique domain of unique alphanumeric indicia for assignment and storage in the records. The records are ordered by the alphanumeric indicia whereby each data table acts as its own primary key. The records are bi-directionally linked to each other via separate, central linking table indexes wherein each index record is structured with linking fields for storing sets of alphanumeric indicia belonging to records in the data set. Each record is further structured to include an internal set of unique indicum for each data field whereby the combination of the record indicum and the unique field indicum identify each record-field over the relational data tables making up the data set such that each record field may be linked to other record-fields or records via the separate, central linking table indexes. Each central linking table index is further generalized to provide multiple arrays of linking indicia in indexing fields such that records from the data tables may be linked together as a data cluster. The linking values stored in the central linking table indexes may be predefined to automatically structure and link unspecified data, and changes in the data may alter the linking structure to provide further capabilities.

Claims

1. A computer implemented method of linking information comprising the steps of:

forming at least one first table having at least one field formed thereon for storing data therein;

assigning at least one indicum to each of said at least one fields formed on said at least one first table;

forming at least one central linking table having at least one linking field formed thereon; and

storing said at least one indicum in said at least one linking field in said at least one central linking table such that a link is formed between each of said at least one fields formed on each of said at least one first tables.

2. The method of linking information as recited in claim 1, wherein said at least one indicum is an alphanumeric indicum.

3. The method of linking information as recited in claim 1, wherein said at least one indicum is stored in at least one second field formed on said at least one first table.

4. The method of linking information as recited in claim 1, further comprising the steps of:

forming at least one second table having at least one field formed thereon for storing data therein;

assigning at least one indicum to each of said at least one fields formed on said at least one second table; and

storing said at least one indicum for each of said fields of each of said first table and said second table in said at least one linking field in said at least one central linking table such that a link is formed between each of said at least one fields formed on each of said at least one first table and said at least one second table.

5. The method of linking information as recited in claim 1, further comprising the step of:

inserting at least one first record in said at least one field of said at least one first table.

6. The method of linking information as recited in claim 1, wherein said at least one first table is formed on an electronic-based medium.

7. The method of linking information as recited in claim 1, wherein said at least one first table includes a first linking field formed thereon for storing said at least one indicum therein.

8. The method of linking information as recited in claim 1, further comprising the steps of:

locating said at least one first table;

locating every at least one field in said at least one first table wherein said at least one field contains said at least one predetermined indicum; and

providing a means for displaying a set of located at least one fields in said at least one first table.

9. The method of linking information as recited in claim 1, further comprising the step of:

providing a means for determining if said indicum has been assigned prior to the assigning step.

10. The method of linking information as recited in claim 1, further comprising the step of:

storing a plurality of indicum assigned to said at least one first table in at least one first dataset.

11. The method of linking information as recited in claim 1 wherein said at least one linking field in said linking table may store a plurality of said indicum as an ordered list such that said ordered list links said linking fields into a data cluster.