Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes an initial instruction for a file stored in a first storage system, determining that the initial instruction is not supported by the first storage system, identifying a combination of instructions to the first storage system after determining that the initial instruction is not supported by the first storage system, wherein the combination of instructions is based on the initial instruction, performing the identified combination of instructions on the file stored in the first storage system, and storing results of the performed identified combination of instructions.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes an initial instruction for a file stored in a first storage system, determining that the initial instruction is not supported by the first storage system, identifying a combination of instructions to the first storage system after determining that the initial instruction is not supported by the first storage system, wherein the combination of instructions is based on the initial instruction, performing the identified combination of instructions on the file stored in the first storage system, and storing results of the performed identified combination of instructions.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes an initial instruction for a file stored in a first storage system, determining that the initial instruction is not supported by the first storage system, identifying a combination of instructions to the first storage system after determining that the initial instruction is not supported by the first storage system, wherein the combination of instructions is based on the initial instruction, performing the identified combination of instructions on the file stored in the first storage system, and storing results of the performed identified combination of instructions.

Abstract: The invention identifies and caches query plans in a shared-nothing distributed data store that are unlikely to become invalid because they do not reference objects that are likely to be changed or deleted. Plans that are likely to become invalid and are not cached are those plans that reference data that is partitioned across segment/query execution nodes of the data store, plans that are complex, and plans that reference objects that are not “built-in” (primitive) objects. The effect is that most plans which are generated on a query dispatch (master) node are not cached, whereas most plans generated on an execution (segment) node are cached.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes an initial instruction for a file stored in a first storage system, determining that the initial instruction is not supported by the first storage system, identifying a combination of instructions to the first storage system after determining that the initial instruction is not supported by the first storage system, wherein the combination of instructions is based on the initial instruction, performing the identified combination of instructions on the file stored in the first storage system, and storing results of the performed identified combination of instructions.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes an initial instruction for a file stored in a first storage system, determining that the initial instruction is not supported by the first storage system, identifying a combination of instructions to the first storage system after determining that the initial instruction is not supported by the first storage system, wherein the combination of instructions is based on the initial instruction, performing the identified combination of instructions on the file stored in the first storage system, and storing results of the performed identified combination of instructions.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes an initial instruction for a file stored in a first storage system, determining that the initial instruction is not supported by the first storage system, identifying a combination of instructions to the first storage system after determining that the initial instruction is not supported by the first storage system, wherein the combination of instructions is based on the initial instruction, performing the identified combination of instructions on the file stored in the first storage system, and storing results of the performed identified combination of instructions.

Abstract: Data conversion algorithms such as compression and decompression algorithms or encryption and decryption algorithms are registered in a shared data store for selective use on data by creating implementations of a plurality of functions that as a group characterize the algorithms, converting the implementations to executable code and storing the code in a shared library, and creating and registering data store objects in a data store catalog with a common identifier that enables the algorithm to be selectively called and applied to data.

Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.

Abstract: Inverse distribution operations are performed on a large distributed parallel database comprising a plurality of distributed data segments to determine a data value at a predetermined percentile of a sorted dataset formed on one segment. Data elements from across the segments may be first grouped, either by partitioning keys or by hashing, the groups are sorted into a predetermined order, and data values corresponding to the desired percentile are picked up at a row location of the corresponding data element of each group. For a global dataset that is spread across the database segments, a local sort of data elements is performed on each segment, and the data elements from the local sorts are streamed in overall sorted order to one segment to form the sorted dataset.

Abstract: Updatable cursors for positioned updates are provided in a distributed shared-nothing data store by associating with each row of data in a result set hidden metadata that identifies the segments and the locations on such segments of such row. When an update is issued to data under a cursor, the associated metadata is transparently inserted into the update statement before it is dispatched to the segments to insure that the correct data is accurately updated. For cached query statements, generic metadata identifiers are used for building and caching, and the actual metadata identifiers are folded into the statement in place of the generic identifiers before dispatch.

Abstract: The invention identifies and caches query plans in a shared-nothing distributed data store that are unlikely to become invalid because they do not reference objects that are likely to be changed or deleted. Plans that are likely to become invalid and are not cached are those plans that reference data that is partitioned across segment/query execution nodes of the data store, plans that are complex, and plans that reference objects that are not “built-in” (primitive) objects. The effect is that most plans which are generated on a query dispatch (master) node are not cached, whereas most plans generated on an execution (segment) node are cached.

Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.

Abstract: Inverse distribution operations are performed on a large distributed parallel database comprising a plurality of distributed data segments to determine a data value at a predetermined percentile of a sorted dataset formed on one segment. Data elements from across the segments may be first grouped, either by partitioning keys or by hashing, the groups are sorted into a predetermined order, and data values corresponding to the desired percentile are picked up at a row location of the corresponding data element of each group. For a global dataset that is spread across the database segments, a local sort of data elements is performed on each segment, and the data elements from the local sorts are streamed in overall sorted order to one segment to form the sorted dataset.

Abstract: A method for upgrading software in a shared data store comprises a reliable, safe in-place method of transformation of metadata in which a metadata catalog is cloned, stored in the data store, and the cloned metadata is transformed in-place using the data store engine and SQL declarative language. The original and transformed cloned catalog files are swapped atomically, and the system upgrade is validated using the new version of software. If errors are encountered during the upgrade, the original catalog can be swapped back and the system returned to its original state.

Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.

Abstract: A script is run on a database to transform the metadata and produce an upgraded database. A new database corresponding to the upgraded database is initialized, and the metadata in the new database catalog is verified by comparing it to the upgraded database metadata. A fast verification is performed on a partial upgrade by dumping the catalogs of master nodes and comparing the results, and a thorough verification is performed on a full upgrade by querying and comparing both master node catalogs and segment node catalogs.

Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.