International Business Machines Corporation

Daniel Katz

Eran Raichstein

Uri Wolloch

Ofir D Cohen

Amihay Schwarz

Raul D Segal

Alexey Yarovinsky

A mechanism is provided for efficiently searching a database for data associated with a key value that is unidentifiable in a set of nodes of the database. A request is received to retrieve data from the database, where the request specifies a searched-for key value that is unidentifiable in the set of nodes of the database. The data associated with the searched-for key value is identified in a lowest level node of the database between a current leftmost node and a current rightmost node. A key index is updated in at least one node of the database with the key index value associated with the data and identified from the lowest level node thereby making the searched-for key value identifiable within the at least one node. The data associated with the searched-for key value is then returned to a user.

Recovery of inconsistent data in databases

A computational device maintains logical mirroring of a first file system with a second file system. A first set of input/output (I/O) requests is satisfied from the first file system while the second file system is undergoing defragmentation. A second set of I/O requests is satisfied from the second file system while the first file system is undergoing defragmentation.

Maintaining a mirrored file system for performing defragmentation

Growing community of inventors

Kfar Vradim, Israel

Daniel Katz