Abstract: Database query processing techniques are disclosed. In various embodiments, a query associated with a database is received. A byte code representation of the query is generated, including by decomposing the query into a discrete set of streaming operators defined over associated data frames, wherein the byte code includes code defining for each operator in the discrete set of streaming operators the processing to be performed by that operator and further embodies a data flow graph that defines a flow of data to and through the discrete set of streaming operators. The byte code is executed by a query processing engine to generate and return a query result.

Abstract: Database query processing techniques are disclosed. In various embodiments, a query associated with a database is received. A byte code representation of the query is generated, including by decomposing the query into a discrete set of streaming operators defined over associated data frames, wherein the byte code includes code defining for each operator in the discrete set of streaming operators the processing to be performed by that operator and further embodies a data flow graph that defines a flow of data to and through the discrete set of streaming operators. The byte code is executed by a query processing engine to generate and return a query result.

Abstract: A computer system manages the allocation of memory to an application program using a dependency tree. The dependency tree informs a memory manager of data inputs, data outputs, and intermediate values associated with execution of the application program. The memory manager allocates a single heap structure within a physical memory. Data associated with each node of the dependency tree is allocated to the heap structure so that data input values are allocated in a contiguous block, and intermediate values are allocated separately. In various examples, as execution of the application program proceeds, the separation of intermediate values from non-intermediate values within the heap reduces memory fragmentation providing improved performance of the computer system as a whole.

Abstract: A temporal graph database system is disclosed. In various embodiments, a call to a graph temporal application programming interface (API) is received via a communication interface. An estimated cardinality associated with the API call is determined. A selected graph temporal store to be used to generate a response to the API call is selected based at least in part on the estimated cardinality, wherein the selected graph temporal store is included in a plurality of graph temporal stores associated with a graph with which the API call is associated. The selected graph temporal store is used to generate a response to the API call.

Abstract: A computer system manages the allocation of memory to an application program using a dependency tree. The dependency tree informs a memory manager of data inputs, data outputs, and intermediate values associated with execution of the application program. The memory manager allocates a single heap structure within a physical memory. Data associated with each node of the dependency tree is allocated to the heap structure so that data input values are allocated in a contiguous block, and intermediate values are allocated separately. In various examples, as execution of the application program proceeds, the separation of intermediate values from non-intermediate values within the heap reduces memory fragmentation providing improved performance of the computer system as a whole.

Abstract: Database query processing techniques are disclosed. In various embodiments, a query associated with a database is received. A byte code representation of the query is generated, including by decomposing the query into a discrete set of streaming operators defined over associated data frames, wherein the byte code includes code defining for each operator in the discrete set of streaming operators the processing to be performed by that operator and further embodies a data flow graph that defines a flow of data to and through the discrete set of streaming operators. The byte code is executed by a query processing engine to generate and return a query result.

Abstract: Described are ferroelectric device film stacks which include a templating or texturing layer or material deposited below a ferroelectric layer, to enable a crystal lattice of the subsequently deposited ferroelectric layer to template off this templating layer and provide a large degree of preferential orientation despite the lack of epitaxial substrates.

Abstract: Described are ferroelectric device film stacks which include a templating or texturing layer or material deposited below a ferroelectric layer, to enable a crystal lattice of the subsequently deposited ferroelectric layer to template off this templating layer and provide a large degree of preferential orientation despite the lack of epitaxial substrates.

Abstract: Described are ferroelectric device film stacks which include a templating or texturing layer or material deposited below a ferroelectric layer, to enable a crystal lattice of the subsequently deposited ferroelectric layer to template off this templating layer and provide a large degree of preferential orientation despite the lack of epitaxial substrates.

Abstract: A computer system manages the allocation of memory to an application program using a dependency tree. The dependency tree informs a memory manager of data inputs, data outputs, and intermediate values associated with execution of the application program. The memory manager allocates a single heap structure within a physical memory. Data associated with each node of the dependency tree is allocated to the heap structure so that data input values are allocated in a contiguous block, and intermediate values are allocated separately. In various examples, as execution of the application program proceeds, the separation of intermediate values from non-intermediate values within the heap reduces memory fragmentation providing improved performance of the computer system as a whole.

Abstract: A ventilation system and method for venting a cockpit of a power boat is disclosed herein. The ventilation system comprises a windshield extending from a foredeck of the powerboat, a cockpit cover at least covering the cockpit and a frame. A cockpit vent comprises a frame defining at least one aperature for introducing ambient air into the cockpit. The frame is disposed between the windshield and cockpit cover and includes a windshield engagement member and a cover engagement member spaced from the windshield engagement member.

Abstract: A ventilation system and method for venting a cockpit of a power boat is disclosed herein. The ventilation system comprises a windshield extending from a foredeck of the powerboat, a cockpit cover at least covering the cockpit and a frame. A cockpit vent comprises a frame defining at least one aperture for introducing ambient air into the cockpit. The frame is disposed between the windshield and cockpit cover and includes a windshield engagement member and a cover engagement member spaced from the windshield engagement member.