Abstract: The present invention relates to a simple, inexpensive and easy to use design which assists in filling the bird or hummingbird feeders which are nested on poles. The assembly provides tubes of varying lengths which are nested within each other and when the filling operation is required, the smaller tube nested within the larger tube can slide together, lowering the height to facilitate an easy feed filling process for users.

Abstract: Various approaches for accelerating data access to a computer memory and predicate evaluation includes storing, in the computer memory, (i) base data as multiple base columns, (ii) multiple sketched columns each corresponding to a base column in the base data and having smaller code values compared thereto, and (iii) a compression map for mapping one or more base columns to the corresponding sketched column; applying the compression map to a query having a predicate; determining data on the sketched column that satisfies the predicate; and evaluating the predicate based at least in part on the determined data on the sketched column without accessing the base column in the base data.

Abstract: Various approaches for accelerating data access to a computer memory and predicate evaluation includes storing, in the computer memory, (i) base data as multiple base columns, (ii) multiple sketched columns each corresponding to a base column in the base data and having smaller code values compared thereto, and (iii) a compression map for mapping one or more base columns to the corresponding sketched column; applying the compression map to a query having a predicate; determining data on the sketched column that satisfies the predicate; and evaluating the predicate based at least in part on the determined data on the sketched column without accessing the base column in the base data.

Abstract: Various approaches for determining the operation cost of a computational workload that is executed on a computational apparatus and accesses data stored in a data structure include decomposing the data structure into multiple data layout primitives, each data layout primitive corresponding to a smallest, fundamental layout aspect of the data structure; decomposing the computational workload into multiple data access primitives, each data access primitive corresponding to a computational mechanism for accessing the data stored in the data structure; determining a hardware profile associated with the apparatus; and computing the operation cost of the computational workload on the apparatus based at least in part on the data layout primitives, the data access primitives, and the hardware profile.