Patents
Literature
2 results about "Partial evaluation" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In computing, partial evaluation is a technique for several different types of program optimization by specialization. The most straightforward application is to produce new programs which run faster than the originals while being guaranteed to behave in the same way. A computer program, prog, is seen as a mapping of input data into output data: prog:Iₛₜₐₜᵢc×Idyₙₐₘᵢc→O Iₛₜₐₜᵢc, the static data, is the part of the input data known at compile time.
Partial policy evaluation
ActiveUS12645810B1Digital data protectionPlatform integrity maintainancePolicy decisionApplication programming interface
Some embodiments provide a method for evaluating a policy for authorizing an API (Application Programming Interface) call to an application. Based on a first set of parameters available before receiving the API call, the method evaluates only a portion of the policy to produce a partially evaluated policy. The method stores the partially evaluated policy in a cache. The method then receives an API call to authorize, and determines whether the API call should be authorized by fully evaluating the policy, using the partially evaluated policy retrieved from the cache first storage, and a second set of parameters associated with the API call. The method responds to the API call with a policy decision based on the fully evaluated authorization policy.
Owner:APPLE INC
The first Futamura projection in the context of SQL expression evaluation
ActiveCN114341832BDigital data information retrievalSoftware engineeringDatabase queryJust-in-time compilation
This invention relates to database query execution optimization. Specifically, it describes techniques for optimal execution based on query interpretation translated into a domain-specific language (DSL) using optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just-in-time (JIT) compilation, dynamic analysis, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) hosted on a computer generates a query tree representing a database query, which contains expressions represented by subtrees of the query tree. The DBMS generates a sequence of DSL instructions representing the subtrees. During the execution of the database query, the sequence of DSL instructions is executed to evaluate the expressions. In an embodiment, the AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.
Owner:ORACLE INT CORP