Method and apparatus for binary-oriented set sequencing
First Claim
1. A computer-implemented method for processing data, the method comprising:
- accessing an information structure, the information structure comprising one or more associations of data, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute;
applying a condition to the information structure to identify a subset of the associations of data satisfying the condition; and
dynamically generating a data structure defined according to the subset.
0 Assignments
0 Petitions
Accused Products
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.
72 Citations
86 Claims
-
1. A computer-implemented method for processing data, the method comprising:
-
accessing an information structure, the information structure comprising one or more associations of data, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute;
applying a condition to the information structure to identify a subset of the associations of data satisfying the condition; and
dynamically generating a data structure defined according to the subset. - View Dependent Claims (2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14)
-
-
8. The method according to claim wherein the set filtration operators comprise union, intersection, subject-match, attribute-match, bond-match, sequence match, generate-subject-match, remove node, descendants, ancestors, and siblings.
-
15. A computer-implemented method for generating a data organization, the method comprising:
-
accessing a first data set, the data set comprising a first set of one or more associations, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute;
accessing a second data set, the data set comprising a second set of one or more associations, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute;
combining the first and the second data sets to dynamically generating a customized data set. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37)
the condition comprises a set definition equation comprising one or more set definition operators, and the set definition operators include set filtration operators, control flow operators, and physical manipulation operators. -
25. The method according to claim 24, wherein the set filtration operators comprise union, intersection, subject-match, attribute-match, and bond-match.
-
26. The method according to claim 25, wherein the set filtration operators further comprise sequence match, generate-subject-match, and remove node.
-
27. The method according to claim 24, wherein the set filtration operators further comprise descendants, ancestors, and siblings.
-
28. The method according to claim 24, wherein the control flow operators comprise push, pop, peek, poke, stack-not-empty, stack-full, jump, and jump-conditional.
-
29. The method according to claim 28, wherein the control flow operators further comprise execute, spawn, and call.
-
30. The method according to claim 24, wherein the physical manipulation operators comprise remove-duplicates, length, activate module, load-data, purge-data, restore-data, get-image, set-image, create-node, delete-node, create-data-set, add-data-set, copy-data-set, delete-data-set, and save-data-set.
-
31. The method according to claim 24, wherein the physical manipulation operators comprise sort, create-node, and delete-node.
-
32. The method according to claim 31, wherein the physical manipulation operators further comprise generate-data-set, create-data-set, add-data-set, copy-data-set, and save-data-set.
-
33. The method according to claim 32, wherein the physical manipulation operators further comprise purge-data, delete-data-set, and remove-duplicates.
-
34. The method according to claim 23, wherein the method further comprises identifying a relationship between two or more associations of data by traversing the data structure corresponding to the subset of associations of data.
-
35. The method according to claim 23, wherein the set definition equation comprising applying an order-specific set of set definition operators.
-
36. The method according to claim 22, wherein the set definition equation comprises a union operation applied to the first and second data sets.
-
37. A computer-readable storage medium readable by a computing system and encoding a computer program of instructions for executing a computer process performing the method recited in claim 15.
-
-
38. A method for determining a relationship between a plurality of data items stored within a memory of a computing system, the method comprising:
-
accessing at least one data item stored within a traversable information structure, the traversable information structure comprising one or more associations, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute;
applying a condition to the data items for determining whether to include the data items in a dynamically generated subset of data items;
traversing the generated subset of data items using the traversable information structure to determine relationships between two or more data items. - View Dependent Claims (39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53)
-
-
54. A method for determining a relationship between a plurality of information atoms stored within a memory of a computing system, the method comprising:
-
accessing at least one information atom stored within a traversable information structure, the traversable information structure being related to one or more associations, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute; and
applying a condition to at least one information atom for dynamically generating a subset of data items to which the relationship applies;
wherein the applying involves traversing the information structure to identify the subset. - View Dependent Claims (55)
-
-
56. A method for identifying an association, the method comprising:
-
traversing an information structure, the information structure being related to one or more associations, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute; and
finding a candidate assertion based on said step of traversing, the candidate assertion being a dynamically generated information structure related to one or more associations;
applying one or more conditions to the associations to determine whether the candidate association meets the one or more conditions; and
selectively identifying the candidate assertion as meeting the one or more conditions. - View Dependent Claims (57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67)
-
-
68. A method for determining a relationship between a plurality of information atoms stored within a memory of a computing system, the method comprising:
-
accessing at least one information atom stored within a traversable information structure, the traversable information structure having been dynamically generated from one or more associations, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute; and
applying a condition to at least one information atom for determining a subset of data items to which the relationship applies;
wherein the applying involves traversing the information structure to identify the subset. - View Dependent Claims (71, 72, 73, 74, 75, 76, 77, 78, 79)
-
-
69. The method of 68, wherein said information atom corresponds to a subject of an association.
-
70. The method of 68, wherein said information atom corresponds to an attribute of an association.
-
80. For use in a multi-site computer networked distributed processing environment, a computer-implemented method for generating a data organization, the method comprising:
-
accessing a first data set, the data set comprising a first set of one or more associations, wherein at least one association comprises a first item associated with a subject, a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute;
determining a reference in at least one of the items, the reference identifying a remote site in a multi-site computer system; and
accessing a second data set, the data set being located at least partially at the remote site, the second data set comprising a second set of one or more associations, wherein at least one association comprises a first item associated with a subject a second item associated with an attribute, and a third item associated with a bond, wherein the bond defines a relationship between the subject and the attribute;
wherein the accessing the first data set and the accessing the second data set steps dynamically generates a new data set of one or more associations. - View Dependent Claims (81, 82, 83, 84, 85, 86)
-
Specification