Patents by Inventor Babak Mozaffari

Babak Mozaffari 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).

  • Storing entries as ordered linked lists
    Patent number: 11449549
    Abstract: A processor stores a first data item in a first entry of a data structure in association with a first key. The processor stores a second data item in a second entry of the data structure in association with the second key. The processor causes the second entry of the data structure to reference the first entry of the data structure. The processor stores the second key in a third entry of the data structure in association with a business key. The business key is employed to identify a plurality of entries of the data structure comprising the first entry and the second entry.
    Type: Grant
    Filed: February 26, 2015
    Date of Patent: September 20, 2022
    Assignee: Red Hat, Inc.
    Inventor: Babak Mozaffari
  • Finding objects in a key-based data structure by their approximate location
    Patent number: 11204946
    Abstract: Object identification is described. A processor identifies a first cell of a rectangular grid overlapped over a map of a certain geographic area. The first cell corresponds to a given geographic location. The processor identifies a second cell of the grid, the second cell having a center located within a certain distance of a center of the first cell. The processor identifies one or more objects associated with the second cell by using geographic coordinates of the center of the second cell as a lookup key to identify one or more entries of a data structure that stores object information.
    Type: Grant
    Filed: February 26, 2015
    Date of Patent: December 21, 2021
    Assignee: Red Hat, Inc.
    Inventor: Babak Mozaffari
  • STORING ENTRIES AS ORDERED LINKED LISTS
    Publication number: 20160253433
    Abstract: A processor stores a first data item in a first entry of a data structure in association with a first key. The processor stores a second data item in a second entry of the data structure in association with the second key. The processor causes the second entry of the data structure to reference the first entry of the data structure. The processor stores the second key in a third entry of the data structure in association with a business key. The business key is employed to identify a plurality of entries of the data structure comprising the first entry and the second entry.
    Type: Application
    Filed: February 26, 2015
    Publication date: September 1, 2016
    Inventor: Babak Mozaffari
  • FINDING OBJECTS IN A KEY-BASED DATA STRUCTURE BY THEIR APPROXIMATE LOCATION
    Publication number: 20160253355
    Abstract: Object identification is described. A processor identifies a first cell of a rectangular grid overlapped over a map of a certain geographic area. The first cell corresponds to a given geographic location. The processor identifies a second cell of the grid, the second cell having a center located within a certain distance of a center of the first cell. The processor identifies one or more objects associated with the second cell by using geographic coordinates of the center of the second cell as a lookup key to identify one or more entries of a data structure that stores object information.
    Type: Application
    Filed: February 26, 2015
    Publication date: September 1, 2016
    Inventor: Babak Mozaffari