Metadata-Based Business Rule Interpreter
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current business rule systems are slow due to compilation and execution of executable code, making them inefficient and insecure, especially in web browser environments where real-time communication is necessary.
Innovation Solution
A metadata-based business rule interpreter that translates user input into an abstract syntax tree structure composed of metadata objects, eliminating the need for compilation and executable code, using a set of composable executor functions to execute business rules directly from metadata definitions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a compiler is used to generate executable code from user input, then the business rule can be implemented with structured code, but the compilation time and execution speed are significantly reduced
Solution Approach 1:
The patent extracts the compilation step entirely from the business rule execution process. Instead of compiling user input into executable code, the system directly interprets and executes the metadata-based abstract syntax tree, eliminating the time-consuming compilation phase while maintaining reliable business rule implementation.
Solution Approach 2:
The patent introduces a metadata-based abstract syntax tree as an intermediary representation that can be directly executed without compilation. This intermediary structure serves as both the input format and execution format, eliminating the need for code generation while preserving structured business rule logic.
2Productivity
If executable code is generated and injected into the browser, then the business rule can be executed with full computational power, but security risks increase due to code injection vulnerabilities
Solution Approach 1:
The patent uses lightweight, disposable metadata objects instead of persistent executable code. Each business rule is represented as a self-contained metadata structure that is executed and then discarded, eliminating the security risks associated with code injection while maintaining full computational capability for business rule execution.
Solution Approach 2:
The patent changes the fundamental parameter of representation from executable code to metadata structures. This parameter change transforms the system from one that executes foreign code (security risk) to one that executes structured data (secure), while maintaining the ability to perform complex business rule computations.
3Adaptability or versatility
If traditional compilation and code generation are used, then the business rule system can handle complex logic, but the system complexity and maintenance difficulty increase
Solution Approach 1:
The patent segments the business rule system into distinct metadata components (operators, operands, control structures) that can be independently defined and combined. This segmentation allows complex business logic to be built from simple, reusable metadata building blocks, reducing overall system complexity while maintaining versatility.
Solution Approach 2:
The patent creates a universal metadata framework where the same metadata structures can represent diverse business rule logic through different combinations of operators and operands. This universal approach eliminates the need for separate code generation paths for different logic types, simplifying the system while handling complex requirements.
Data Source
AI summary
A method of increasing a speed of operation of a computer via a metadata-based business rule interpreter. The method includes receiving, at a processor, user input defining a business rule. The method also includes translating, by the processor, the user input into a domain-specific language entirely consisting of metadata objects, wherein a translated syntax is formed, the translated syntax being an abstract syntax tree structure consisting of only the metadata objects. The method also includes executing, by the processor, an abstract syntax tree interpreter and taking as input into the abstract syntax tree interpreter the translated syntax. A compiler operation to generate computer code for implementing the business rule is avoided. Executing the abstract syntax tree interpreter produces a result in a browser without using executable code to achieve the result.