Abstract: A mechanism works in conjunction with a DB2® Log and an analysis tool, such as BMC's Log Master™, to handle logged data for Large Objects (LOBs) stored in tables of a DB2 database system. A plurality of controls track data logged for the LOBs. The mechanism reads log records from a DB2 Log and uses the controls to determine which of the tracked LOBs is associated with the log records and obtains data from those associated log records. The mechanism builds keys to index the data and stores the keys and the data in a Virtual Storage Access Method store having Key Sequenced Data Sets maintained separate from the log record store for the DB2 Log. When requested by the analysis tool, the data in the store can be reassembled using the keys and map records in the first store that map the logged data for the tracked LOBs.

Abstract: A system architecture and a method for managing using a cellular architecture to allow multi-tier management of events such as the managing of the actual impact or the potential impact of IT infrastructure situations on business services. A preferred embodiment includes a high availability management backbone to frame monitoring operations using a cross-domain model where IT component events are abstracted into IT Aggregate events. By combining IT Aggregate events with transaction events, an operational representation of the business services is possible. Another feature is the ability to connect this information to dependent business user groups such as internal end-users or external customers for direct impact measurement.

Abstract: In a computer system that has no single place to discover all installed software applications, a software title discovery technique uses a combination of techniques to discover installed software. One of the combined techniques is an operating system predefined interface for obtaining information about installed software application; other techniques that may be employed include searching a repository of uninstall information, searching for executable files in a portion of a filesystem for the computer, and searching for executable files pointed to by other files in the filesystem of the computer system. A client/server configuration may be employed to allow collection of the software application information across a network of computers in an enterprise by a server computer system, allowing the server system to provide reports regard installed software applications.

Abstract: Specified data sets may be tracked from creation to end-of-life (e.g., deletion). Between creation and end-of-life, data set storage changes may be recorded (i.e., when additional storage is allocated or when some storage is released). During a subsequent allocation cycle, this information may be used in conjunction with user-specified allocation rules to manage or control the data set's initial allocation.

Abstract: Techniques to create physically and transactionally consistent copies of one or more database objects without impacting the availability of the target database objects are described. In one technique, a consistent copy is created as of the time a copy utility is executed. In another technique, a consistent copy is created as of an arbitrary specified time. This approach modifies a prior copy to bring it “up-to-date.” In yet another technique, a consistent copy is created by starting with a current snapshot of the target database objects and selectively removing updates from it back to a user specified arbitrary point-in-time. Each of the described techniques generate consistent copies of the target database objects without blocking users from accessing the target objects during the copy operation.

Abstract: Embodiments of the present invention generate identification rules to classify requests as corresponding to particular transactions. Embodiments of the present invention examine a set of sample requests, determine patterns in the sample requests and generate identification rules based on the request patterns to classify subsequent requests as corresponding to particular transactions. As more sample requests are processed, embodiments of the present invention can update the identification rules. Put another way, embodiments of the present invention can automatically learn how to classify requests better as more requests are processed.

Abstract: A method, system, and medium for compressing systems management information in a historical data store. Dynamically determining the appropriate compression algorithm to apply based on the type of data being compressed and stored. As further input is received for any particular measurement, the appropriate compression algorithm will be automatically selected from the set of available compression algorithms or be defined by a user configuration parameter. The amount of historical data stored with the minimal amount of data loss is optimized by the system dynamically changing the compression algorithm used for the given input data over a particular time span. The system engineer is therefore presented with the pertinent information for monitoring, administrating and diagnosing system activities.

Abstract: This disclosure relates generally to the field of federated configuration management databases (CMDBs). To claim compliance with the CMDBf Standard (“the Standard”), a CMDB implementation must provide working and interoperable implementations of the interfaces defined in the Standard. To make a working implementation, certain non-obvious features are required that are not addressed by the Standard. Among these requirements are: registering management data repositories (MDRs) so that they can be federated; managing/maintaining the list of federated MDRs; querying an MDR for its Data Model; using such MDR Data Models to define mappings of one or more attributes from the MDR data model to one or more attributes of one or more of the CMDB's data models; identifying attributes and defining rules to be used when reconciliation is performed; and managing as well as storing data representative of those mappings. This disclosure addresses these and other deficiencies.

Abstract: Data is often populated into Configuration Management Databases (CMDBs) from different sources. Because the data can come from a variety of sources, it may have inconsistencies—and may even be incomplete. A Normalization Engine (NE) may be able to automatically clean up the incoming data based on certain rules and knowledge. In one embodiment, the NE takes each Configuration Item (CI) or group of CIs that are to be normalized and applies a rule or a set of rules to see if the data may be cleaned up, and, if so, updates the CI or group of CIs accordingly. In particular, one embodiment may allow for the CI's data to be normalized by doing a look up against a Product Catalog and/or an Alias Catalog. In another embodiment, the NE architecture could be fully extensible, allowing for the creation of custom, rules-based plug-ins by users and/or third parties.

Abstract: This disclosure relates generally to the field of Configuration Management Databases (CMDBs). One embodiment of a user interface embodying the present invention is an extension of the process for creating CMDB classes and is therefore readily available for use by someone with knowledge of CMDB administration. The CMDB administrator is thus relieved from having to understand in detail the technologies and interfaces used by the Management Data Repository (MDR) sources. The result of setting up a relation from a CMDB data structure to an MDR data structure by a CMDB administrator may be represented by one or more new CMDB class(es) for the MDR data. The related MDR may then be accessed by an existing CMDB application using already existing CMDB interfaces. The instances of the new relationships and classes thus appear as if they were native instances stored in the CMDB.

Abstract: Methods and systems to automate the deployment from one SMP/E installed run-time mainframe system logical partition (LPAR) to one or more different and distinct LPARs within a mainframe environment are described. Deployment may consist of distributing one or more installation items (e.g., complete products, product upgrades, patches and/or temporary fixes) from one installation environment to another target system. Also, the installed items may have optionally undergone further configuration after the initial installation and prior to actual automated deployment. Each of the target systems are communicatively coupled to the first (i.e., source) LPAR.

Abstract: An enhanced resource reconciliation process is disclosed to examine the metadata hierarchy of unidentified instances of configuration objects within a particular “data partition” (sometimes called a dataset) of an enterprise configuration management database (CMDB) and perform reconciliation against a target dataset, such as a golden, i.e., production, dataset. The enhanced reconciliation process could identify against instances in the production dataset that are of the same class as the unidentified instance—as well as instances that come from any “candidate” classes. Candidate classes could consist of, e.g., classes upstream or downstream from the unidentified instance in the metadata hierarchy.

Abstract: A method for measuring and determining the duplex modes of a network interface. The method assumes the network interface to be operating in a half-duplex mode until the bandwidth utilization reaches a threshold. When the threshold is reached, the method checks the traffic collision in the interface. If there is no collision, then the duplex mode is determined to be full-duplex. If there is collision, then the duplex mode is determined to be half-duplex and an alarm is set off. In another embodiment, the interface type is determined through SNMP. If the interface is a WAN interface, then the interface is determined to be full-duplex.

Abstract: Systems and methods of providing information from run-time installations of mainframe SMP/E based products. Information is embedded into a fingerprint library. The fingerprint library may then be associated with a product installed via SMP/E. The fingerprint library may then remain with the product when it is copied to its distributed location. A system administrator may later query the run-time installation and retrieve information previously only known to the SMP/E tool in an SMP/E controlled installation. In one embodiment, information may be embedded into a fingerprint library at product build time.

Abstract: A mechanism works in conjunction with a DB2® Log and an analysis tool, such as BMC's Log Master™, to handle logged data for Large Objects (LOBs) stored in tables of a DB2 database system. A plurality of controls track data logged for the LOBs. The mechanism reads log records from a DB2 Log and uses the controls to determine which of the tracked LOBs is associated with the log records and obtains data from those associated log records. The mechanism builds keys to index the data and stores the keys and the data in a Virtual Storage Access Method store having Key Sequenced Data Sets maintained separate from the log record store for the DB2 Log. When requested by the analysis tool, the data in the store can be reassembled using the keys and map records in the first store that map the logged data for the tracked LOBs.

Abstract: An improved method and system for controlling free space distribution by key range within a database. In one embodiment, a data structure including key ranges of a plurality of database tables and indexes, and a plurality of key range free space parameters is created. The plurality of database tables and indexes may include a plurality of page sets, which may include rows of data and keys. Time values may be associated with the plurality of free space parameters. The key range free space parameters may have values assigned to them. The key range free space parameters may be user-defined or automatically generated using growth trend analysis, based on key range growth statistics. The rows of data and keys within the plurality of page sets may be redistributed by a reorganization process. The redistributing may reference the key ranges of the data structure and the key range free space parameters.

Abstract: A method and system for unloading an IMS database. Segments in the segment array are stored in an indexed order or are stored in a relative byte address (RBA) order. In both cases, either an image copy of an IMS database or an actual IMS database processed sequentially may be utilized. For indexed order storage, a lookup table may be created to include a key value and a segment array location. A segment array may be created to store both the root and child segments from the IMS database. For RBA ordered storage, a first segment array may be created to store the root segments from the IMS database in a sequential order. Additionally, a second segment array may be created to store the child segments from the IMS database in a relative byte address (RBA) order.

Abstract: A Web Services availability cache is part of a computer system, such as an enterprise system of a business or organization. The availability cache is populated with information from Web Services communicatively connected to the computer system by a network connection. In one embodiment, the availability cache is populated based on each request handled by a server process associated with the availability cache. A server receives a request from a client having an application dependent upon information from the Web Service. The server sends the request to the Web Service and stores returned information in the availability cache. Also, the server sends the returned information to the client, which initiated to request. Once the cache is populated, the server handles subsequent requests for information from the client by using the Web Service if it is available or by using the availability cache if the Web Service is not available.

Abstract: A method and system for distributing content from a server computer to a number of client computers is disclosed. A file to be distributed to a requesting client computer is identified. If another client computer of the plurality of client computers can distribute the file to the requesting client computer, the requesting client computer requests the file from the other client computer. If no client computer can distribute the file to the requesting client computer, the requesting client computer requests the first file from the server computer. Then the requesting client computer receives the first file from either the other client computer or the server computer. Each client computer can act both as a client and a server to the other client computers, providing content that would otherwise be provided by the server computer.

Abstract: A time-efficient means for identifying and processing cascading deletes due to referential constraint violations includes: logging, to an error file, all primary key (“PK”) errors detected during table load operations; building a foreign key (“FK”) index for each child table; recursively probing each relevant FK index to identify all loaded rows that violate a referential constraint due to a PK error; logging all identified FK errors to the error file; and using the (preferably sorted) error file contents to identify, mark and physically delete table rows that violate a referential constraint. The described cascade delete processing methods make only a single pass through the table data, using ordinary computer files to track and organize rows identified for deletion. Use of error files rather than tablescans (multiple passes through the loaded table data) can provide a significant reduction in table load times, especially for large or intricately “related” tables.