Abstract: A method for storing a data block, including storing the data block in a storage pool, obtaining a data block location, calculating a secure data block checksum for the data block, and storing a first indirect block in the storage pool, wherein the first indirect block comprises the data block location and the secure data block checksum.
Abstract: A terminal for displaying, retrieving, inputting and processing data for the user comprises a central unit, a storage unit connected to the processor of the central unit, a storage unit, elements for communicating with a connection network with access/service provider, a connection interface with a peripheral, a display screen, a keyboard and electrical power. The terminal further comprises a storage unit with confidential access for personal data of a user, elements for identifying an authorised user and encryption/decryption elements. The identification elements are insertible in reading elements and comprise a processor, identification data storing elements, data encrypting/decrypting key generating elements.
Abstract: A technique for improving the efficiency of a loop detecting, reference counting storage reclamation program in a computer system. A depth value is maintained for data objects in a memory resource to indicate a distance from a global, live data object. A reference count is also maintained based on a number of objects pointing to each object. A particular object is processed by the storage reclamation program when another object that previously pointed to the particular object no longer points to it, e.g., because the object was deleted or reset to point to another object, and when the depth value of the another object is one less than the depth value of the particular object. If the particular object is determined to be live, its depth value, and the depth values of other objects it points to or “roots” are reset. If the particular object is dead, it is cleaned up.
Type:
Grant
Filed:
July 15, 2003
Date of Patent:
January 1, 2008
Assignee:
International Business Machines Corporation
Abstract: A method and system for accessing network directory data as uses a Web service as an interface between a directory database and network clients. To support extensibility of the object types in the directory database, directory access methods are defined for a generic object class from which classes for different directory object types are derived. A description of the object classes and database operation methods is provided by the Web service to the client. To access the directory database, the runtime environment of the client is used to create objects on which a requested directory operation method operates according to the proper class definitions of the object types. The request with serialized objects is sent to the Web service, which then uses information provided by the objects in the request to access the directory database to carry out the requested directory operation method.
Abstract: A method, system and article of manufacture for processing aggregation queries that are executed against a database and, more particularly, for managing aggregation data structures associated with tables of a database. One embodiment provides a method for managing creation of aggregation data structures for tables of a database.
Type:
Grant
Filed:
February 26, 2004
Date of Patent:
September 25, 2007
Assignee:
International Business Machines Corporation
Inventors:
Eric L. Barsness, Daniel E. Beuch, Randy W. Ruhlow, John M. Santosuosso
Abstract: The method applies to a structured document presenting a hierarchical structure defined by a structure schema, the document combining a main structured set of information including information subsets at least some of the information subsets being structured and being capable of including information subsets of lower hierarchical level, each information subset being associated in the higher level information set with a respective information type.
Abstract: One embodiment of the present invention facilitates skewing a bi-directional object layout to provide good cache behavior. During operation, the system receives a request to access an object. This request includes an object identifier and an object offset that specifies the offset of a target field within the object, wherein the object has a bi-directional layout that locates scalar fields at positive offsets and reference fields at negative offsets, so that a reference field can be immediately identified from its object offset. Next, the system determines a skew value for a cache line containing the object, wherein data within the cache line is shifted based upon the skew value, so that reference fields with small negative offsets are likely to be located in the same cache line as scalar fields with small positive offsets. Next, the system uses the skew value in accessing the object.
Type:
Grant
Filed:
January 2, 2003
Date of Patent:
July 17, 2007
Assignee:
Sun Microsystems, Inc.
Inventors:
Mario I. Wolczko, Matthew L. Seidl, Gregory M. Wright
Abstract: Described are techniques used in connection with management and processing of configuration data and performance data about a data storage system. The data is collected by one or more agents and forwarded to store components. The store components are responsible for maintaining persistent data objects in a repository. A server may process user requests issued from one or more consoles by retrieving data from the repository and displaying information based thereon on the consoles. The data collected by the agents may be in accordance with a first object model or data representation different from another object model or data representation of the repository. The store components update the repository using data collected by the agents.
Type:
Grant
Filed:
December 31, 2002
Date of Patent:
June 5, 2007
Assignee:
EMC Corporation
Inventors:
Valery Altman, Andrew Becher, Serge Marokhovsky
Abstract: A storage service manager facilitates an operator's task for managing large-scale storage facilities. Allocating access paths on the storage network is accomplished by the use agent programs which interface to various components comprising a data path from the client to the storage system. The agent programs hide various vendor-specific and technology-dependent aspects of the storage network components from the user.
Abstract: The present invention is directed to a data storage system for use in achieving distributed data storage over a computer network. One embodiment of the data storage system comprises a storage server system that is comprised of one or more storage servers that each provide data storage, a management server system that is comprised of one or more management servers that each provide management functionality relating to the storage server system, and a driver that is capable of being associated each of the application clients that are to utilize the data storage system. A data storage configuration identifier structure whose value is updated when there is a change to the composition of the storage system or storage allocation within the storage system is used to manage data transfers between the storage system and application clients.
Abstract: Mechanisms and techniques are disclosed that maintain managed object data associated with components in a network such as a storage area network by receiving management data associated with components operating in a storage area network and matching the management data to existing objects in a managed object database. For each existing managed object that matches the management data, the system updates object data within the existing managed objects with the matching management data. For management data not matching the existing managed objects in the managed object database, the system creates at least one new managed object containing the non-matching management data.
Type:
Grant
Filed:
December 31, 2002
Date of Patent:
March 27, 2007
Assignee:
EMC Corporation
Inventors:
Francois Gauvin, Joshua Onffroy, Serge G. Marokhovsky, Steven Tanaka, Valeria Altman, Gregory N. MacKinnon
Abstract: A plurality of table-formatted data is joined by dividing each table-formatted data into one or more information blocks consisting of a value list containing item values in the order of item value numbers corresponding to item values belonging to a particular item and a pointer array containing pointer values specifying item value numbers in the order of uniquely-defined record number. When joining a plurality of table formats, equivalent items between the table-formatted data are found and value lists contained in the information block concerning the equivalent items are compared and the two value lists are made equivalent, then data of one of the table formats is sorted according to a key item and using the array obtained in this process, calculation is performed to obtain addresses indicating storage positions of record numbers of table-formatted data and other table-formatted data. Using the calculated addresses, joined table-formatted data is displayed.