A reusable converter framework provides a set of tools for (1) loading existing data formats and transformation instructions of a source technology and (2) enabling the result of step (1) to be queried through Java code and analyzed. The source technology may follow a particular data transformation strategy such as data-drive, script-driven, or query driven. The reusable converter framework has a Java representation, referred to herein as an interpreted form, that can hold the information of a target technology, which follows a different data transformation strategy. The source and target technologies operate on different computing platforms having different computing environments. The interpreted form is utilized in step (3) to streamline and optimize the information from step (2) and produce a working data map suitable for the target technology.
Legal claims defining the scope of protection, as filed with the USPTO.
3. The method according to claim 2, wherein compressing the plurality of instructions comprises at least one of removing an IF statement, combining statements, or reshaping the plurality of instructions.
4. The method according to claim 1, wherein extracting the required transformation logic from the relevant transformation logic in the interpreted form comprises querying the relevant transformation logic in the interpreted form for statements describing behaviors of the target technology, the statements including at least one of a field mapping or looping.
5. The method according to claim 1, wherein the source technology comprises a data-driven data transformation tool or a script-driven transformation tool.
6. The method according to claim 1, wherein the target technology comprises a query-driven transformation tool.
7. The method according to claim 1, wherein the interpreted form comprises an assumption, a rule, and a hint.
10. The system of claim 9, wherein compressing the plurality of instructions comprises at least one of removing an IF statement, combining statements, or reshaping the plurality of instructions.
11. The system of claim 8, wherein extracting the required transformation logic from the relevant transformation logic in the interpreted form comprises querying the relevant transformation logic in the interpreted form for statements describing behaviors of the target technology, the statements including at least one of a field mapping or looping.
12. The system of claim 8, wherein the source technology comprises a data-driven data transformation tool or a script-driven transformation tool.
13. The system of claim 8, wherein the target technology comprises a query-driven transformation tool.
14. The system of claim 8, wherein the interpreted form comprises an assumption, a rule, and a hint.
16. The computer program product of claim 15, wherein the instructions are further translatable by the processor for: compressing a plurality of instructions extracted from the definitions into a single instruction.
17. The computer program product of claim 16, wherein compressing the plurality of instructions comprises at least one of removing an IF statement, combining statements, or reshaping the plurality of instructions.
18. The computer program product of claim 15, wherein extracting the required transformation logic from the relevant transformation logic in the interpreted form comprises querying the relevant transformation logic in the interpreted form for statements describing behaviors of the target technology, the statements including at least one of a field mapping or looping.
19. The computer program product of claim 15, wherein the source technology comprises a data-driven data transformation tool or a script-driven transformation tool.
20. The computer program product of claim 15, wherein the target technology comprises a query-driven transformation tool.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
September 10, 2021
July 16, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.