International Business Machines Corporation

Globalfoundries Inc.

Neal E Bohling

David C Reed

Max D Smith

Joseph V Malinowski

Roity Prieto Perez

Franklin Emmert McCune

David Bruce LeGendre

Helen Maria Witter

Terri A Menendez

Debra J Benjamin-Deckert

Tony Xu

Lawrence L Law

Brian Lee

Elaine Lai

Gary Pizl

In one embodiment, a method includes receiving an unstructured data record and parsing the unstructured data record to determine a characterization of the unstructured data record. The characterization includes determination of: a number of fields, a length for the fields, and an order of the fields as stored in the unstructured data record. The method also includes obtaining a first key pair that includes a primary key-name associated with a first key-value and hashing at least the first key-value to obtain a hash value. In addition, the method includes updating the unstructured data record to include the hash value as an indexing key thereby creating a modified data record. Also, the method includes storing the modified data record in a structured database. Moreover, the method includes updating an index of the structured database to include an entry for the modified data record, the entry including the hash value.

Storing unstructured data in a structured framework

A method to dynamically switch between catalog sharing protocols includes monitoring, over a period of time, access to a catalog used to index data sets. Using information gathered during this monitoring period, the method divides the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide the best performance during the respective interval. The method schedules the sharing protocols to operate during their respective intervals going forward, and switches between the sharing protocols in accordance with the schedule. In certain embodiments, switching between the sharing protocols includes temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. When using this hybrid mode, the switch may occur when one sharing protocol begins to perform better than the other. A corresponding system and computer program product are also disclosed.

Dynamic switching of catalog sharing protocols

A method, apparatus and computer program product for performing database maintenance is described. Index information for data stored in a tree based file system running in a computer is received. The file system includes a set of data blocks arranged in logical layers and a set of pointers within the set of data blocks which reference respective data blocks in different logical layers. The received index information is parsed. A model of the file system is built based on the parsed index information. A graphical user interface having an index panel is presented. In the index panel, ones of a plurality of icons respectively represent ones of the set of data blocks and are arranged in layers representing the logical layers.

Data set visualizer for tree based file systems

A computer program product is provided for dynamic record-level sharing (RLS) provisioning. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to receive, at a local system, a request to access a data set, and determine to ship the request to a receiving system. The program instructions further cause the processor to gather utilization information of at least one other system, and identify, based on the utilization information of the at least one other system, the receiving system from the at least one other system.

Dynamic record-level sharing (RLS) provisioning inside a data-sharing subsystem

In one general embodiment, a computer-implemented method includes receiving at a first system a request for data, searching one or more local buffers within the first system for the requested data, determining whether the requested data is located within an additional buffer of an additional system in communication with the first system, in response to determining that the one or more local buffers within the first system do not contain the requested data, receiving the requested data by the first system from the additional buffer of the additional system, in response to determining that the requested data is located within the additional buffer of the additional system, and retrieving the requested data from a data disk within the first system, in response to determining that the requested data is not located within the additional buffer of the additional system.

Performing caching utilizing dispersed system buffers

A method for switching between access methods while a data set is open includes attempting, on behalf of a first system, to gain access to a data set. The method further determines whether the data set is already open by a second system. In the event the data set is already open, the method uses a first access method to access the data set. In the event the data set is not already open, the method uses a second access method to access the data set. In certain embodiments, the first access method is an RLS (Record Level Sharing) access method and the second access method is a base VSAM (Virtual Storage Access Method) access method. A corresponding system and computer program product are also disclosed.

Dynamic access method switching for open data sets

Embodiments of the disclosure are directed toward a method, a system, and a computer program product for managing virtual storage access method (VSAM) data sets on performance tiers. The method can be used with VSAM data sets. The method can include determining a usage metric for a particular control area from the plurality of control areas. The method can also include prioritizing the particular control areas based on a determined usage metric. The method can also include assigning a prioritized control area to a performance tier of the plurality of tiers as a function of a prioritization of the particular control area and a performance criteria for the performance tier by moving the prioritized control area to the performance tier and updating an index record that associates the prioritized control area to the performance tier.

VSAM data set tier management

Provided are a computer program product, system, and method for managing traces to capture data for memory regions in a memory. A trace includes a monitor parameter used by a trace procedure to monitor data in a memory device. A frequency is determined at which the trace procedure monitors the memory device. The trace procedure is invoked at the determined frequency to perform trace procedure operations comprising determining a region in the memory device according to the monitor parameter and copying data in the determined region to trace data in a data space.

Managing traces to capture data for memory regions in a memory

In one embodiment, a method includes determining that a request to allocate a target data set on a first storage includes a release command, determining an actual size of the target data set after storing the target data set on the first storage, comparing the actual size of the target data set to a break point value, relocating the target data set from cylinder-managed storage to track-managed storage of the first storage when the actual size of the target data set is less than the break point value and the target data set is stored on the cylinder-managed storage, and relocating the target data set from the track-managed storage to the cylinder-managed storage of the first storage when the actual size of the target data set is at least as great as the break point value and the target data set is stored on the track-managed storage.

Extended address volume (EAV) allocation verification

An approach to allocating storage that has track managed storage and cylinder managed storage. The approach involves receiving a request to allocate a data set for new data and determining if the size of the new data exceeds a breakpoint value. The size of the new data may be determined by allocating a buffer data set that is the size of the breakpoint value, and writing the new data to the buffer data set. If the new data only partially fills the buffer data set, then the size of the new data is smaller than the breakpoint value. If the new data overfills the buffer data set, then the size of the new data set is larger than the breakpoint value. New data that is larger than the breakpoint value is automatically stored in cylinder managed storage, while new data that is smaller than the breakpoint value is automatically stored in track managed storage.

Storage allocation based on data set size

In one embodiment, a system includes a first storage including track-managed storage and cylinder-managed storage, logic adapted for receiving a request to allocate a target data set on the first storage, logic adapted for determining a size of a source data set on a second storage, wherein data from the source data set will be copied to the target data set, logic adapted for comparing the determined size of the source data set to a break point value to determine if the target data set is to be stored to the track-managed storage or the cylinder-managed storage of the first storage, logic adapted for receiving the data from the source data set, and logic adapted for storing the data from the source data set to the target data set in either track-managed storage or cylinder-managed storage of the first storage based on the comparison.

Growing community of inventors

San Jose, CA, United States of America

Neal E Bohling