Patents by Inventor Roberto Daniel Konow Krause
Roberto Daniel Konow Krause 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).
-
Publication number: 20220414079Abstract: Systems and methods are provided for creating and utilizing search indexes with different properties to provide efficient and flexible means for retrieving and ranking high-dimensional content. A first index and a second index are generated with a different sets of properties, which may include a permutation prefix length and a vector quantization scheme, and are each associated with a computational workload. Further, at least one index structure may be created with a posting list associated with a permutation prefix and a set of references, rather than only a permutation prefix, to balance out posting lists of variable lengths within the index. Another embodiment of the disclosure provides for expansion of search results at search time, rather than during indexing, by retrieving posting lists associated with shorter permutation prefix after an initial list is determined to have insufficient recall.Type: ApplicationFiled: August 31, 2022Publication date: December 29, 2022Inventors: Roberto Daniel Konow Krause, Mohnish Kodnani, Alberto Ordonez Pereira, Ravindra Surya Lanka
-
Patent number: 11449484Abstract: Systems and methods are provided for creating and utilizing search indexes with different properties to provide efficient and flexible means for retrieving and ranking high-dimensional content. A first index and a second index are generated with a different sets of properties, which may include a permutation prefix length and a vector quantization scheme, and are each associated with a computational workload. Further, at least one index structure may be created with a posting list associated with a permutation prefix and a set of references, rather than only a permutation prefix, to balance out posting lists of variable lengths within the index. Another embodiment of the disclosure provides for expansion of search results at search time, rather than during indexing, by retrieving posting lists associated with shorter permutation prefix after an initial list is determined to have insufficient recall.Type: GrantFiled: June 25, 2018Date of Patent: September 20, 2022Assignee: eBay Inc.Inventors: Roberto Daniel Konow Krause, Mohnish Kodnani, Alberto Ordonez Pereira, Ravindra Surya Lanka
-
Patent number: 11281649Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.Type: GrantFiled: July 28, 2020Date of Patent: March 22, 2022Assignee: eBay Inc.Inventor: Roberto Daniel Konow Krause
-
Publication number: 20200356541Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.Type: ApplicationFiled: July 28, 2020Publication date: November 12, 2020Inventor: Roberto Daniel Konow Krause
-
Patent number: 10747741Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.Type: GrantFiled: July 26, 2016Date of Patent: August 18, 2020Assignee: eBay Inc.Inventor: Roberto Daniel Konow Krause
-
Patent number: 10649968Abstract: A data management system accesses a set of vectors containing binary values generates a corresponding set of sequentially ordered vector blocks. Each vector contains a set of two or more binary values and a numerical vector identifier. The data management system generates a block index based on each corresponding set of sequentially ordered vector blocks. The block index includes a set of vector block arrays, each corresponding to a respective sequential position and including one vector block from each of the sets of sequentially ordered vector blocks that are in the respective sequential position. The vector blocks in each vector block array being are ordered sequentially based on two or more sequential binary values in each respective vector block. For each vector block array, the data management system combines pairs of sequentially ordered vector blocks containing matching sets of two or more binary values into combined vector blocks.Type: GrantFiled: August 30, 2017Date of Patent: May 12, 2020Assignee: eBay Inc.Inventors: Roberto Daniel Konow Krause, Seema Jethani, Mohnish Kodnani, Vishnusaran Ramaswamy, Jonathan Baggott, Harish Kumar Vittal Murthy
-
Publication number: 20200065395Abstract: One or more factors of a query and one or more search result candidates are identified. A plurality of decision trees are associated, via a data structure, with one or more leaf invalidation pairs for at least a first value of the one or more factors. The one or more search result candidates are scored based at least in part on the associating of the plurality of decision trees with one or more leaf invalidation pairs for at least the first value of the one or more factors within the data structure.Type: ApplicationFiled: August 22, 2018Publication date: February 27, 2020Inventors: Alberto Ordonez Pereira, Roberto Daniel Konow Krause
-
Publication number: 20200012630Abstract: A data management system accesses a set of vectors containing binary values and generates vector blocks comprising binary values from each vector. Each of at least a portion of the vector blocks for each vector contain a set of two or more binary values from the vector. The data management system generates a block index based on the vector blocks. The block index includes a set of vector block arrays, each vector block array corresponding to a position in the vectors and including the binary values of a vector block from each vector. The data management system can identify relevant vectors for a target vector by generating vector blocks from the target vector and querying the block index to identify candidate vectors.Type: ApplicationFiled: September 18, 2019Publication date: January 9, 2020Inventors: Roberto Daniel Konow Krause, Seema Jethani, Mohnish Kodnani, Vishnusaran Ramaswamy, Jonathan Baggott, Harish Kumar Vittal Murthy
-
Publication number: 20190392058Abstract: Systems and methods are provided for creating and utilizing search indexes with different properties to provide efficient and flexible means for retrieving and ranking high-dimensional content. A first index and a second index are generated with a different sets of properties, which may include a permutation prefix length and a vector quantization scheme, and are each associated with a computational workload. Further, at least one index structure may be created with a posting list associated with a permutation prefix and a set of references, rather than only a permutation prefix, to balance out posting lists of variable lengths within the index. Another embodiment of the disclosure provides for expansion of search results at search time, rather than during indexing, by retrieving posting lists associated with shorter permutation prefix after an initial list is determined to have insufficient recall.Type: ApplicationFiled: June 25, 2018Publication date: December 26, 2019Inventors: Roberto Daniel Konow Krause, Mohnish Kodnani, Alberto Ordonez Pereira, Ravindra Surya Lanka
-
Publication number: 20190065539Abstract: A data management system accesses a set of vectors containing binary values generates a corresponding set of sequentially ordered vector blocks. Each vector contains a set of two or more binary values and a numerical vector identifier. The data management system generates a block index based on each corresponding set of sequentially ordered vector blocks. The block index includes a set of vector block arrays, each corresponding to a respective sequential position and including one vector block from each of the sets of sequentially ordered vector blocks that are in the respective sequential position. The vector blocks in each vector block array being are ordered sequentially based on two or more sequential binary values in each respective vector block. For each vector block array, the data management system combines pairs of sequentially ordered vector blocks containing matching sets of two or more binary values into combined vector blocks.Type: ApplicationFiled: August 30, 2017Publication date: February 28, 2019Inventors: Roberto Daniel Konow Krause, Seema Jethani, Mohnish Kodnani, Vishnusaran Ramaswamy, Jonathan Baggott, Harish Kumar Vittal Murthy
-
Publication number: 20180032559Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.Type: ApplicationFiled: July 26, 2016Publication date: February 1, 2018Inventor: Roberto Daniel Konow Krause