Patents by Inventor Herve Pellan

Herve Pellan 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).

  • USING HASH COMPUTED FROM KEY TO IDENTIFY DATABASE LOCATION AT WHICH TO STORE DATA CORRESPONDING TO KEY
    Publication number: 20230153285
    Abstract: A storage system local to a computing device stores a database of data entities, such as binary large objects (BLOBs), at locations within the database. The computing device computes hashes from keys, such as distinguished names (DNs), having corresponding data stored in the data entities of the database. The hashes identify the locations within the database at which the data entities storing the data corresponding to the DNs are stored within the database.
    Type: Application
    Filed: December 19, 2018
    Publication date: May 18, 2023
    Inventors: Francois Draperi, Herve Pellan, Nicolas Belin
  • Co-parent keys for document information trees
    Patent number: 11537581
    Abstract: Example implementations relate to generating a virtual co-parent key for a document information tree (DIT) including a plurality of child indexes each associated with a parent index. A virtual co-parent key for a first child index is generated. The first child index may be mapped to a child entry and may have a unique identification key including a child key and associated parent key. Generation of the co-parent key may include the computation of a co-parent seed key from the parent key or child key of the child index. Generation of the co-parent key may further include pre-pending the unique identification key with the computed co-parent seed key.
    Type: Grant
    Filed: March 22, 2019
    Date of Patent: December 27, 2022
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Francois Draperi, Herve Pellan
  • CO-PARENT KEYS FOR DOCUMENT INFORMATION TREES
    Publication number: 20200301900
    Abstract: Example implementations relate to generating a virtual co-parent key for a document information tree (DIT) including a plurality of child indexes each associated with a parent index. A virtual co-parent key for a first child index is generated. The first child index may be mapped to a child entry and may have a unique identification key including a child key and associated parent key. Generation of the co-parent key may include the computation of a co-parent seed key from the parent key or child key of the child index. Generation of the co-parent key may further include pre-pending the unique identification key with the computed co-parent seed key.
    Type: Application
    Filed: March 22, 2019
    Publication date: September 24, 2020
    Inventors: Francois Draperi, Herve Pellan
  • USING HASH COMPUTED FROM KEY TO IDENTIFY DATABASE LOCATION AT WHICH TO STORE DATA CORRESPONDING TO KEY
    Publication number: 20200104284
    Abstract: A storage system local to a computing device stores a database of data entities, such as binary large objects (BLOBs), at locations within the database. The computing device computes hashes from keys, such as distinguished names (DNs), having corresponding data stored in the data entities of the database. The hashes identify the locations within the database at which the data entities storing the data corresponding to the DNs are stored within the database.
    Type: Application
    Filed: December 19, 2018
    Publication date: April 2, 2020
    Inventors: Francois Draperi, Herve Pellan, Nicolas Belin