Entity integration using high-level scripting languages
First Claim
1. A method comprising:
- reading an entity declaration from a machine readable medium, the entity declaration describing an entity including at least one nested entity;
reading an index declaration from a machine readable medium, the index declaration describing an index of nested entities;
reading an entity population rule from a machine readable medium, the entity population rule describing a mapping from an input schema to an output schema, the output schema conforming to the entity declaration;
reading at least one additional entity population rule from the machine readable medium;
compiling the entity population rule and the at least one additional entity population rule into at least one executable query, wherein compiling the entity population rule comprises topologically sorting the entities defined by the entity population rule and the at least one additional entity population rule based on at least one dependency between the entity population rule and the at least one additional entity population rule and generating a query by traversing from a leaf to a root of the topologically sorted entities;
reading a plurality of input records from a first data store, the input records conforming to the input schema;
reading an entity resolution rule from a machine readable medium, the entity resolution rule defining criteria for a link between entities;
compiling the entity resolution rule;
applying the entity resolution rule to the plurality of input records to determine a link between members of the plurality of input records;
applying the entity population rule to the plurality of input records to create a plurality of output records complying with the output schema;
subsequent to applying the entity population rule, recompiling the entity population rule and the at least one additional entity population rule; and
populating the index of nested entities using the at least one executable query, the index of nested entities complying with the index declaration, and the index including the link.
1 Assignment
0 Petitions
Accused Products
Abstract
Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration.
-
Citations
20 Claims
-
1. A method comprising:
-
reading an entity declaration from a machine readable medium, the entity declaration describing an entity including at least one nested entity; reading an index declaration from a machine readable medium, the index declaration describing an index of nested entities; reading an entity population rule from a machine readable medium, the entity population rule describing a mapping from an input schema to an output schema, the output schema conforming to the entity declaration; reading at least one additional entity population rule from the machine readable medium; compiling the entity population rule and the at least one additional entity population rule into at least one executable query, wherein compiling the entity population rule comprises topologically sorting the entities defined by the entity population rule and the at least one additional entity population rule based on at least one dependency between the entity population rule and the at least one additional entity population rule and generating a query by traversing from a leaf to a root of the topologically sorted entities; reading a plurality of input records from a first data store, the input records conforming to the input schema; reading an entity resolution rule from a machine readable medium, the entity resolution rule defining criteria for a link between entities; compiling the entity resolution rule; applying the entity resolution rule to the plurality of input records to determine a link between members of the plurality of input records; applying the entity population rule to the plurality of input records to create a plurality of output records complying with the output schema; subsequent to applying the entity population rule, recompiling the entity population rule and the at least one additional entity population rule; and populating the index of nested entities using the at least one executable query, the index of nested entities complying with the index declaration, and the index including the link. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A computer program product for entity population, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code executable by a processor to:
-
read an entity declaration from a machine readable medium, the entity declaration describing an entity including at least one nested entity; read an index declaration from a machine readable medium, the index declaration describing an index of nested entities; read an entity population rule from a machine readable medium, the entity population rule describing a mapping from an input schema to an output schema, the output schema conforming to the entity declaration; reading at least one additional entity population rule from the machine readable medium; compiling the entity population rule and the at least one additional entity population rule into at least one executable query, wherein compiling the entity population rule comprises topologically sorting the entities defined by the entity population rule and the at least one additional entity population rule based on at least one dependency between the entity population rule and the at least one additional entity population rule and generating a query by traversing from a leaf to a root of the topologically sorted entities; read a plurality of input records from a first data store, the input records conforming to the input schema; read an entity resolution rule from a machine readable medium, the entity resolution rule defining criteria for a link between entities; compile the entity resolution rule; apply the entity resolution rule to the plurality of input records to determine a link between members of the plurality of input records; apply the entity population rule to the plurality of input records to create a plurality of output records complying with the output schema; subsequent to applying the entity population rule, recompile the entity population rule and the at least one additional entity population rule; and populate the index of nested entities using the at least one executable query, the index of nested entities complying with the index declaration, and the index including the link. - View Dependent Claims (17, 18, 19, 20)
-
Specification