International Business Machines Corporation

Dalit Naor

Jeffrey Bruce Lotspiech

Danny Harnik

Simeon Naor

Florian Pestoni

Sigfredo Ismael Nin

Michael Edward Factor

Joseph S Glider

Elliot Karl Kolodner

Demyn Lee Plantenberg

Gil Vernik

Nimrod Megiddo

Frank Andre Schaffa

Dmitry Sotnikov

Oded Margalit

Eric M Foster

David Blair Whitworth

Paula Kim Ta-Shma

Wilfred Edmund Plouffe, Jr

Ronen Itshak Kat

Itai Segall

Simona Cohen

Lee Charles LaFrese

Ronald Fagin

Sivan Tal

Eran Rom

Amir Herzberg

Miriam Allalouf

Eldad Shai

Tal Sivan

Shahar Ronen

Leeat Ramati

Petra Reshef

Boaz Barak

Ariel Virgil Mirles

A computer-implemented method for determining whether to perform a pushdown may include receiving a request for analytics to be performed by an analytics platform on data stored in bulk storage. An operation may be identified as a candidate for a pushdown, where the operation is selected from among one or more operations to be performed for fulfilling the request. The pushdown would require the operation to be performed at the bulk storage. The data may be sampled by reading one or more samples of the data, where the one or more samples are a fraction of the data. The operation may be performed, by a computer processor, on the one or more samples. It may be determined, based on performing the operation on the one or more samples, whether to perform the pushdown of the operation.

Selective operation pushdowns from an analytics platform to bulk storage

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.

Efficient file system object-based deduplication

Systems and methods for optimizing deduplication in a data storage system are provided. The method comprises associating a first name with first data blocks including first content stored in a data storage system, wherein the first name is associated with the first data blocks by way of a reference to a first meta file that points to a data file which points to the first data blocks; storing a first signature derived from the first content in an indexing data structure, wherein the first signature is used to associate the first name with the first data blocks and as means to verify whether a second content is a duplicate of the first content, based on value of a second signature derived from the second content.

File system object-based deduplication

The present invention provides a method, system and program product for modifying content usage conditions during broadcast content distribution. Specifically, the present invention allows protected (e.g., encrypted, secured, etc.) content to be received along with content usage conditions, an encrypted combination of the content usage conditions and a title key (e.g., a MAC), and a key management block. Using the key management block, a key encrypting key can be determined for decrypting the combination. Once the combination is decrypted, the content usage conditions can be modified (e.g., edited, added to, etc.).

Method, system and program product for modifying content usage conditions during content distribution

Systems and methods for estimating data reduction ratio for a data set is provided. The method comprises selecting a plurality of m elements from a data set comprising a plurality of N elements; associating an identifier hfor each of the plurality of m elements; associating an identifier hfor each of the plurality of elements in the data set; tracking number of times an element i appears in a base set that includes the plurality of m elements selected from the data set; calculating a value countthat indicates the number of times an identifier hmatches an identifier h; and estimating data reduction ratio for the plurality of N elements in the data set, based on number of m number elements selected from the data set and the value count.

Estimation of data reduction rate in a data storage system

A method for determining power consumption in a data storage system is provided. The method comprises determining data access patterns for at least a first storage device in a storage system based on operations performed by the first storage device; and calculating power consumption for the storage system by interpolating costs associated with the operations performed by the first storage device, wherein the cost associated with each operation is determined based on: (1) various levels of activities for the first storage device and a mix of workload characteristics, and (2) predetermined power consumption measurements obtained from one or more benchmarks for same operations performed by a second storage device in a test environment.

Estimating power consumption in a computing environment

A novel and useful method of implementing a full coverage low power mode in a storage system comprised of one or more memory storage devices storing replicated data items. A subset of the memory storage devices is chosen whose replicated data items require the least amount of storage. If the chosen subset stores uncovered data items, these data items are copied to an auxiliary memory storage device. The storage system can enter a full coverage low power mode by powering down the chosen subset of memory storage devices.

Method of a full coverage low power mode for storage systems storing replicated data items

A computer based method for the preservation of a digital information in a data set includes receiving a data set to be preserved, the data set including a plurality of preservation objects; creating a fixity table, the fixity table including one or more data types corresponding to preservation data types contained in the preservation objects, each data type being assigned an importance rank and one or more fixity function; for each preservation object, creating a Merkle tree corresponding to the preservation object and based on the fixity table.

Preservation aware fixity in digital preservation

A tree is used to partition stateless receivers in a broadcast content encryption system into subsets. Two different methods of partitioning are disclosed. When a set of revoked receivers is identified, the revoked receivers define a relatively small cover of the non-revoked receivers by disjoint subsets. Subset keys associated with the subsets are then used to encrypt a session key that in turn is used to encrypt the broadcast content. Only non-revoked receivers can decrypt the session key and, hence, the content.

Method for broadcast encryption and key revocation of stateless receivers

A method for enforcing compliance in both the copy protect domain and service subscription domain for streamed multicast data. Each content is encrypted with a title key that itself is encrypted with a channel unique key which is a hash of a session key and a channel key. A compliant player is given the channel key upon registration for a subscription service (representing subscription protection) and is also given device keys upon activation (representing copy protection) for decrypting the session key. Consequently, the channel unique key can be obtained (and, hence, the content decrypted) only by a player that is compliant with both copy protection rules and subscription rules. The channel key can be refreshed periodically as subscriptions change or expire.

Method for ensuring content protection and subscription compliance

The present invention provides for the protection of and ability to upgrade to new formats of digital content by providing consumers of the digital content the capability of purchasing content insurance on digital content they consume. By purchasing insurance on content, at a later time consumers are able to return to the content distribution channels and re-obtain the previously purchased content in the same, or new format as the original purchased.

Content insurance

A method for tracing traitor receivers in a broadcast encryption system. The method includes using a false key to encode plural subsets representing receivers in the system. The subsets are derived from a tree using a Subset-Cover system, and the traitor receiver is associated with one or more compromised keys that have been obtained by a potentially cloned pirate receiver. Using a clone of the pirate receiver, the identity of the traitor receiver is determined, or the pirate receiver clones are rendered useless for decrypting data using the compromised key by generating an appropriate set of subsets.

Method for tracing traitor receivers in a broadcast encryption system

A method for providing a proactive security in proactive operating environment. The proactive operating environment includes a group of proactive servers communicating over a network. Each proactive server (PS) includes a storage that includes a non erasable part that stores a public, non proactive related, key V. The storage further includes an erasable part for storing private and public data. The proactive server has a discardable one-time private key Sthat corresponds to the public key V. The proactive server further has configuration data C. There is further provided a processor for providing a proactive services to applications. The proactive server has a group public proactive key Vcommon to the group of proactive servers and a share Sof a corresponding private proactive key S. The method further includes the steps of invoking initialization procedure for generating restore related information, and invoking a restore procedure for utilizing the public, non proactive related, key Vand the restore related information for restoring the public proactive key V.

Growing community of inventors

Palo Alto, CA, United States of America

Dalit Naor