Abstract: Techniques for data skipping that may be user defined and extensible may be provided. A method may include receiving a query, at a computer system comprising a processor, memory accessible by the processor, and computer program instructions stored in the memory and executable by the processor, modifying, at the computer system, the received query to utilize at least one data skipping index to evaluate at least one criterion of the query, wherein the at least one data skipping index comprises an index on at least one attribute of data that excludes index information for at least a portion of those data items that do not meet the at least one criterion, and wherein the at least one data skipping index is generated based on information received from an application programming interface, and evaluating, at the computer system, the query.

Abstract: A computer program product and a system comprising: a cluster of Secure Execution Platforms (SEPs) having connectivity to a data storage, each SEP of said cluster is configured to maintain, using a key, confidentiality of data while processing thereof; the key is shared among the SEPs of said cluster, the key is automatically generated by the cluster or portion thereof and is unavailable to any non-cluster entity; the data storage retains encrypted data that is encrypted using the key; a first SEP of the cluster is configured to encrypt client data using the key to obtain encrypted client data and store the encrypted client data in the data storage; and a second SEP of the cluster is configured to retrieve encrypted stored data from the data storage, decrypt the encrypted stored data using the key to obtain non-encrypted form of the encrypted stored data.

Abstract: Embodiments of the present systems and methods may provide techniques for data skipping that may be user defined and extensible. For example, a method may comprise receiving a query, at a computer system comprising a processor, memory accessible by the processor, and computer program instructions stored in the memory and executable by the processor, modifying, at the computer system, the received query to utilize at least one data skipping index to evaluate at least one criterion of the query, wherein the at least one data skipping index comprises an index on at least one attribute of data that excludes index information for at least a portion of those data items that do not meet the at least one criterion, and wherein the at least one data skipping index is generated based on information received from an application programming interface, and evaluating, at the computer system, the query.

Abstract: Improved computer data query processing by a) identifying a cut point value (CPV) for a data set, where an attribute value of each data set record is normalized between first and second normal bounds, where the CPV is any value between the normal bounds that is associated with a maximum data skipping performance value (DSP) calculated by applying a DSP function based on the normalized values and the CPV, and where the DSP function relates to a selected data query distribution profile, b) partitioning the data set into multiple partitions, one partition including a data record subset whose corresponding normalized attribute values are greater than the CPV, and another partition including a data record subset whose corresponding normalized attribute values are less than the CPV, and c) storing the partitions on physical data storage media for access by a computer configured to perform data query processing.

Abstract: A computer program product and a system comprising: a cluster of Secure Execution Platforms (SEPs) having connectivity to a data storage, each SEP of said cluster is configured to maintain, using a key, confidentiality of data while processing thereof; the key is shared among the SEPs of said cluster, the key is automatically generated by the cluster or portion thereof and is unavailable to any non-cluster entity; the data storage retains encrypted data that is encrypted using the key; a first SEP of the cluster is configured to encrypt client data using the key to obtain encrypted client data and store the encrypted client data in the data storage; and a second SEP of the cluster is configured to retrieve encrypted stored data from the data storage, decrypt the encrypted stored data using the key to obtain non-encrypted form of the encrypted stored data.

Abstract: A computer program product and a system comprising: a cluster of Secure Execution Platforms (SEPs) having connectivity to a data storage, each SEP of said cluster is configured to maintain, using a key, confidentiality of data while processing thereof; the key is shared among the SEPs of said cluster, the key is automatically generated by the cluster or portion thereof and is unavailable to any non-cluster entity; the data storage retains encrypted data that is encrypted using the key; a first SEP of the cluster is configured to encrypt client data using the key to obtain encrypted client data and store the encrypted client data in the data storage; and a second SEP of the cluster is configured to retrieve encrypted stored data from the data storage, decrypt the encrypted stored data using the key to obtain non-encrypted form of the encrypted stored data.

Abstract: Improved computer data query processing by a) identifying a cut point value (CPV) for a data set, where an attribute value of each data set record is normalized between first and second normal bounds, where the CPV is any value between the normal bounds that is associated with a maximum data skipping performance value (DSP) calculated by applying a DSP function based on the normalized values and the CPV, and where the DSP function relates to a selected data query distribution profile, b) partitioning the data set into multiple partitions, one partition including a data record subset whose corresponding normalized attribute values are greater than the CPV, and another partition including a data record subset whose corresponding normalized attribute values are less than the CPV, and c) storing the partitions on physical data storage media for access by a computer configured to perform data query processing.

Abstract: A computer program product and a system comprising: a cluster of Secure Execution Platforms (SEPs) having connectivity to a data storage, each SEP of said cluster is configured to maintain, using a key, confidentiality of data while processing thereof; the key is shared among the SEPs of said cluster, the key is automatically generated by the cluster or portion thereof and is unavailable to any non-cluster entity; the data storage retains encrypted data that is encrypted using the key; a first SEP of the cluster is configured to encrypt client data using the key to obtain encrypted client data and store the encrypted client data in the data storage; and a second SEP of the cluster is configured to retrieve encrypted stored data from the data storage, decrypt the encrypted stored data using the key to obtain non-encrypted form of the encrypted stored data.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include detecting multiple sets of storage objects stored in a data facility including multiple server racks, each of the server racks including a plurality of server computers, each of the storage objects in each set being stored in a separate one of the server racks and including one or more data objects and one or more protection objects. A specified number of the storage objects are identified in a given server rack, each of the identified storage objects being stored in a separate one of the server computers, and one or more server computers in the given server rack not storing any of the identified storage objects are identified. Finally, in the identified one or more server computers, an additional protection object is created and managed for the identified storage objects.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include detecting multiple sets of storage objects stored in a data facility including multiple server racks, each of the server racks including a plurality of server computers, each of the storage objects in each set being stored in a separate one of the server racks and including one or more data objects and one or more protection objects. A specified number of the storage objects are identified in a given server rack, each of the identified storage objects being stored in a separate one of the server computers, and one or more server computers in the given server rack not storing any of the identified storage objects are identified. Finally, in the identified one or more server computers, an additional protection object is created and managed for the identified storage objects.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include detecting multiple sets of storage objects stored in a data facility including multiple server racks, each of the server racks including a plurality of server computers, each of the storage objects in each set being stored in a separate one of the server racks and including one or more data objects and one or more protection objects. A specified number of the storage objects are identified in a given server rack, each of the identified storage objects being stored in a separate one of the server computers, and one or more server computers in the given server rack not storing any of the identified storage objects are identified. Finally, in the identified one or more server computers, an additional protection object is created and managed for the identified storage objects.

Abstract: In accordance with one or more embodiments, an inode implemented file system may be utilized to support both offline and inline deduplication. When the first content is stored in the storage medium, one inode is used to associate a filename with the data blocks where the first content is stored. When a second content that is a duplicate of the first content is to be stored, then a parent inode is created to point to the data blocks in which a copy of the first content is stored. Further, two inodes are created, one representing the first content and the other representing the second content. Both inodes point to the same parent inode that points to the data blocks where the first content is stored.

Abstract: In accordance with one or more embodiments, an inode implemented file system may be utilized to support both offline and inline deduplication. When the first content is stored in the storage medium, one inode is used to associate a filename with the data blocks where the first content is stored. When a second content that is a duplicate of the first content is to be stored, then a parent inode is created to point to the data blocks in which a copy of the first content is stored. Further, two inodes are created, one representing the first content and the other representing the second content. Both inodes point to the same parent inode that points to the data blocks where the first content is stored.

Abstract: A method for storing an information block that includes determining to store a current version of an information block stored in a memory unit. The checking if a current version of the information is already stored in a storage unit. The current version of the information block is sent from the memory unit to the storage unit if the answer is negative. Generating storage unit location information indicative of a location, at the storage unit, of the current version of the information block if the answer is positive.

Abstract: A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.

Abstract: A method for storing an information block that includes determining to store a current version of an information block stored in a memory unit. The checking if a current version of the information is already stored in a storage unit. The current version of the information block is sent from the memory unit to the storage unit if the answer is negative. Generating storage unit location information indicative of a location, at the storage unit, of the current version of the information block if the answer is positive.

Abstract: A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.