Patents by Inventor Robert Michael Raymond

Robert Michael Raymond has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8250325
    Abstract: A data deduplication method using a small hash digest dictionary in fast-access memory. The method includes receiving customer data, dividing the data into smaller chunks, and assigning hash values to each chunk. For each chunk, the method includes performing lookup for a duplicate chunk by accessing a small dictionary in memory with the chunk's hash value. When no entry, the small dictionary is updated to include the hash value to fill the dictionary with earliest received data. When an entry is found, the entry's hash value is compared with lookup value and if matched, reference data is returned and an entry counter is incremented. If not matched, additional accesses are attempted such as with additional indexes calculated using the hash value. Collisions may trigger an entry replacement such that some initially entered entries are replaced when determined to not be most repeating values such as based on their counter value.
    Type: Grant
    Filed: April 1, 2010
    Date of Patent: August 21, 2012
    Assignee: Oracle International Corporation
    Inventors: Jon Mark Holdman, Robert Michael Raymond, Atiq Ahamad, John Richard Kostraba, Jr., Carl T. Madison, Jr.
  • Publication number: 20110246741
    Abstract: A data deduplication method using a small hash digest dictionary in fast-access memory. The method includes receiving customer data, dividing the data into smaller chunks, and assigning hash values to each chunk. For each chunk, the method includes performing lookup for a duplicate chunk by accessing a small dictionary in memory with the chunk's hash value. When no entry, the small dictionary is updated to include the hash value to fill the dictionary with earliest received data. When an entry is found, the entry's hash value is compared with lookup value and if matched, reference data is returned and an entry counter is incremented. If not matched, additional accesses are attempted such as with additional indexes calculated using the hash value. Collisions may trigger an entry replacement such that some initially entered entries are replaced when determined to not be most repeating values such as based on their counter value.
    Type: Application
    Filed: April 1, 2010
    Publication date: October 6, 2011
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Robert Michael Raymond, Atiq Ahamad, John Richard Kostraba, JR., Carl T. Madison, JR.
  • Patent number: 6529996
    Abstract: The network attached virtual tape storage subsystem interconnects a plurality of tape devices with a plurality of data processors via a high bandwidth switching network to implement a virtual, distributed tape data storage subsystem. The virtual, distributed tape data storage system realizes multiple virtual devices, which are available to any of the data processors and the bandwidth of the system is scalable and can be changed on demand. The virtual tape storage subsystem is managed by a system controller which contains a plurality of software elements including: resource allocation, resource configuration, and resource management. The use of a networked storage manager enables the tape devices to be managed as a pool and yet attach the tape devices directly to the network as individual resources.
    Type: Grant
    Filed: June 30, 1999
    Date of Patent: March 4, 2003
    Assignee: Storage Technology Corporation
    Inventors: Thai Nguyen, Robert Michael Raymond, Michael Lawrence Leonhardt