Abstract: A data store system may include an array of persistent storage devices configured to store a plurality of data store tables. The data store system may further include a processor in communication with the storage device. The processor may receive a query containing a non-equality join condition on a first column from a first data store table and a second column on a second data store table. The processor may generate a bitmap based on the join condition. The bitmap indicate respective matches between the first column and second column in accordance with the non-equality join condition. The bitmap may also be used each time the non-equality join condition is present in another received query. A method and computer-readable medium may also be implemented.

Abstract: A method for provisioning a computer includes providing a graph that defines relationships between one or more hardware components of a plurality of computers and component characteristics of the one or more hardware components, and relationships between one or more applications and requirements of the one or more applications. The method further includes receiving a selection of an application and determining, via the graph, whether at least one computer with hardware components capable of meeting the requirements of the application exists. If a computer exits, the method also includes communicating the application to the computer; triggering the computer to execute the application; and communicating, from the computer, data processed by the application to an external system.

Abstract: A method for provisioning a computer includes providing a graph that defines relationships between one or more hardware components of a plurality of computers and component characteristics of the one or more hardware components, and relationships between one or more applications and requirements of the one or more applications. The method further includes receiving a selection of an application and determining, via the graph, whether at least one computer with hardware components capable of meeting the requirements of the application exists. If a computer exits, the method also includes communicating the application to the computer; triggering the computer to execute the application; and communicating, from the computer, data processed by the application to an external system.

Abstract: A method for provisioning a computer includes providing a graph that defines relationships between one or more hardware components of a plurality of computers and component characteristics of the one or more hardware components, and relationships between one or more applications and requirements of the one or more applications. The method further includes receiving a selection of an application and determining, via the graph, whether at least one computer with hardware components capable of meeting the requirements of the application exists. If a computer exits, the method also includes communicating the application to the computer; triggering the computer to execute the application; and communicating, from the computer, data processed by the application to an external system.

Abstract: A method for provisioning a computer includes providing a graph that defines relationships between one or more hardware components of a plurality of computers and component characteristics of the one or more hardware components, and relationships between one or more applications and requirements of the one or more applications. The method further includes receiving a selection of an application and determining, via the graph, whether at least one computer with hardware components capable of meeting the requirements of the application exists. If a computer exits, the method also includes communicating the application to the computer; triggering the computer to execute the application; and communicating, from the computer, data processed by the application to an external system.

Abstract: Based on a request, a processor may identify a multi-dimensional dataset stored in the at least one of a plurality of data tables and identify each dimension of the multi-dimensional dataset. For each respective identified dimension, the processor may sort the identified dataset on values of the respective identified dimension, partition the sorted dataset into a predetermined number of intervals associated with the respective identified dimension, determine a number of rows for each interval and select a lower boundary value and an upper boundary value for each interval. The upper boundary value may be the highest value in each interval. The lower boundary value for an interval having lowest sorted values may be the lowest value in the interval or the upper boundary value of an interval having immediately preceding partitioned values. The processor may further store the boundary values and rows for each interval of each identified dimension as the histogram.