17948821. PRODUCING NATIVELY COMPILED QUERY PLANS BY RECOMPILING EXISTING C CODE THROUGH PARTIAL EVALUATION simplified abstract (Oracle International Corporation)
Contents
- 1 PRODUCING NATIVELY COMPILED QUERY PLANS BY RECOMPILING EXISTING C CODE THROUGH PARTIAL EVALUATION
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 PRODUCING NATIVELY COMPILED QUERY PLANS BY RECOMPILING EXISTING C CODE THROUGH PARTIAL EVALUATION - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
PRODUCING NATIVELY COMPILED QUERY PLANS BY RECOMPILING EXISTING C CODE THROUGH PARTIAL EVALUATION
Organization Name
Oracle International Corporation
Inventor(s)
Laleh Aghababaie Beni of Pasadena CA (US)
Garret F. Swart of Palo Alto CA (US)
PRODUCING NATIVELY COMPILED QUERY PLANS BY RECOMPILING EXISTING C CODE THROUGH PARTIAL EVALUATION - A simplified explanation of the abstract
This abstract first appeared for US patent application 17948821 titled 'PRODUCING NATIVELY COMPILED QUERY PLANS BY RECOMPILING EXISTING C CODE THROUGH PARTIAL EVALUATION
Simplified Explanation
The abstract describes a patent application related to a database management system (DBMS) that can optimize the execution of database statements by generating interpretable execution plans and compiling them into object code for acceleration.
- The DBMS receives a request to execute a database statement and generates an interpretable execution plan.
- The system decides whether to interpret the plan or compile it into object code for faster execution.
- Partial evaluation and Turing-complete template metaprogramming are used for optimization.
Potential Applications
This technology could be applied in various industries where database management and optimization are crucial, such as finance, healthcare, e-commerce, and more.
Problems Solved
1. Slow execution of database statements. 2. Inefficient use of resources in database management systems.
Benefits
1. Accelerated execution of database statements. 2. Improved performance and efficiency in database operations. 3. Reduction in resource consumption.
Potential Commercial Applications
Optimized database management systems for large enterprises, cloud service providers, data analytics companies, and any organization heavily reliant on database operations.
Possible Prior Art
There may be prior art related to optimizing database management systems through partial evaluation and template metaprogramming techniques. However, specific examples are not provided in the abstract.
Unanswered Questions
How does this technology compare to existing database optimization techniques?
This article does not provide a direct comparison with other database optimization methods. It would be helpful to understand the specific advantages and disadvantages of this approach compared to traditional optimization techniques.
What are the potential limitations or challenges in implementing this technology?
The abstract does not mention any potential drawbacks or challenges that may arise when implementing this technology. It would be beneficial to explore any limitations or obstacles that could affect its practical application.
Original Abstract Submitted
In an embodiment, a database management system (DBMS) hosted by a computer receives a request to execute a database statement and responsively generates an interpretable execution plan that represents the database statement. The DBMS decides whether execution of the database statement will or will not entail interpreting the interpretable execution plan and, if not, the interpretable execution plan is compiled into object code based on partial evaluation. In that case, the database statement is executed by executing the object code of the compiled plan, which provides acceleration. In an embodiment, partial evaluation and Turing-complete template metaprogramming (TMP) are based on using the interpretable execution plan as a compile-time constant that is an argument for a parameter of an evaluation template.
