Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees

Haim Bitner

Haim Bitner, Raarana IL

Patent application number	Description	Published
20110004727	TAPE STORAGE EMULATION FOR OPEN SYSTEMS ENVIRONMENTS - A method according to one embodiment is performed in an environment wherein a plurality of backup hosts are connected to a plurality of virtual tape library servers (VTL servers) which in turn are connected to each of a plurality of disk library units (DLUs), each VTL server being adapted to receive tape storage commands, and in response to receiving a tape storage command, the respective VTL server accepts the tape storage command and responding as if the VTL server were the respective target tape storage device, and wherein data simultaneously streaming from the plurality of backup hosts is received by multiple of the VTL servers, where the multiple VTL servers receiving the simultaneously streamed data write to the same DLU.	01-06-2011

Haim Bitner, Raanana IL

Patent application number	Description	Published
20090234821	Systems and Methods for Efficient Data Searching, Storage and Reduction - Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space.	09-17-2009
20090234855	Systems and Methods for Efficient Data Searching, Storage and Reduction - Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space.	09-17-2009