Patents by Inventor Matej Marusak

Matej Marusak 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).

  • Enhanced searching of data in a computer memory
    Patent number: 10831756
    Abstract: Data searching in a computer memory can be enhanced using a memory-searching process (MSP) that includes identifying a key that is in a middle position in a range of keys defined by a lower key-boundary and an upper key-boundary. The MSP can also include determining that the key is in a particular position in a range of values defined by a lower value-boundary and an upper value-boundary. The MSP can further include executing another iteration using (i) the particular position minus one as a new upper value-boundary, and (ii) the middle position of the key minus one as a new upper key-boundary for the range of keys. The MSP can additionally or alternatively include executing another iteration using (i) the particular position, or the particular position plus one, as a new lower value-boundary, and (ii) the middle position of the key plus one as a new lower key-boundary.
    Type: Grant
    Filed: December 18, 2017
    Date of Patent: November 10, 2020
    Assignee: Red Hat, Inc.
    Inventors: Julius Milan, Matej Marusak
  • ENHANCED SEARCHING OF DATA IN A COMPUTER MEMORY
    Publication number: 20190188300
    Abstract: Data searching in a computer memory can be enhanced using a memory-searching process (MSP) that includes identifying a key that is in a middle position in a range of keys defined by a lower key-boundary and an upper key-boundary. The MSP can also include determining that the key is in a particular position in a range of values defined by a lower value-boundary and an upper value-boundary. The MSP can further include executing another iteration using (i) the particular position minus one as a new upper value-boundary, and (ii) the middle position of the key minus one as a new upper key-boundary for the range of keys. The MSP can additionally or alternatively include executing another iteration using (i) the particular position, or the particular position plus one, as a new lower value-boundary, and (ii) the middle position of the key plus one as a new lower key-boundary.
    Type: Application
    Filed: December 18, 2017
    Publication date: June 20, 2019
    Inventors: Julius Milan, Matej Marusak