Abstract:
A technique and mechanism to effect cross-pollination synchronization of PIM (personal information manager) data to multiple sources. Additionally, a novel feature of the subject invention is the ability to effect cross-pollination synchronization with any number of devices and sources in a network. The invention provides for a user to employ a mobile device or set of devices as a central repository for PIM data (e.g., calendar, contacts and tasks) synchronized from multiple sources (e.g., multiple PC's (personal computers), an exchange server). The invention provides for synchronization of PIM data from multiple types of server sources to multiple devices regardless of the synchronization protocol versions and different schemas.
Abstract:
A partnership object is created to manage interactions between objects in an object oriented computing environment. An interaction license is issued by a licensing framework executing on a computing device to each of a group of objects indicating that the group of objects is authorized to form partnerships, where the group of objects interact by requesting formation of the partnerships using the provided interaction licenses. A first object requests to interact with a second object. A partnership object is created and each of the first and second objects is provided with a reference to the partnership object. The request from the first object may include identifiers of licenses associated with the first and second object and the partnership object may be created only if both licenses are validated. The first object then is able to interact with the second object by using the reference to the partnership object.
Abstract:
This storage controller providing a volume for storing data transmitted from a host system includes a management unit for managing the data written in the volume with a first block area, or a second block area in the first block area which is smaller than the first block area; a snapshot acquisition unit for acquiring a snapshot of the volume at a prescribed timing; and a transfer unit for transferring the data of the volume acquired with the snapshot of the snapshot acquisition unit to an external device with the first block area or the second block area.
Abstract:
A technique for synchronizing a datum between a plurality of stores, wherein a version history is associated with the datum in each store. The version history has one or more entries, and each entry has an identifier and a value. The identifier identifies a store that has modified the datum, and indicates a number of modifications to the datum. When synchronizing the datum between stores, the version histories of the datum are compared to determine whether one version history is subordinate to another version history. The datum having the subordinate version history is then replaced with the datum having the dominant version history. Conflict resolution is required if the version histories are not identical, if the version histories do not have the same identifiers, and if one version history does not contain all of the identifiers with equal or greater values of those in the other version history.
Abstract:
A method for replicating a deduplicated storage system is disclosed. A stream of data is stored on an originator deduplicating system by storing a plurality of deduplicated segments and information on how to reconstruct the stream of data. The originator deduplicating system is replicated on a replica system by sending a copy of the plurality of deduplicated segments and information on how to reconstruct the stream of data to the replica system. A first portion of the deduplicated segments stored on the originator deduplicating system that is corrupted is identified. A copy of the first portion of the deduplicated segments is requested to be sent by the replica system to the originator deduplicating system.
Abstract:
Integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The present invention uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The present invention writes on the disk with the lowest CWL pointer. A new disk is chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks are defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.
Abstract:
A system and method for generating a virtual tour on a display device is described. The method comprises providing at least one map. The method further comprises providing a plurality of sequenced images, wherein each of the images is associated with at least one location by a geo-coding module configured to generate a geo-location object data sheet that associates sequential images with a corresponding location. The sequenced images are organized based on the location of each of the sequenced images and displayed on the map. The method is implemented by the system.
Abstract:
A method of dynamically sharing a media volume in a network includes associating a first media management module with a first media volume of a first storage device, associating a second media management module with the first media volume, the second media management module mounting the media volume and creating an access path to the media volume, and delegating management of the created access path to the second media management module.
Abstract:
The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database.
Abstract:
A write-once-read-many (WORM) storage system that employs large-capacity and relatively inexpensive disks in connection with a file system on a file server is provided. The file system contains most or all of the required WORM functionality so as to impose a minimal footprint on client applications, client operating systems and open protocols if desired. The system is organized around WORM storage volumes that contain files that, when committed to WORM storage, cannot be deleted or modified. Any file path or directory tree structure used to identify the file within the WORM volume is locked and cannot be deleted. In one embodiment, the administrator creates a WORM volume, capable of storing designated WORM files. The client then creates an appropriate WORM file using the appropriate protocol semantics. The file is written to the volume and committed by transitioning the file attributes from a not-read-only to a read-only state. The file system recognizes the persistently stored WORM attribute of any file in a WORM volume as WORM file. Henceforth, any attempt to modify the file attributes, write to the file, or delete the file, by clients, administrators or other entities is rejected and a request denied message is returned to the attempting party.