International Business Machines Corporation

Tatsuyuki Shiomi

Kenji Takada

Gregory Maurice Plow

Farrokh Pourmirzaie

Nobuyuki Yoshifuji

Shigeko Mori

Yoshiko Yaegashi

Jie Ding

Takashi Yonezawa

Takumi Kobayashi

Embodiments are provided for a system, a computer program product, and/or a method that improves a display of an input selection displayed on a compact screen. To improve this display, embodiments search displayed content for input items, wherein the input items are selections inputted by a user; display different marks, each associated with each of the input items; receive a subsequent input from the user; and change a selection state of each item of the input items corresponding to a mark of the different marks in response to the subsequent input received corresponding to that mark.

Display for input selection on a compact information processing device

According to an aspect, a method for key-value storage includes determining whether a data size of a first set comprising data and a key stored in a first area or a second area of a first storage unit is larger than a threshold determined for the first area or the second area in which the first set is stored, as a first execution condition. The method further includes determining whether a degree of collisions of a hash value indicating a storage location of the first set in the first area of the first storage unit is greater than a predetermined threshold, as a second execution condition. When the set satisfies either of the first or second execution conditions, the method includes the first set in the second area.

Key_Value data storage system

According to an aspect, a key-value store (KVS) system includes a data management unit that stores a data KVS storing a pair of a data KVS key including information on a storage location of application data to be an access target object and the application data; and a key KVS storing a pair of an application key and the data KVS key. The data KVS includes a normal partition in which a size of a record for storing one pair is a predetermined specific size; and a special partition in which the size of the record for storing one pair is a size set according to a data size of the pair to be stored. A data relocation unit relocates a pair of a relocation target object to the special partition having the record size suitable for the data size of the pair.

Key-Value data storage system

A hardware device outputs management information relating to an event that occurs in a managed object. A management information processing unit generates charts for displaying the management information relating to the event. A management screen editing unit generates a management screen for managing a state of the managed object using the charts generated by the management information processing unit. The management screen editing unit further sets a significance of each of the charts generated; generates a first management screen for selecting one of a plurality of chart groups relating to the event that occurs in the managed object; generates a second management screen for displaying a chart group selected in the first management screen; and provides a special display for a particular chart group that includes a chart whose significance is higher than a predetermined threshold, in order to distinguish the particular chart group from other chart groups.

Outputting management information based on state of managed object

An apparatus and system are disclosed for reorganizing a set of database partitions based on a ranked set of database partitions. The apparatus includes an evaluation module to determine a fragmentation indicator for each database partition within a set of database partitions. A ranking module ranks the set of database partitions according to a rank criteria. The rank criteria includes, at a minimum, the fragmentation indicator. A reorganization module reorganizes a subset of the database partitions in the ranked set of database partitions. The subset is selected, at least in part, by a rank order for the ranked set of database partitions. The subset may be selected such that ranked database partitions satisfying a dynamic reorganization threshold are included in the subset.

Apparatus and system for reorganizing a set of database partitions

A method is disclosed for reorganizing a set of database partitions based on a ranked set of database partitions. The method includes a step to determine a fragmentation indicator for each database partition within a set of database partitions. A step ranks the set of database partitions according to a rank criteria. The rank criteria includes, at a minimum, the fragmentation indicator. A step reorganizes a subset of the database partitions in the ranked set of database partitions. The subset is selected, at least in part, by a rank order for the ranked set of database partitions. The subset may be selected such that ranked database partitions satisfying a reorganization threshold are included in the subset.

Method for reorganizing a set of database partitions

An apparatus, system, and method are disclosed for determining the consistency of a database including indirect reference to data elements. There is provided an apparatus for determining consistency of a database. This database includes, in association with each data element, an indirect list element including a storage address of the associated or corresponding data element so that other data elements can reference that data element. This apparatus reads, from each data element, identification information of an indirect list element corresponding to that data element and generates a hash value. This apparatus further reads, from each data element, identification information of an indirect list element corresponding to a data element referenced by that data element and generates a hash value. On condition that these hash values are equivalent to each other, the apparatus determines that the database is consistent.

Growing community of inventors

Kawasaki, Japan

Tatsuyuki Shiomi