Method and apparatus for binary-oriented set sequencing

• US 7,076,501 B2
• Filed: 12/22/2003
• Issued: 07/11/2006
• Est. Priority Date: 12/15/1994
• Status: Expired due to Fees

• Current Assignee: UFIL Unified Data Technologies Limited
• Original Assignee: UFIL Unified Data Technologies Limited
• Inventors: Ahmadi, Babak
• Primary Examiner(s): Gaffin, Jeffrey
• Assistant Examiner(s): ABEL JALIL, NEVEEN
• Application Number:
  US10/746,028
• Publication Number:
  US 20040139055A1
• Time in Patent Office: 932 Days
• Field of Search: 707/101, 707/102, 707/100
• 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 the 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.

2. A method for dynamically organizing and processing data in a computer system, the method comprising:

(a) generating one or more Endo-Dynamic Sets (EDS), wherein each EDS comprises a list of one or more Endo-Dynamic Information Nodes (EDINs), 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 the attribute identifiers;

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

(c) performing the executable code as a required action for the bond identifier.

3. A method as defined in claim 2, wherein one or more of the Endo-Dynamic Information Nodes (EDINs) comprise an Endo-Dynamic Command Line (EDCL).

4. A method as defined in claim 2, further comprising the step of:

dynamically generating the Endo-Dynamic Information Node (EDIN).

5. A method as defined in claim 2, 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).

6. A method as defined in claim 2, 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).

7. A method as defined in claim 2, further comprising steps of:

automatically generating new Endo-Dynamic Information Nodes (EDINs) and storing the new EDINs in the Endo-Dynamic Set (EDS).

8. A method for dynamically organizing and processing data in a computer having a memory, the method comprising:

(a) generating one or more Endo-Dynamic Sets (EDS) in the memory of the computer, the one or more EDS each comprising a list of one or more Endo-Dynamic Information Nodes (EDINs), 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 the 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 as required action for the bond identifier.

9. A method as defined in claim 8, wherein one or more of the Endo-Dynamic Information Nodes (EDINs) comprise an Endo-Dynamic Command Line (EDCL).

10. A method as defined in claim 9, wherein the Endo-Dynamic Command Lines (EDCLs) comprise a program.

11. A method as defined in claim 9, wherein one or more Endo-Dynamic Command Lines (EDCLs) are referenced by an Endo-Dynamic Operator (EDO).

12. A method as defined in claim 11, further comprising 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.

13. A method as defined in claim 11, wherein the Endo-Dynamic Operator (EDO) comprises an instruction.

14. A method as defined in claim 12, further comprising a 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).

15. A method as defined in claim 8, wherein the bond identifier comprises an Endo-Dynamic Operator (EDO).

16. A method as defined in claim 8, wherein Universal Entity Identifiers (UEIs) stored in the memory of the computer uniquely identify each Endo-Dynamic Set (EDS).

17. A method as defined in claim 16, 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.

18. A method as defined in claim 16, wherein each Universal Entity Identifier (UEI) is a unique identifier for data in one or more different logical data organizations.

19. A method as defined in claim 8, further comprising the step of:

dynamically generating the Endo-Dynamic Information Node (EDIN).

20. A method as defined in claim 8, 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).