公开(公告)号：US10324991B2

公开(公告)日：2019-06-18

申请号：US15149346

申请日：2016-05-09

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant

IPC: G06F16/335 ,  G06F16/9535

Abstract: A method for presenting search results is provided. The method receives a user input search query; obtains, from a search engine, a first set of search results responsive to the user input search query; efficiently identifies a promoted set of search results for promotion using a set of search promotion rules, each of the set of search promotion rules including a set of terms and one or more document identifiers; revises the first set of search results, based on the identified promoted set, to create a second set of search results; and presents the second set of search results, wherein the second set of search results includes the first set of search results and the promoted set in a promoted position.

公开(公告)号：US10936611B2

公开(公告)日：2021-03-02

申请号：US16404984

申请日：2019-05-07

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant

IPC: G06F16/31 ,  G06F16/248 ,  G06F16/2457 ,  G06F16/9538

Abstract: A method for presenting search results is provided. The method receives a user input search query; obtains, from a search engine, a first set of search results responsive to the user input search query; efficiently identifies a promoted set of search results for promotion using a set of search promotion rules, each of the set of search promotion rules including a set of terms and one or more document identifiers; revises the first set of search results, based on the identified promoted set, to create a second set of search results; and presents the second set of search results, wherein the second set of search results includes the first set of search results and the promoted set in a promoted position.

公开(公告)号：US20190258628A1

公开(公告)日：2019-08-22

申请号：US16404984

申请日：2019-05-07

Applicant: Salesforce.com, inc.

Inventor： Bruno Roustant

IPC: G06F16/248 ,  G06F16/2457

Abstract: A method for presenting search results is provided. The method receives a user input search query; obtains, from a search engine, a first set of search results responsive to the user input search query; efficiently identifies a promoted set of search results for promotion using a set of search promotion rules, each of the set of search promotion rules including a set of terms and one or more document identifiers; revises the first set of search results, based on the identified promoted set, to create a second set of search results; and presents the second set of search results, wherein the second set of search results includes the first set of search results and the promoted set in a promoted position.

公开(公告)号：US11151105B2

公开(公告)日：2021-10-19

申请号：US16292102

申请日：2019-03-04

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant

IPC: G06F16/22 ,  G06F16/21 ,  G06F16/901

Abstract: An entries array having a pre-selected number of initially empty buckets and structured as a circular array is maintained. Each of the pre-selected number of entries in the entries array has a corresponding index value. A chaining array having the pre-selected number of buckets and structured as a circular array is also maintained. Each of the pre-selected number of entries in the chaining array has the same corresponding index value as the corresponding bucket in the entries array. A hash operation is performed on data to be stored to determine a hash value corresponding to the data. The data is stored in a bucket in the entries array corresponding to the hash value as an unmovable head-of-chain entry, and moving previous data, if any, stored in the entries array corresponding to the hash value if the previous data has a different hash value. The data is stored in another bucket in the entries array if the bucket in the entries array corresponding to the hash value is occupied by a head-of-chain entry. The bucket storing the data is linked to the head-of-chain entry with the chaining array.

公开(公告)号：US10223396B2

公开(公告)日：2019-03-05

申请号：US15249271

申请日：2016-08-26

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant

IPC: G06F17/30

Abstract: An entries array having a pre-selected number of initially empty buckets and structured as a circular array is maintained. Each of the pre-selected number of entries in the entries array has a corresponding index value. A chaining array having the pre-selected number of buckets and structured as a circular array is also maintained. Each of the pre-selected number of entries in the chaining array has the same corresponding index value as the corresponding bucket in the entries array. A hash operation is performed on data to be stored to determine a hash value corresponding to the data. The data is stored in a bucket in the entries array corresponding to the hash value as an unmovable head-of-chain entry, and moving previous data, if any, stored in the entries array corresponding to the hash value if the previous data has a different hash value. The data is stored in another bucket in the entries array if the bucket in the entries array corresponding to the hash value is occupied by a head-of-chain entry. The bucket storing the data is linked to the head-of-chain entry with the chaining array.

公开(公告)号：US11726973B2

公开(公告)日：2023-08-15

申请号：US17347156

申请日：2021-06-14

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant ,  Juan Camilo Rodriguez Duran

IPC: G06F16/22 ,  G06F16/27 ,  G06F16/901

CPC classification number: G06F16/2246 ,  G06F16/2272 ,  G06F16/278 ,  G06F16/9024

Abstract: A minimal distinguishing prefix (MDP) is computed for terms included in a list of terms. The MDP for a term is the minimal prefix that differentiates the term from the immediately preceding term. Lengths of the computed MDPs are compared, and a set of MDPs is selected for inclusion in a trie. A trie generator generates a trie including a plurality of leaf nodes based on the selected MDPs, where each leaf node in the trie corresponds to a respective one of the selected MDPs, such that the terms accessible through a particular leaf node include the term corresponding to the respective one of the selected MDPs and any other terms positioned in the list between that term and a term corresponding to a next one of the selected MDPs in the trie.

公开(公告)号：US20200082003A1

公开(公告)日：2020-03-12

申请号：US16127087

申请日：2018-09-10

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant ,  Juan Camilo Rodriguez Duran

IPC: G06F17/30

Abstract: A minimal distinguishing prefix (MDP) is computed for terms included in a list of terms. The MDP for a term is the minimal prefix that differentiates the term from the immediately preceding term. Lengths of the computed MPDs are compared, and a set of MDPs is selected for inclusion in a trie. A trie generator generates a trie including a plurality of leaf nodes based on the selected MDPs, where each leaf node in the trie corresponds to a respective one of the selected MDPs, such that the terms accessible through a particular leaf node include the term corresponding to the respective one of the selected MDPs and any other terms positioned in the list between that term and a term corresponding to a next one of the selected MDPs in the trie.

公开(公告)号：US10552464B2

公开(公告)日：2020-02-04

申请号：US14575715

申请日：2014-12-18

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant ,  Marc Brette ,  Pierre-Yves Chevalier ,  Francois Lopitaux ,  Ghislain Brun ,  Ilan Ginzburg ,  Jean-Baptiste Charlety ,  Pierre Salagnac ,  Son Thanh Chang

IPC: G06F16/00 ,  G06F16/33

Abstract: A database system may generate a new case associated with a customer support query. The database system may initiate a search for other cases related to the new case and identify articles linked to the related cases. The database system may identify more relevant articles by finding the related cases that use a similar vocabulary for describing similar customer problems. The database system then identifies the articles used for resolving the prior problems. Thus, the database system may bridge the gap between vocabularies used by customers to describe problems and vocabularies used in articles to describe solutions to those problems.

公开(公告)号：US20170344545A1

公开(公告)日：2017-11-30

申请号：US15249271

申请日：2016-08-26

Applicant: salesforce.com, Inc.

Inventor： Bruno Roustant

IPC: G06F17/30

CPC classification number: G06F17/3033 ,  G06F17/303 ,  G06F17/30949

Abstract: An entries array having a pre-selected number of initially empty buckets and structured as a circular array is maintained. Each of the pre-selected number of entries in the entries array has a corresponding index value. A chaining array having the pre-selected number of buckets and structured as a circular array is also maintained. Each of the pre-selected number of entries in the chaining array has the same corresponding index value as the corresponding bucket in the entries array. A hash operation is performed on data to be stored to determine a hash value corresponding to the data. The data is stored in a bucket in the entries array corresponding to the hash value as an unmovable head-of-chain entry, and moving previous data, if any, stored in the entries array corresponding to the hash value if the previous data has a different hash value. The data is stored in another bucket in the entries array if the bucket in the entries array corresponding to the hash value is occupied by a head-of-chain entry. The bucket storing the data is linked to the head-of-chain entry with the chaining array.

公开(公告)号：US20170124203A1

公开(公告)日：2017-05-04

申请号：US15149346

申请日：2016-05-09

Applicant: salesforce.com, inc.

Inventor： Bruno Roustant

IPC: G06F17/30

CPC classification number: G06F17/30867

Abstract: A method for presenting search results is provided. The method receives a user input search query; obtains, from a search engine, a first set of search results responsive to the user input search query; efficiently identifies a promoted set of search results for promotion using a set of search promotion rules, each of the set of search promotion rules including a set of terms and one or more document identifiers; revises the first set of search results, based on the identified promoted set, to create a second set of search results; and presents the second set of search results, wherein the second set of search results includes the first set of search results and the promoted set in a promoted position.