Disambiguation of tabular date
First Claim
1. A computer implemented method for creating tables of related data, the method comprising:
- identifying in a single tree representing all of a plurality of data entities and all cardinal relationships between said data entities, and all of a plurality of core paths, wherein each of said core paths includes a plurality of said data entities and any of said cardinal relationships between any of said data entities of the related data, whereineach of said core paths, originates from a common root data entity, wherein the common root data entity is the same one of said data entities, whereineach of said core paths includes a terminal data entity, the terminal data entity being one of said data entities that terminates said core path, wherein said terminal data entity is at a to-many end of a many-to-many relationship with another of said data entities along said core path, and whereineach of said core paths includes no other of said data entities that lie along any non-core path descending from said terminal data entities, andcreating on a computer-readable medium a separate table for each of said core paths, wherein each of said tables includes a column for each of said dam entities of said core path for which said table was created such that all of the data entities in all of the core paths are unambiguously presented in the tables.
3 Assignments
0 Petitions
Accused Products
Abstract
Creating data tables by identifying paths in a tree of data entities and relationships, the tree including data entities and relationships between the entities, where each of the paths originates from the same data entity, includes a terminal data entity that is at the to-many end of a one-to-many or many-to-many relationship with another data entity along the path, and includes no other of the data entities that lie along any path descending from the terminal data entity and that is at the to-many end of a one-to-many or many-to-many relationship with another of the data entities that lie along the path descending from the terminal data entity, and creating on a computer-readable medium a separate table for each of the paths, where each of the tables includes a column per each of the data entities of the path for which the table was created.
10 Citations
14 Claims
-
1. A computer implemented method for creating tables of related data, the method comprising:
-
identifying in a single tree representing all of a plurality of data entities and all cardinal relationships between said data entities, and all of a plurality of core paths, wherein each of said core paths includes a plurality of said data entities and any of said cardinal relationships between any of said data entities of the related data, wherein each of said core paths, originates from a common root data entity, wherein the common root data entity is the same one of said data entities, wherein each of said core paths includes a terminal data entity, the terminal data entity being one of said data entities that terminates said core path, wherein said terminal data entity is at a to-many end of a many-to-many relationship with another of said data entities along said core path, and wherein each of said core paths includes no other of said data entities that lie along any non-core path descending from said terminal data entities, and creating on a computer-readable medium a separate table for each of said core paths, wherein each of said tables includes a column for each of said dam entities of said core path for which said table was created such that all of the data entities in all of the core paths are unambiguously presented in the tables. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A tabular data disambiguation system comprising:
-
a computer processing device; a core path identifier configured to identify any core path within a single tree of a plurality of data entities as, wherein the core path originates from a common root data entity, including a terminal data entity terminating said core path, wherein said terminal data entity is at a to-many end of a many-to-many relationship with any of said data entities along said core path, and wherein the core path includes no other of said data entities that lie along any non-core path descending from said terminal data entity; and a table creator configured to create on as computer-readable medium a separate table for of said core paths identified by said core path identifier, wherein each of said tables includes a column for each of said data entities of said core path for which said table was created such that all of the data entities in all of the core paths are unambiguously presented in the tables. - View Dependent Claims (7, 8, 9, 10, 11)
-
-
12. A computer-implemented program embodied on a non-transitory computer-readable medium, the computer program comprising:
-
a code segment operative to identify, in a single tree representing a plurality of data entities and cardinal relationships between said data entities, a plurality of core paths, wherein each of said core paths includes a plurality of said data entities and any of said cardinal relationships between any of said data entities, wherein each of said core paths originates from a common root data entity, wherein the common root data entity is the same one of said data entities, and wherein each of said core paths includes a terminal data entity, the terminal data entity being one of said data entities that terminates said core path, wherein said terminal data entity is at a to-many end of a many-to-many relationship with another of said data entities along, said core path, and wherein each of said core paths includes no other of said data entities that lie along any non-core path descending from said terminal data entity; and a code segment operative to create on the non-transitory computer-readable medium a separate table for each of said core paths, wherein each of said tables includes a column for each of said data entities of said core path far which said table was created. - View Dependent Claims (13, 14)
-
Specification