Abstract: Techniques are disclosed relating to managing data objects. A computer system may access a first application comprising a set of functions and may execute a second application to facilitate execution of the first application. The first application may be written in a different programming language than the second application. The second application may manage, on behalf of the first application, memory resources of data objects that are defined within ones of the set of functions of the first application. The second application may establish, for the data objects, ownership information that indicates which ones of the functions are utilizing the data objects. The ownership information may be usable to determine, upon completion of a function of the set of functions, whether a given one of the data objects can be deallocated based on whether the given data object is being utilized by another function.

Abstract: Techniques are disclosed relating to constructing a delta transition table for a database trigger. A computer system may store trigger information identifying a database trigger having a set of routines to be executed after an update operation has been performed on the database table. The computer system may perform a particular update operation that includes updating one or more rows of the database table. As part of performing the particular update operation, the computer system may construct a delta transition table that includes an original version of the one or more rows prior to the particular update operation and an updated version of the one or more rows resulting from the particular update operation. Subsequent to performing the particular update operation, the computer system may make the delta transition table available to the database trigger to facilitate an execution of the set of routines.

Abstract: Techniques are disclosed relating to managing data objects. A computer system may access a first application comprising a set of functions and may execute a second application to facilitate execution of the first application. The first application may be written in a different programming language than the second application. The second application may manage, on behalf of the first application, memory resources of data objects that are defined within ones of the set of functions of the first application. The second application may establish, for the data objects, ownership information that indicates which ones of the functions are utilizing the data objects. The ownership information may be usable to determine, upon completion of a function of the set of functions, whether a given one of the data objects can be deallocated based on whether the given data object is being utilized by another function.

Abstract: Caching runtime plan data that is determined not to change for different invocations of a query plan. In some embodiments, a computing system accesses information that specifies a query plan generated for a first database query and generates a first runtime plan for the first database query based on the query plan. In some embodiments, the system caches information generated for the first runtime plan that is determined not to change for different invocations of the query plan. For example, transformation code may include separate functions for mutable and immutable state. In some embodiments, the system retrieves and uses the cached information to generate a second runtime plan for a second database query. Disclosed techniques may improve performance of query plan transformations that hit in the runtime plan cache.

Abstract: Caching runtime plan data that is determined not to change for different invocations of a query plan. In some embodiments, a computing system accesses information that specifies a query plan generated for a first database query and generates a first runtime plan for the first database query based on the query plan. In some embodiments, the system caches information generated for the first runtime plan that is determined not to change for different invocations of the query plan. For example, transformation code may include separate functions for mutable and immutable state. In some embodiments, the system retrieves and uses the cached information to generate a second runtime plan for a second database query. Disclosed techniques may improve performance of query plan transformations that hit in the runtime plan cache.