Patents by Inventor Alexander Zaphob Barnes

Alexander Zaphob Barnes 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).

  • Skip list generation
    Patent number: 8959309
    Abstract: A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.
    Type: Grant
    Filed: November 4, 2011
    Date of Patent: February 17, 2015
    Assignee: Canon Kabushiki Kaisha
    Inventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov
  • SKIP LIST GENERATION
    Publication number: 20120136871
    Abstract: A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.
    Type: Application
    Filed: November 4, 2011
    Publication date: May 31, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov
  • SKIP LIST GENERATION
    Publication number: 20120011166
    Abstract: A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.
    Type: Application
    Filed: September 23, 2011
    Publication date: January 12, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov
  • SKIP LIST GENERATION
    Publication number: 20100325083
    Abstract: A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.
    Type: Application
    Filed: June 7, 2010
    Publication date: December 23, 2010
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov