Method and apparatus utilizing bond identifiers executed upon accessing of an endo-dynamic information node (EDIN)

• US 5,684,985 A
• Filed: 12/15/1994
• Issued: 11/04/1997
• Est. Priority Date: 12/15/1994
• Status: Expired due to Term

• Current Assignee: UFIL Unified Data Technologies Limited
• Original Assignee: UFIL Unified Data Technologies Limited
• Inventors: Ahmadi, Babak
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Min, Donald
• Application Number:
  US08/356,878
• Time in Patent Office: 1,055 Days
• Field of Search: 395/600, 395/611, 395/613, 395/614
• US Class Current: 1/1
• CPC Class Codes: G06F 16/958 Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• 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/99944 Object-oriented database structure

Abstract

A computer-implemented method and apparatus for information organization, wherein atomic information can be both static and dynamic, but the compound information (e.g., associations, groupings, sets, etc.) of such atoms always remain dynamic. Unless otherwise directed, a compound information entity is always dynamically determined and generated. This determination is based on the processing of a defined condition, wherein all atoms qualifying the condition are included in the compound. This dynamic determination eliminates the need to "update" the compound, when atoms and/or compounds common to two or more compounds are changed. Further, each information compound can be dynamically generated based on an existing definition for that compound.

Claims

1. A method for dynamically organizing and processing data in a computer having a memory and a data storage device coupled thereto, the method comprising the steps of:

(a) generating an information structure and relationship in the memory of the computer as one or more Endo-Dynamic Sets (EDS), the EDS comprising a list of one or more Endo-Dynamic Information Nodes (EDINs), the EDINs each representing an atomic component of data, and the EDINs each comprising a subject identifier, an attribute identifier, and a bond identifier, wherein the bond identifier defines a relationship between the subject and attribute identifiers;

(b) associating each bond identifier of an EDIN with an organizational structure of data stored in the memory of the computer; and

(c) traversing the organizational structure of data in the memory of the computer through the EDINs.

2. The method of claim 1, wherein each of the Endo-Dynamic Information Nodes (EDINs) comprise an Endo-Dynamic Information Statement (EDIS).

3. A method for dynamically organizing and processing data in a computer having a memory and a data storage device coupled thereto, the method comprising the steps of:

(a) generating an information structure and relationship in the memory of the computer as one or more Endo-Dynamic Sets (EDS), the EDS comprising a list of one or more Endo-Dynamic Information Nodes (EDINs), the EDINs each representing an atomic component of data, and the EDINs each comprising a subject identifier, an attribute identifier, and a bond identifier, wherein the bond identifier defines a relationship between the subject and attribute identifiers;

(b) associating each bond identifier of an EDIN with a body of executable code stored in the memory of the computer; and

(c) performing the executable code using the computer as a required action for the bond identifier when the EDIN is accessed in the computer.

4. The method of claim 3, wherein one or more of the Endo-Dynamic Information Nodes (EDINs) comprise an Endo-Dynamic Command Line (EDCL).

5. The method of claim 4, wherein the Endo-Dynamic Command Lines (EDCLs) comprise a program.

6. The method of claim 4, wherein one or more Endo-Dynamic Command Lines (EDCLs) are referenced by an Endo-Dynamic Operator (EDO).

7. The method of claim 6, further comprising the steps of generating a unique Universal Entity Identifier (UEI), assigning the unique UEI to the Endo-Dynamic Operator (EDO), and referencing the unique UEI to invoke the EDO.

8. The method of claim 7, further comprising the step of distinguishing between native and non-native Endo-Dynamic Operators (EDOs), wherein native EDOs reference executable code and non-native EDOs reference one or more Endo-Dynamic Command Lines (EDCLs).

9. The method of claim 6, wherein the Endo-Dynamic Operator (EDO) comprises an instruction.

10. The method of claim 3, wherein the bond identifier comprises an Endo-Dynamic Operator (EDO).

11. The method of claim 3, wherein Universal Entity Identifiers (UEIs) stored in the memory of the computer uniquely identify each Endo-Dynamic Set (EDS).

12. The method of claim 11, wherein each Universal Entity Identifier (UEI) comprises:

a Site Owner Identifier (SOI) field, as assigned from a unique Endo Dynamic Processor, to uniquely identify the originating site for the data; and

a Site Entity Identifier (SEI) field to uniquely identify each entity at a given site, the SEI being incrementally generated and dynamically assigned to the entity, such that the SEI is never used by more than one entity.

13. The method of claim 11, wherein each Universal Entity Identifier (UEI) is a unique identifier for data in one or more different logical data organizations.

14. The method of claim 11, wherein all data is stored and accessed via a uniquely assigned Universal Entity Identifier (UEI).

15. The method of claim 3, wherein the Endo-Dynamic Information Node (EDIN) further contains a sequence identifier to provide for ordering among two or more EDINs existing in the same Endo-Dynamic Set (EDS).

16. The method of claim 3, further comprising the step of dynamically generating the Endo-Dynamic Information Node (EDIN) in the computer.

17. The method of claim 3, wherein a Set Definition Equation (SDE) defines one or more conditions that qualify an Endo-Dynamic Information Node (EDIN) to be a member of an Endo-Dynamic Information Statement (EDIS).

18. The method of claim 17, further comprising the step of processing the Set Definition Equation (SDE) in the computer to produce an Endo-Dynamic Information Statement (EDIS) that contains qualifying Endo-Dynamic Information Nodes (EDINs).

19. The method of claim 3, wherein a Set Definition Equation (SDE) defines one or more conditions that qualify an Endo-Dynamic Information Node (EDIN) to be a member of an Endo-Dynamic Command Set (EDCS).

20. The method of claim 19, further comprising the step of processing the Set Definition Equation (SDE) in the computer to produce an Endo-Dynamic Command Set (EDCS) that contains qualifying Endo-Dynamic Information Nodes (EDINs).

21. The method of claim 3, further comprising an Endo-Dynamic Editor (EDE) performed by the computer, and the method further comprises the steps of accepting data from a user into the computer and converting the data into Endo-Dynamic Information Nodes (EDINs) using the EDE.

22. The method of claim 3, further comprising the steps of automatically generating new Endo-Dynamic Information Nodes (EDINs) in the computer and storing the EDINs in the Endo-Dynamic Set (EDS).

23. The method of claim 22, further comprising the steps of generating the new Endo-Dynamic Information Nodes (EDINs) by first generating a new Set Definition Equation (SDE) and then processing the new SDE to produce a resultant Endo-Dynamic Set (EDS).

24. The method of claim 3, further comprising an Endo-Dynamic Processor (EDP) executed by the computer, the method further comprising the steps of retrieving, interpreting and executing Endo-Dynamic Command Lines (EDCL), wherein the order of the EDCLs embodies a required active sequence.

25. The method of claim 24, wherein the Endo-Dynamic Information Nodes (EDINs) are used to organize all data stored on storage media maintained by the EDP.

26. The method of claim 25, wherein the InfoBase is a database system, and the Expandable Table Sets (ETS'"'"'s) are used to store physical data values.

27. The method of claim 3, further comprising the steps of combining two or more Endo-Dynamic Sets (EDS'"'"'s) in the memory of the computer to form a Module.

28. The method of claim 27, wherein Universal Entity Identifiers (UEIs) stored in the memory of the computer uniquely identify each Module.

29. The method of claim 27, further comprising the step of combining two or more Modules in the memory of the computer to form an information Base (InfoBase).

30. The method of claim 29, wherein Universal Entity Identifiers (UEIs) stored in the memory of the computer uniquely identify each InfoBase.

31. The method of claim 29, further comprising the step of combining InfoBases to create new data.

32. The method of claim 29, wherein the InfoBases further comprise one or more InfoFrames.

33. The method of claim 27, further comprising the steps of defining and using Set Definition Equations (SDEs) to produce database queries, the SDEs being constructed and processed to produce a set of qualifying members.

34. The method of claim 3, further comprising an Endo-Dynamic Processor (EDP) performed by the computer, wherein Endo-Dynamic information Nodes (EDINs) comprise executable commands of a program to be performed by the EDP.

35. The method of claim 34, further comprising the step of dynamically modifying the Endo-Dynamic Information Nodes (EDINs) during processing.

36. The method of claim 3, wherein Endo-Dynamic information Nodes (EDINs) define data structures.

37. The method of claim 36, further comprising the steps of creating, deleting and modifying Endo-Dynamic Information Nodes (EDINs).

38. The method of claim 3, wherein the subject identifier is a topic and the attribute identifier is information pertaining to that topic.

39. The method of claim 3, wherein the Endo-Dynamic Information Nodes (EDINs) are organized into a hierarchy of EDINs, and further wherein descendant information for the hierarchy of EDINs is located in an Endo-Dynamic Set (EDS).

40. The method of claim 3, wherein the Endo-Dynamic Information Nodes (EDINs) are organized into a hierarchy of EDINs, and further wherein ancestor information for the hierarchy of EDINs is located in an Endo-Dynamic Set (EDS).

41. The method of claim 3, wherein the Endo-Dynamic Information Nodes (EDINs) are organized into a hierarchy of EDINs, and further wherein sibling information for the hierarchy of EDINs is located in an Endo-Dynamic Set (EDS).

42. An apparatus for dynamically organizing and processing data, comprising:

(a) a computer having a memory and a data storage device coupled thereto;

(b) means, performed by the computer, for generating an information structure and relationship in the memory of the computer as one or more Endo-Dynamic Sets (EDS), the EDS comprising a list of one or more Endo-Dynamic Information Nodes (EDINs), the EDINs each representing an atomic component of data, and the EDINs each comprising a subject identifier, an attribute identifier, and a bond identifier, wherein the bond identifier defines a relationship between the subject and attribute identifiers,

(c) means, performed by the computer, for associating each bond identifier of an EDIN with a body of executable code stored in the memory of the computer; and

(d) means, performed by the computer, for performing the executable code as a required action for the bond identifier when the EDIN is accessed in the computer.

43. An apparatus for dynamically organizing and processing data, comprising:

(a) a computer having a memory and a data storage device coupled thereto;

(b) means, performed by the computer, for generating an information structure and relationship in the memory of the computer as one or more Endo-Dynamic Sets (EDS), the EDS comprising a list of one or more Endo-Dynamic Information Nodes (EDINs), the EDINs each representing an atomic component of data, and the EDINs each comprising a subject identifier, an attribute identifier, and a bond identifier, wherein the bond identifier defines a relationship between the subject and attribute identifiers;

(b) means, performed by the computer, for associating each bond identifier of an EDIN with an organizational structure of data stored in the memory of the computer; and

(c) means, performed by the computer, for traversing the organizational structure of data in the memory of the computer through the EDINs.