Abstract: A distributed backup method includes defining a server group having a plurality of server computers, and providing each server computer with an identical backup policy and an identical storage policy. The method also includes transmitting, at each server computer of the server group to every other server computer of the server group, advertisement messages describing available storage space for storing backups, and receiving, at each server computer from the server, at least some of the advertisement messages. The method also includes identifying, at a first server computer using the backup policy, at least a first service to be backed up, selecting a second server computer using the received advertisement messages, transmitting, from the first server computer to the second server computer, a backup including information corresponding to the at least one service, and storing the backup, by the second server computer using the storage policy.

Abstract: The present disclosure provides an advantageous systems and related methods for scalable object storage. One embodiment relates to a system that includes at least a manifest tracking subsystem and a chunk payload subsystem. The manifest tracking subsystem stores version manifests and encodes forward-references from the version manifests to chunks. The chunk payload subsystem stores the chunks and encodes back-references to version manifests that reference the chunk. Other embodiments, aspects and features are also disclosed.

Abstract: A method for defragmenting volumes in a mirrored system. The method includes suspending one or more updates from being mirrored from a first set of tracks on a first server to a second set of tracks on a second server. A defragmenting process is performed on the second server. The defragmentation process stores a before and after mapping of the second set of tracks, wherein the before and after mapping includes information identifying at least one track of the second set of tracks and a corresponding first location of the respective track before the defragmenting and a second location of the respective track after the defragmenting. The method further includes, upon the defragment process completion, relocating at least one track of the first set of tracks on the first server according to the stored before and after mapping of the corresponding second set of tracks on the second server.

Abstract: A method for automatically encrypting files is disclosed. In some cases, the method may be performed by computer hardware comprising one or more processors. The method can include detecting access to a first file, which may be stored in a primary storage system. Further, the method can include determining whether the access comprises a write access. In response to determining that the access comprises a write access, the method can include accessing file metadata associated with the first file and accessing a set of encryption rules. In addition, the method can include determining whether the file metadata satisfies the set of encryption rules. In response to determining that the file metadata satisfies the set of encryption rules, the method can include encrypting the first file to obtain a first encrypted file and modifying an extension of the first encrypted file to include an encryption extension.

Abstract: A method for managing data in a Quality-of-Storage (QoSt) network comprising a plurality of nodes includes receiving current QoSt network topology information. A plurality of data streams is received at a data storage interface of the QoSt network. Differentiated treatment is performed upon received data streams in the data storage interface. Such differentiated treatment is contingent upon at least different types of data in the received data streams based on a plurality of QoSt attributes. A plurality of data management operations is performed on the data obtained by the plurality of data streams based on the data storage interface and based on received current QoSt network topology information.

Abstract: A method, system and computer program product for resolving values of parameters of tags. A map is created which includes the number of times each parameter is referenced by the tags in a web page requested by a client device. The parameters in the map are then sorted in a list in descending order based on the number of times referenced by the tags. The value for the parameter listed at the top of the list is looked up. If the value cannot be located, then those tags that are associated with this parameter are added to a list of tags to be ignored. By ignoring such tags in this list, the resolving of tag values for tags to be syndicated can occur more quickly and efficiently, including syndicating the tag data before the web page is completely loaded.

Abstract: A search engine index measures and tracks one or more numeric indicators of activity at different times, including a most current time, in on-line forums and social networking sites. Such indicators may include, for example, a current volume per unit time of messages or data posted to the site, a moving average of such volume, a moving average of current participants over time, a count of current participants, other indication of site activity, or any combination of such indicators. The search engine is responsive to queries seeking forums ranked by activity for a defined time period, including a most current time. The search engine prioritizes search results to identify the specified sites or locations in order of activity (among other possible criteria) relative to a defined time.

Abstract: A method for sharing an email in a multi-tenant database system is provided. The method receives, at one or more computer systems associated with the multi-tenant database system, the email from a first user; determines, at the one or more computer systems, a database object associated with the email; maps, at the one or more computer systems, the email to the associated database object; and provides viewing access to the email to a second user with access rights to the database object.

Abstract: A method begins by a dispersed storage (DS) processing module traversing multiple index structures based on search criteria to identify an object retrieval structure. The method continues with the DS processing module retrieving a set of encoded data slices corresponding to the object retrieval structure from a dispersed storage network (DSN) and decoding the set of encoded data slices in accordance with a dispersed storage error coding function to recover the object retrieval structure. The method continues with the DS processing module identifying one of one or more data version records of the recovered object retrieval structure based on the search criteria to produce an identified data version record and determining DSN addressing information for at least a portion of data based on information of the identified data version record.

Abstract: A method for achieving optimal use of compute, storage and network resources in a distributed computing system is provided. In one embodiment, a job request associated with a file is submitted. A Job Scheduler in conjunction with a workflow manager determines the best fit for dynamically chunking size of the file. The distributed storage subsystem provides a dynamic view to the compute resources where the job will be run. This knowledge is also used to pre-staging the data by the distributed storage subsystem. Furthermore, keeping a history of the job and their data allows for further improvements in resources and job execution times by being able to skip processing on data that has been done previously. Given the ability to chunk the file dynamically, it is possible to re-balance resources for running the job dynamically to meet its service level agreement.

Abstract: A dispersed storage processing unit selects a slice length for a data segment to be stored in a dispersed storage network (DSN). The data segment is encoded using a dispersed storage error coding function to produce a set of data slices in accordance with the slice length. A storage file is selected based on the slice length. A storage file identifier (ID) is generated that indicates the storage file. A set of DSN addresses are generated corresponding to the set of data slices, wherein the set of DSN addresses each include the storage file ID and a corresponding one of a plurality of offset identifiers (IDs). The set of data slices are written in accordance with the set of DSN addresses. A directory is updated to associate the set of DSN addresses with an identifier of the data segment.

Abstract: A system, a method, and a computer program product for managing delta version chains are provided. A version chain having a plurality of versions of data is provided. A first delta-compressed version and a second delta-compressed version corresponding to a first version of data in the version chain and a second version of data in the version chain, respectively, are selected. A third delta-compressed version configured to be independent of at least one of the first delta-compressed version and the second delta-compressed version and further configured to contain at least one third instruction determined based on at least one of the following: the first insert instruction, the second insert instruction, the first copy instruction, and the second copy instruction, is generated.

Abstract: Systems and methods for cloning a cloud node are disclosed. For example, one disclosed method for cloning a cloud node comprises identifying changes during editing of content over a predetermined interval in an author node, compiling, via a replication agent of the author node, all changes of the content identified during the predetermined interval, all of the changes compiled in a replication queue maintained by the replication agent, and at the end of the predetermined interval, providing all of the changes of the content identified during the predetermined interval from the replication queue to both the publisher node and a clone of the published node.

Abstract: The data storage system according to certain aspects can filter secondary copies of data (e.g., backups, snapshots, archives, etc.) generated by multiple client computing devices into a single, filtered, global reference copy. A reference copy may be a filtered view or representation of secondary storage data in a data storage system. A reference copy may include a data structure that includes references to a subset of secondary storage data that meets certain filtering criteria. The filtering criteria may be specified by users according to user preference. Data included in a reference copy may be stored in native format (e.g., format of the application that generated the data) and be accessible through the application associated with the data.

Abstract: A multiversioned position-space indexing system is disclosed. The system includes data structures for maintaining a multiversioned position space including a multi-versioned filter merge list which represents many versions of a changing position space in a very compact form and a position shift map which describes how to translate stored positions in many different log-structured merge tree layers into logical positions at a particular timestamp. Each log-structured merge tree layer can be divided into two sublayers: a final sublayer and a correction sublayer. The final sublayer contains index entries added after the layer's start timestamp and remain live as of the layer's final timestamp as well as deletion makers for index entries that were inserted before the layer's start timestamp, but deleted before the layer's final timestamp. The correction layer contains index entries that were both created and deleted between the start and end timestamps of the layer.

Abstract: A system for a mass centralization approach to full image cloning of multiple computing devices is provided. The system includes a plurality of computing devices and a server. The server includes a processor programmed to receive, from the plurality of computing devices, metadata for files stored on the plurality of computing devices, determine, from the received metadata, an importance level for each of the files, instruct the plurality of computing devices to send a copy of the files to the server in a defined order, the defined order based on the importance level for each of the files, and store the copy of the files on the server.

Abstract: A system comprises a processor and a memory. The processor is configured to decompress a precompressed file; recompress the decompressed file; and determine a difference file. The memory is coupled to the processor and configured to provide the processor with instructions.

Abstract: A persistent random-access, byte-addressable storage device may be simulated on a persistent random-access, block-addressable storage device of a storage system configured to enable asynchronous buffered access to information persistently stored on the block-addressable device. Buffered access to the information is provided, in part, by a portion of kernel memory within the storage system allocated as a staging area for the simulated byte-addressable storage device to temporarily store the information destined for persistent storage. One or more asynchronous interfaces may be employed by a user of the simulated byte-addressable device to pass metadata describing the information to a driver of the device, which may process the metadata to copy the information to the staging area. The driver may organize the staging area as one or more regions to facilitate buffering of the information (data) prior to persistent storage on the block-addressable storage device.

Abstract: In accordance with aspects of the disclosure, systems and methods are provided for scheduling migration events for server resources in a server cluster relative to a time interval while considering load balance constraints and data transfer constraints of the server cluster. The systems and methods may include generating one or more potential migration scheduling schemes for migration of each server resource to at least one other server resource in the server cluster within the time interval while considering the load balance constraints and the data transfer constraints of the server cluster, and generating a migration event schedule for each migration event within the time interval based on the one or more potential migration scheduling schemes generated for migration of each server resource to at least one other server resource in the server cluster.

Abstract: Embodiments of the present invention are directed to a method and system for optimizing replication within a storage system utilizing multiple tiers by using tier-specific replication modes. The method includes receiving, within an electronic system having a plurality of tiers, an access request for a portion of storage associated with a first tier of the plurality of tiers and accessing a replication attribute corresponding to the first tier and also corresponding to a replication mode. The method further includes sending the access request to the portion of storage; and replicating the access request to a remote storage wherein the replicating is based on the replication mode and wherein each of the plurality of tiers have associated therewith a respective replication attribute defining a respective replication mode.

Abstract: A device stores program code in a plurality of slots in its memory. When a processor of the device receives a call to an encrypted function, it uses a slot table to find the location of the cipher function and the cipher module and the key to decrypt the encrypted module. The encrypted module is decrypted, executed, re-encrypted and moved to a new memory slot. The cipher function used is moved to a further new slot and the slot table is updated. Also provided is a method and a computer program support. The invention can make it more difficult to analyse execution traces of the program code.

Abstract: A technique for managing a file system includes dividing the addressable space of a file system into multiple subspaces: a data subspace for user data; an inode subspace for inodes describing the user data; and an MDB (metadata block) subspace for indirect blocks and/or directory structures pertaining to the user data. In response to storage requests to write user files to the file system, the file system stores user data of the files in the data subspace, stores inodes pertaining to the user files in the inode subspace, and stores indirect blocks and/or directories in the MDB subspace.

Abstract: Technologies for adaptively striping data across multiple storage clouds include receiving user constraints corresponding one or more cloud storage providers, receiving a file to be striped across the cloud storage providers, splitting the received file into file blocks, allocating each of the file blocks to a different one of the cloud storage providers as a function of the user constraints and operating conditions of each of the cloud storage providers, and sending each of the file blocks to the cloud storage provider to which each file block is allocated. In some embodiments, file blocks may be re-allocated from one cloud storage provider to another cloud storage provider as a function of changing user constraints or operating conditions. In addition, each of the file blocks may be retrieved from the cloud storage providers to re-assemble the file.

Abstract: Systems and methods for simulation within a cloud computing environment. According to one embodiment, the system or method comprises a cloud computing environment with infrastructure management software and a cloud-based managed infrastructure. An interface is identified within infrastructure management software by first identifying a dataflow from the infrastructure management software to the infrastructure, and then, based on the dataflow, identifying a component within the infrastructure management software that is interacting with the infrastructure. A simulation class is then implemented using the identified interface, where the simulation class populates the infrastructure management software with metadata from an infrastructure database such that the infrastructure is simulated.

Abstract: In accordance with the disclosure, there is provided a system and method for creating and maintaining unique data repository comprising a matching process based on a set of predefined matching conditions and thereon performing an action type corresponding to the outcome of matching process. The present disclosure provides for real time data de-duplication and updation of unique data repository to obtain a unified view of unique and matching records.

Abstract: A method and system for anonymizing data to be transmitted to a destination computing device is disclosed. Anonymization strategy for data anonymization is provided. Data to be transmitted is received from a user computer. The data includes a plurality of fields. One or more fields are selectively extracted. A hash using the extracted fields is computed. The computed hash is stored. Anonymization of the data is performed, using an anonymization module. Anonymized data is transmitted to the destination computing device over a network.

Abstract: A computer-based system includes a backup server, a production server, a recovery agent that executes on the production server, a database on the production server, a backup database on the backup server, and a meta data file on the backup server. The meta data file includes file names, a file directory, and file attributes. The system is configured to copy the metadata file from the backup server to a production server. When the copying of the metadata file from the backup server to the production server is complete, and before or during a time period in which backup data is copied from the backup server to the production server, the system is configured to receive a request from the production server to restore a file from the backup server with a higher priority than other files on the backup server.

Abstract: In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold.

Abstract: A method for managing records in an object-oriented database is disclosed. Modified representations of data in fields of records is generated in response to patterns in the data. The modified representations of the data is compressed utilizing similarities in the modified representations of the data.

Abstract: In one embodiment, a method includes identifying at a network device, characteristics of a distributed virtual switch comprising a control plane component and a plurality of data plane components, grouping the data plane components, and adapting operation of the distributed virtual switch for one or more groups of the data plane components based on the characteristics. An apparatus and logic are also disclosed herein.

Abstract: Systems for deduplicating one or more storage units of a storage system provide a scheduler, which is operable to select at least one storage unit (e.g. a storage volume) for deduplication and perform a deduplication process, which removes duplicate data blocks from the selected storage volume. The systems are operable to determine the state of one or more storage units and manage deduplication requests in part based state information. The system is further operable to manage user generated requests and manage deduplication requests in part based on user input information. The system may include a rules engine which prioritizes system operations including determining an order in which to perform state-gathering information and determining an order in which to perform deduplication. The system is further operable to determine the order in which storage units are processed.

Abstract: A system and method for securely storing, retrieving and sharing data using PCs and mobile devices and for controlling and tracking the movement of data to and from a variety of computing and storage devices.

Abstract: Automatically aligning virtual blocks of partitions to blocks of underlying physical storage is disclosed. In some embodiments, a starting offset of a partition included in a logical container is detected. In some embodiments, a misalignment correction amount for a partition included in a logical container is detected. In some embodiments, a misalignment associated with a partition included in a logical container is corrected.

Abstract: Methods, systems, and techniques for federating operations, in an optimized way using wide area networks are provided. Example systems provide an API for generating and handling federated requests as an aggregation. In one example Wide Area Network Aggregation System, WANAS provides an API, a connection manager, and connection iterators to manage inter-site connections and requests, and inter-pod requests and messaging. These components cooperate to distribute a task across multiple physically disparate sites using a representative connection to the site and fan out of requests to other pods within the site.

Abstract: Techniques for computer system recovery which remotely restore a default partition to a recent state even when an operating system is functioning abnormally. In an example embodiment, a service center computer establishes a first network connection to a monitored computer system. The service center computer configures the monitored computer system to boot from a bootable image file in the monitored computer system and reboots the monitored computer system into an alternate operating system environment of the bootable image file. The service center computer establishes a second network connection to the monitored computer system to restore a recent backup image of the default partition from a diagnostic partition to a default partition. The service center computer establishes a third network connection to the monitored computer system and reboots the monitored computer system to the default partition.

Abstract: A computer-implemented method for enabling deduplication of attachment files within a database is described. A database file comprising data blocks of an attachment file positioned intermittently among data blocks of the database file is inspected. A first map may be generated from the inspection of the database file and the attachment file. The data blocks of the database file and the data blocks of the attachment file are identified according to the first map. The data blocks of the database file are written to a database data file. The data blocks of the attachment file are written to an attachment data file. The attachment data file is deduplicated with at least one other data file.

Abstract: Embodiments of the invention relate to synchronization of data in a shared pool of configurable computer resources. An image of the filesystem changes, including data and metadata, is captured in the form of a consistency point. Sequential consistency points are created, with changes to data and metadata in the filesystem between sequential consistency captured and placed in a queue for communication to a target filesystem at a target site. The changes are communicated as a filesystem operation, with the communication limited to the changes captured and reflected in the consistency point.

Abstract: Hard link handling for incremental file migration is described. A file is stored on a storage device. A determination is made whether a path associated with the file is also associated with an index node number in a hard link table. The file is deleted from the storage device if the path associated with the file is also associated with the index node number in the hard link table. The path is linked on the storage device with another file that is associated with another path that is associated with the index node number in the hard link table.

Abstract: Systems and methods for replicating data from a master server to a replica or backup server include capturing a read event associated with a retrieved file at the master server. The retrieved file may be generated by updating a reference file with remotely stored data. Attributes associated with the retrieved file may be checked to determine if they include attributes associated with the reference file, and if they do not, at least a portion of data and one or more attributes of the retrieved file may be copied or replicated to the replica server. The captured read event may be generated when an application attempts to access or read the retrieved file. An event associated with generation of the reference file may also be captured at the master server, and copies to the replica server.

Abstract: The management system includes pair management information for managing pair groups and resource management information for managing resources allocated to the pair groups. The management system monitors data transfer latencies in asynchronous remote copy in the pair groups. In a case where data transfer latencies in a first pair group of the pair groups reach a threshold, the management system selects a first asynchronous remote copy pair from the first pair group with reference to the pair management information. The management system selects a second pair group allocated resources different from resources allocated to the first pair group as a candidate migration destination of the first asynchronous remote copy pair with reference to the resource management information.

Abstract: Provided are, among other things, systems, methods, apparatuses and techniques for storing access grants. In one implementation, a blinding factor and access information for accessing a restricted object are obtained; blinded access information is generated for the restricted object based on the access information and the blinding factor; and an anchor node is stored into a data store, with the anchor node being accessible by submission of an identifier, the anchor node at least one of containing or referring to sufficient information to obtain access to the blinding factor and the blinded access information, and the identifier for the anchor node being independent of the blinding factor.

Abstract: Applications, systems and methods for backing up data include securely connecting at least first and second privately addressed computers over a network, wherein at least one of the computers is connectable to the network through a firewall element. At least a portion of a first version of a file is sent from the first computer to the second computer. The file or portion of a file sent from the first computer is compared with a corresponding version of the file or portion stored at the location of the second computer, and at least one of the versions is saved at the location of the second computer.

Abstract: The environment and use of an immutable buffer. A computing entity acquires data or generates data and populates the data into the buffer, after which the buffer is classified as immutable. The classification protects the data populated within the immutable buffer from changing during the lifetime of the immutable buffer, and also protects the immutable buffer from having its physical address changed during the lifetime of the immutable buffer. As different computing entities consume data from the immutable buffer, they do so through views provided by a view providing entity. The immutable buffer architecture may also be used for streaming data in which each component of the streaming data uses an immutable buffer. Accordingly, different computing entities may view the immutable data differently without having to actually copy the data.

Abstract: Techniques for determining optimal time window for data movement from a source storage system to a target storage system are described herein. According to one embodiment, statistics data is received representing historic performance statistics over a predetermined period of time by a source storage system, where the historic performance statistics include resource consumption of a plurality of resources including at least one of a processor, memory, input-output (IO) transactions, and network bandwidth. An analysis is performed by an analysis module executed by a processor on the historic performance statistics to determine an optimal time window within the predetermined time period for data movement from the source storage system to a target storage system based on the analysis. A scheduler executed by the processor is to schedule the data movement from the source storage system to the target storage system according to the optimal time window.

Abstract: Managing different versions of a data record is provided. A mapping is maintained between a version-independent logical record identifier and a version-dependent physical record row identifier that correspond to each data record within a plurality of data records of a data table using a logical record identifier to physical record row identifier indirection mapping table. Entries within leaf pages of an index associated with the data table are updated to point to the version-independent logical record identifier corresponding to a data record instead of pointing to the version-dependent physical record row identifier corresponding to the data record. The logical record identifier to physical record row identifier indirection mapping table is updated in response to performing an operation on the data record instead of updating the entries within the leaf pages of the index associated with the data table.

Abstract: Techniques are provided for storing files in a parallel computing system using different resolutions. A method is provided for storing at least one file generated by a distributed application in a parallel computing system. The file comprises one or more of a complete file and a sub-file. The method comprises the steps of obtaining semantic information related to the file; generating a plurality of replicas of the file with different resolutions based on the semantic information; and storing the file and the plurality of replicas of the file in one or more storage nodes of the parallel computing system. The different resolutions comprise, for example, a variable number of bits and/or a different sub-set of data elements from the file. A plurality of the sub-files can be merged to reproduce the file.

Abstract: A method, computer program product, and system for executing and administering queries in a data management system, and particularly a relational data management system. Logical objects can be queried by providing a translation from a logical query in a pre-defined logical schema to a physical query against the physical data management system, such as by translating a database query constructed using an Object Query Language (OQL) into a query in Structured Query Language (SQL) without the user needing to know the details of the physical data management system such as the structure of the underlying relational databases.

Abstract: A file upload widget is provided on a website to enable the upload of files to a website from an account within a content management system. The file upload widget may be used to: (1) allow a user to select files from a content management system, such as a synced online content management system; and (2) initiate the upload of the files directly from the content management system to the website. In various embodiments, this may: (1) allow the user to upload files that are not stored locally on the computing device being used to access the file upload widget; and (2) allow the user to complete the upload of files by initiating the transfer of files and then logging off of the website (and/or powering down their computing device) before the transfer of files is complete, which may result in a more convenient and enjoyable upload process.

Abstract: A virtual disk image manager running on a computing device determines that an operation is to be performed on a virtual disk image. The virtual disk image manager then determines whether an underlying storage domain on which the virtual disk image is stored supports the operation. In response to determining that the storage domain supports the operation, the virtual disk image manager uses native capabilities of the storage domain to perform the operation. In response to determining that the storage domain does not support the operation, the virtual disk image manager performs the operation without the use of the storage domains native capabilities.

Abstract: Some embodiments are directed to replicating a content unit stored in a first storage environment comprising a first plurality of storage clusters to a second storage environment comprising a second plurality of storage clusters. The first storage environment may employ a replication policy, instituted at a first time, that specifies to which one of the second plurality of storage clusters content units stored in the first storage environment are to be replicated. The creation time of the first content unit may be determined and it may be determined when the creation time is before the time at which the first storage environment instituted the replication policy. If the creation time is not before the first time, one of the second plurality of storage clusters may be selected to which to replicate the first content unit based on the replication policy, and the content unit may be replicated to the selected one of the second plurality of storage clusters.