Patent application number | Description | Published |
20150370647 | DIRECTED BACKUP FOR MASSIVELY PARALLEL PROCESSING DATABASES - Creating a data backup of data on a first computer system to restore to a second computer system, each of the first and second computer system including one or more nodes, each node configured to manage a subset of the data. Receiving, by the first computer system, identification of data to back up and node configuration information for the second computer system. Creating, by the first computer system, a backup of the data from the one or more nodes of the first computer system, configured in accordance with the node configuration information of the second computer system, such that the backed up data is directly manageable by the one or more nodes of the second computer system. | 12-24-2015 |
20150370651 | DIRECTED BACKUP FOR MASSIVELY PARALLEL PROCESSING DATABASES - Creating a data backup of data on a first computer system to restore to a second computer system, each of the first and second computer system including one or more nodes, each node configured to manage a subset of the data. Receiving, by the first computer system, identification of data to back up and node configuration information for the second computer system. Creating, by the first computer system, a backup of the data from the one or more nodes of the first computer system, configured in accordance with the node configuration information of the second computer system, such that the backed up data is directly manageable by the one or more nodes of the second computer system. | 12-24-2015 |
20160098269 | AGILE SOFTWARE DEVELOPMENT PROCESS AND RESULTS - A method for agile software development comprises receiving by a VM a command by a first version of a software component running on a first virtual machine, wherein the command may be executed by the software component, passing the command to a hypervisor along with an output file including a functionality identifier corresponding to the command and identifiers for versions of the software component to which the command is applicable, and transferring the command to a second VM for an execution of the functionality if the identifier of the second version of the software component was included in the output file. Additionally, the method may include sending a freeze command by the hypervisor to the second virtual machine if the identifier of the second version of the software component is not included in the output file. | 04-07-2016 |
20160098270 | AGILE SOFTWARE DEVELOPMENT PROCESS AND RESULTS - A method for agile software development comprises receiving by a VM a command by a first version of a software component running on a first virtual machine, wherein the command may be executed by the software component, passing the command to a hypervisor along with an output file including a functionality identifier corresponding to the command and identifiers for versions of the software component to which the command is applicable, and transferring the command to a second VM for an execution of the functionality if the identifier of the second version of the software component was included in the output file. Additionally, the method may include sending a freeze command by the hypervisor to the second virtual machine if the identifier of the second version of the software component is not included in the output file. | 04-07-2016 |
20160098447 | OPTIMIZATION OF A PLURALITY OF TABLE PROCESSING OPERATIONS IN A MASSIVE PARALLEL PROCESSING ENVIRONMENT - A computer-implemented method for partitioning data for a query operation of one table of the database system is provided. The computer-implemented method comprises estimating a value distribution of the attribute in the result table based on a first value distribution of the attribute in the first column of the first table. The computer-implemented method further comprises determining boundaries for partitioning ranges of the attribute, based on the estimated value distribution, wherein the partitioning ranges correspond to a same number of rows of the result table. The computer-implemented method further comprises partitioning the first table with processing nodes of the query operation, based on the determined boundaries of partitioning ranges. | 04-07-2016 |
20160098453 | OPTIMIZATION OF A PLURALITY OF TABLE PROCESSING OPERATIONS IN A MASSIVE PARALLEL PROCESSING ENVIRONMENT - A computer-implemented method for partitioning data for a query operation of one table of the database system is provided. The computer-implemented method comprises estimating a value distribution of the attribute in the result table based on a first value distribution of the attribute in the first column of the first table. The computer-implemented method further comprises determining boundaries for partitioning ranges of the attribute, based on the estimated value distribution, wherein the partitioning ranges correspond to a same number of rows of the result table. The computer-implemented method further comprises partitioning the first table with processing nodes of the query operation, based on the determined boundaries of partitioning ranges. | 04-07-2016 |
20160110419 | SELECTIVITY ESTIMATION FOR QUERY EXECUTION PLANNING IN A DATABASE - A computer-implemented method of estimating selectivity of a query may include generating, for data stored in a database in a memory, a one-dimensional value distribution for each of a plurality of attributes of the data. A multidimensional histogram may be generated, wherein the multidimensional histogram includes the one-dimensional value distributions for the plurality of attributes of the data. The multidimensional histogram may be converted to a one-dimensional histogram by assigning each bucket of the multidimensional histogram to corresponding buckets of the one-dimensional histogram and ordering the corresponding buckets according to a space-filling curve. One or more bucket ranges of the one-dimensional histogram may be determined by mapping the query conditions on the one-dimensional histogram. The selectivity of the query may be estimated by estimating how many data values in the one or more bucket ranges will meet the query conditions. | 04-21-2016 |
20160110426 | SELECTIVITY ESTIMATION FOR QUERY EXECUTION PLANNING IN A DATABASE - A computer-implemented method of estimating selectivity of a query may include generating, for data stored in a database in a memory, a one-dimensional value distribution for each of a plurality of attributes of the data. A multidimensional histogram may be generated, wherein the multidimensional histogram includes the one-dimensional value distributions for the plurality of attributes of the data. The multidimensional histogram may be converted to a one-dimensional histogram by assigning each bucket of the multidimensional histogram to corresponding buckets of the one-dimensional histogram and ordering the corresponding buckets according to a space-filling curve. One or more bucket ranges of the one-dimensional histogram may be determined by mapping the query conditions on the one-dimensional histogram. The selectivity of the query may be estimated by estimating how many data values in the one or more bucket ranges will meet the query conditions. | 04-21-2016 |