Abstract: Provided are techniques for data deduplication. A chunk of data and a mapping of boundaries between file data and meta data in the chunk of data are received. The mapping is used to split the chunk of data into a file data stream and a meta data stream and to store file data from the file data stream in a first file and to store meta data from the meta data stream in a second file, wherein the first file and the second file are separate files. The file data in the first file is deduplicated.

Abstract: Provided are a system and article of manufacture for providing diagnostic information on the processing of variables in source code. Source code is scanned for an instance of a variable. An entry is added to a symbol table for the variable and indication is made in the entry that the variable is declared in response to determining that the symbol table does not include an entry for the variable and that the instance of the variable comprises a declaration of the variable. A message is generated indicating that the variable is referenced and undeclared in response to determining that the instance of the variable comprises a reference of the variable and that the symbol table does not include one entry for the variable.

Abstract: Provided are a method, system, and article of manufacture for using annotations to reuse variable declarations to generate different service functions. A declaration file has variable declarations in a first programming language environment for use by application functions. The declaration file includes a plurality of sets of annotations for a plurality of service functions. Each of the sets of annotations identifies variables in the declaration file to use with one of the service functions. The declaration file is processed to generate one of the service functions. The set of annotations in the declaration file for the service function to generate is determined. The determined set of annotations is processed to determine variables to include with the service function to generate. The determined variables from the declaration file are used to generate the service function.

Abstract: Provided are a method, system, and program performed at a local node to communicate with a remote node. A first communication protocol is used to communicate with the remote node to establish a connection for a second communication protocol. Data structures are created to enable communication with the remote node to establish the connection with the remote node for the second communication protocol. An extension layer is invoked for the second communication protocol. The data structures are passed to the extension layer to use to communicate with the remote node using the second communication protocol.

Abstract: Provided are a method, system, and article of manufacture for managing metadata for data blocks used in a deduplication system. File metadata is maintained for files having data blocks in a computer readable device. Data block metadata is maintained for each data block in the computer readable device. The data block metadata for one data block includes a data block reference and content identifier identifying content of the data block. The file metadata for each file includes the data block reference to each data block in the file. A determination is made of an unreferenced data block in the computer readable device that has become unreferenced. Indication is made that the data block metadata for the determined unreferenced data block as unreferenced metadata. The data block reference of the unreferenced metadata is maintained in the computer readable device in response to determining that a includes the data block indicated in the unreferenced metadata.

Abstract: Provided are techniques for space recovery with storage management coupled with a deduplicating storage system. A notification is received that one or more data objects have been logically deleted by deleting metadata about the one or more data objects, wherein the notification provides storage locations within one or more logical storage volumes corresponding to the deleted one or more data objects, wherein each of the one or more data objects are divided into one or more extents. In response to determining that a sparse file represents the one or more logical storage volumes, physical space is deallocated by nulling out space in the sparse file corresponding to each of the one or more extents.

Abstract: Techniques are provided for automating allocation of resources based on business decisions. An impact of a business decision is quantified in terms of information technology (IT) metrics. The resources that may be needed to address the impact are estimated. The estimated resources are provisioned.

Abstract: Provided are a method, system, and program for scheduling and searching meetings in a network environment. A form is transmitted over a network to be rendered at an organizer computer to enable entry of information on a meeting. The form is received having organizer entered information on one meeting. The information in the received form is stored in a meeting database, wherein the stored information from the received form is associated with the meeting identified in the received form. A user computer accessed by a user is enabled to register for at least one selected meeting. An email database accessed by the user is updated automatically to include information on the at least one selected meeting indicated.

Abstract: Provided are a method, system, and article of manufacture for verification of a program partitioned according to the control flow information of the program. Properties are received indicating outcome states for a program. The program is processed to determine a control flow in the program and paths in the control flow. Enabled paths are determined in the control flow having states satisfying requirements of the outcome states. For each enabled path, a determination is made of inert variables not used along the control flow of the path and a representation of states and transitions for the enabled path is generated, wherein the represented states and transitions do not include the inert variables. The generated representation of the states and transitions for the enabled path are combined into a merged computation image.

Abstract: Provided are a method, apparatus, and computer program product for testing a virtualized storage system. Data defining one or more configuration features of the virtualized storage system is received. Also received is a set of one or more predetermined rules defining interpretation of the disk exercising commands, the interpretation being dependent on one or more of the configuration features. A first disk exercising command is received. The first disk exercising command is interpreted in accordance with one of the predetermined rules to produce a second disk exercising command. The second disk exercising command is sent to the virtualized storage system.

Abstract: Provided are an article of manufacture, system, and method for using a data mining algorithm to generate rules used to validate a selected region of a predicted column. A data set has a plurality of columns and records providing data for each of the columns. Selection is received of at least one predicted column for which rules are to be generated and at least one region of the selected at least one predicted column, wherein each region specifies data positions in the column. The data set is processed to determine association relationships among data in at least one predictor column and subsequences in the selected at least one region of the at least one predicted column. At least one rule is generated from the relationships specifying a condition involving at least one predictor column that predicts at least one value in the selected region of the at least one predicted column.

Abstract: Provided are a method, computer program product and system for determining an end of valid log in a log of write records. Records are written to a log in a storage device in a sequential order, wherein the records include a next pointer addressing a next record in a write order and a far ahead pointer addressing a far ahead record in the write order following the record. The far ahead pointer and the next pointer in a plurality of records are used to determine an end of valid log from which to start writing further records.

Abstract: The present invention provides a method, system and program product for integrating a service external to a database into a database such that the service may be easily invoked from the database. Preferably, the service is a web service available over the internet The service may be invoked from any of a number of invoking mechanisms of the database. In a first specific embodiment, the mechanism comprises a user-defined function within an SQL statement. In a second specific embodiment, the mechanism comprises a virtual table. In a third specific embodiment, the mechanism comprises a stored procedure. In a fourth specific embodiment, the mechanism comprises a trigger. In a fifth specific embodiment, the mechanism comprises a federated table accessed via a nickname and implemented using a wrapper.

Abstract: Provided are a method, system, and article of manufacture for using a data mining algorithm to generate format rules used to validate data sets. A data set has a plurality of columns and records providing data for each of the columns. Selection is received of at least one format column for which format rules are to be generated and selection is received of at least one predictor column. A format mask column is generated for each selected format column. For records in the data set, a value in the at least one format column is converted to a format mask representing a format of the value in the format column and storing the format mask in the format mask column in the record for which the format mask was generated. The at least one predictor column and the at least one format mask column are processed to generate at least one format rule. Each format rule specifies a format mask associated with at least one condition in the at least one predictor column.

Abstract: An automated data library system employing a plurality of cartridges, one or more cartridge storage slots and an inventory controller. Each cartridge includes a cartridge memory. The cartridge storage slot(s) is(are) physically configured to store the cartridges. The inventory controller is operable to generate an inventory of the cartridges as stored within the cartridge storage slot(s). A generation by the inventory controller of the inventory of the cartridges as stored within the cartridge storage slot(s) involves the inventory controller simultaneously accessing cartridge identification information on two or more cartridge memories, and generating the inventory including two or more cartridges corresponding to the cartridge identification information.

Abstract: Under control of a first agent, a resource controlled by a second agent is locked with a first operation identifier. Under control of the second agent: a request is received to lock the resource controlled by the second agent with a second operation identifier for a client request for a client application, wherein the resource is already locked with the first operation identifier; it is determined whether the first operation identifier and the second operation identifier are determined to be a same identifier; if it is determined that the first operation identifier and the second operation identifier are the same identifier, the request is responded to with an indication that the resource is locked with the same operation identifier; and, if it is determined that the first operation identifier and the second operation identifier are not the same identifier, the lock request is denied.

Abstract: Provided are techniques for pipeline optimization based on polymorphic schema knowledge. A hierarchical document to be processed by a pipeline of transformations is received. It is determined whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the input schema is a polymorphic schema. In response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, data items corresponding to each schema node that the next downstream transformation is not accessing are collected into a single compressed event. The collected items are passed to the next downstream transformation as the single compressed event.

Abstract: A plurality of components of a storage area network is grouped into a plurality of component groups, wherein a component group includes one or more of the plurality of components of the storage area network. A group relationship data structure provides relationships among one or more of the plurality of component groups, wherein a relationship indicates a supported configuration of the storage area network.

Abstract: Provided are a method, system, and article of manufacture for using different groups of query graph transform modules to generate execution plans for queries for different database types. A plurality of first type query translator modules include information indicating a first data store type to which the first query translator modules apply and a plurality of second query translator modules include information indicating a second data store type to which the first query translator modules apply. A query is received to query a target data store. A determination is made as to whether the target data store is of the first data store type or the second data store type. The first query translator modules are used to translate the received query to a query execution plan in response to determining that the target data store is of the first data store type.

Abstract: Methods, apparatuses and computer program products are provided for modifying an order of processing of a task performed on a plurality of objects. A user selects a plurality of objects and a task to perform on the objects, and the initial order of processing of the objects is displayed to the user. The user may modify the initial order of processing to generate a modified order of processing while the task is performed on one of the objects. For example, a user may remove an object not yet processed from the order of processing. Performance of the task then continues on the remaining objects in the modified order of processing.