Search engine

• US 20030187835A1
• Filed: 03/24/2003
• Published: 10/02/2003
• Est. Priority Date: 09/27/2000
• Status: Active Grant

• Current Assignee: Dassault Systemes SA
• Original Assignee: Pertinence Co.
• Inventors: Huret, Augustin
• Granted Patent: US 7,103,592 B2
• Time in Patent Office: Days
• US Class Current: 707/3
• CPC Class Codes: G06F 16/2457 with adaptation to user needs
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0271 Personalized advertisement
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

The invention concerns a search engine for retrieving from a database (3) a list of data in response to a request, said database (3) having a matrix structure, said search engine containing a first set (J1) of instruction codes executable by a first computer terminal, said search terminal (TR), connected to a telecommunication network (R), to carry out successive operations consisting in: sending to a second computer terminal (TI) an interrogation software module (16) containing a second set of executable instruction codes (J2) to send to said search terminal a request (20) comprising said reference profile Pr and an interrogation domain; calculating weighted frequencies (FPqm); sending a reply (12) to said request containing the reply data (Dqm) which have the highest weighted frequencies (FPqm).

Claims

1. A search engine intended for extracting a list of data (12) from a database (3) in response to a request (9, 20, 24, 26), said database (3) having a matrix structure and comprising a plurality of rows Pi(i=1 to N) of recorded data Dij, said rows Pi being called profiles, and a plurality of columns Cj(j=1 to M) called fields, each field Cj defining a predetermined category of data Dij which are associated therewith, each profile Pi comprising an identifier Ei for identifying it uniquely and data each associated with a field Cj of said base, each profile Pi of the database comprising at least one data item Dij associated with at least one of said fields Cj, said search engine containing a first set (J1) of instruction codes which can be read or stored on a support, characterized in that the codes of said first set (J1) are executable by a first computer terminal, the so-called search terminal (TR), said search terminal (TR) comprising storage means (2) for storing said database and being linked to a telecommunication network (R), so as to perform the successive operations comprising the steps consisting in:

1) sending, by way of said telecommunication network (R) and bound for a second computer terminal, the so-called interrogation terminal (TI), an interrogation software module (8) containing a second set (J2) of instruction codes which can be read or stored on a support and are executable by said interrogation terminal (TI) so as to;

1a) construct a reference profile Pr by associating reference data Drj with at least one field Cj among a collection of fields of said base, a so-called collection of accessible fields, the construction of said reference profile Pr being performed directly or indirectly by a user (U) of said interrogation terminal (TI);

1b) send to said search terminal (TR) a request comprising said reference profile Pr and designating an interrogation domain, said interrogation domain comprising at least one field Cm of said database (3), each field Cm of said interrogation domain being preselected or having to be selected by a user (U) of said interrogation terminal (TI);

2) reading said request received by way of said telecommunication network (R);

3) extracting from said database (3) a sub-base (SB) of profiles Pk to be compared with said reference profile Pr, said sub-base (SB) comprising all or some of the profiles of said database (3);

4) calculating occurrence counters, a distinct occurrence counter Qn being calculated for each field Cn of a comparison domain (DC), said comparison domain (DC) consisting of all said database (3) fields Cj with which a data item Drj of said reference profile Pr is associated, the calculation of the occurrence counters Qn comprising the steps consisting successively in;

4a) selecting a field Cn of said comparison domain (DC),

4b) once for each profile Pk of said sub-base (SB), performing a test of correspondence between the reference profile Pr data item Drn associated with said field Cn, the so-called reference data item, and the data item Dkn of the profile Pk of the sub-base (SB) associated with said field Cn, the so-called data item to be compared, the result of said test of correspondence being a boolean number, the result of said test being true whenever said data item to be compared Dkn corresponds through a predetermined logic law with said reference data item Drn, the result of said test being in particular false when said data item to be compared is empty or non-existent,

4c) rendering said occurrence counter Qn equal to the number of said sub-base (SB) profiles Pk for which the result of said test of correspondence performed in step 4b) is true,

4d) repeating steps 4a) to 4c) by selecting another field Cn of the comparison domain (DC) which has not yet been selected in step 4a), if one exists;

5) calculating partial coefficients, a distinct partial coefficient an being calculated for each field Cn of said comparison domain (DC) whose occurrence counter Qn calculated in step 4c) is nonzero, each partial coefficient an being rendered equal to the value F(Qn) taken by a predetermined real weighting function F(x) of at least one variable x, when said variable x takes the value of said occurrence counter Qn;

6) calculating weighting coefficients CPk, a distinct weighting coefficient being calculated for each profile Pk of said sub-base (SB), each weighting coefficient CPk calculated being equal to a sum of distinct partial coefficients α

n calculated in step

     5), said sum pertaining to the partial coefficients α

n of all those of the fields Cn of the comparison domain (DC) for which the result of the test of correspondence performed in step

     4) between said reference profile Pr and the profile Pk to which said weighting coefficient CPk refers is true, and pertaining only to these fields;

7) calculating weighted frequencies FPqm, a weighted frequency FPqm being calculated for each data item Dim associated with a field Cm of the interrogation domain in said sub-base (SB) of profiles, the calculation of the weighted frequencies FPqm comprising the steps consisting, for each field Cm of the interrogation domain, in

7a) selecting a data item Dqm associated with said field Cm, said selected data item arising from a profile Pq among the collection of profiles Pk of said sub-base (SB) which comprise a nonempty data item Dkm associated with said field Cm,

7b) assigning said selected data item Dqm a weighted frequency FPqm equal to the sum of the weighting coefficients CPk of the profiles Pk of said collection of profiles whose data item Dkm associated with said field Cm is substantially identical to said selected data item Dqm,

7c) repeating steps 7a) and 7b) by selecting another data item which has not yet been selected in step 7a), if one exists;

8) generating a response (12) to said request, said response comprising a list of data Dqm arising from said sub-base (SB), the so-called response data, said response data Dqm being those which possess the highest weighted frequencies FPqm among the data associated with the fields Cm of the interrogation domain, the maximum number NR of response data Dqm associated with each field Cm of the interrogation domain being predetermined and greater than or equal to one;

9) sending said response to a response recipient by way of the telecommunication network (R).

2. The search engine as claimed in claim 1, characterized in that said response list is ordered in increasing or decreasing order of the weighted frequencies FPqm of the response data Dqm.

3. The search engine as claimed in one of claims 1 and 2, characterized in that said weighting function F(x) of the aforesaid step 5) is a positive function of a single integer variable x, said weighting function preferably being decreasing, preferably equal to the inverse of said integer variable x.

4. The search engine as claimed in one of claims 1 to 3, characterized in that said data item to be compared Dkn in the aforesaid step 4b) is in correspondence through said predetermined logic law with said reference data item Drn if it contains at least a substantial part of said reference data item Drn.

5. The search engine as claimed in one of claims 1 to 4, characterized in that the codes of said first set (J1) are executable by said search terminal (TR) so as to, in the aforesaid step 8:

a/ calculate normalized coefficients (δ

qm) lying between 0 and 100%, a normalized coefficient δ

qm being calculated for each response data item Dqm, the calculation of each normalized coefficient δ

qm comprising a step consisting in dividing the weighted frequency FPqm of said response data item Dqm by the number NC of distinct fields Cn lying in said comparison domain (DC),

b/ include in said generated response (12) the normalized coefficient δ

qm of each response data item Dqm.

6. The search engine as claimed in one of claims 1 to 5, characterized in that the codes of said first set (J1) are executable by said search terminal (TR) so as to filter said response data Dqm, in order to delete from said generated response (12) any response data item Dqm associated with a field Cm and substantially identical to a reference profile Pr data item Drm associated with the same field Cm.

7. The search engine as claimed in one of claims 1 to 6, characterized in that the instruction codes of said second set (J2) are executable by said interrogation terminal (TI) so as to store said reference profile Pr and an identifier Er of said reference profile temporarily in a memory (5) of the interrogation terminal (TI), said identifier Er being supplied directly or indirectly by a user (U) of said interrogation terminal (TI);

and to send said reference profile Pr and said identifier Er to said search terminal (TR).

8. The search engine as claimed in claim 7, characterized in that the codes of said first set (J1) are executable by said search terminal (TR) so as to concatenate said reference profile Pr received with said database (3);

the concatenation being performed in such a way that, on the one hand, if there exists a profile Pi of said database (3) whose identifier Ei is identical to the identifier Er of said reference profile Pr, the reference data Drj associated with the fields Cj for which there exists no associated data item Dij in the profile Pi are added to said profile Pi;

on the other hand, if no profile Pi of said database (3) has an identifier Ei identical to the identifier Er of said reference profile Pr, said reference profile Pr being concatenated as new profile (P_N+1) of said database (3).

9. The search engine as claimed in claim 8, characterized in that said reference profile Pr is concatenated with said database (3) in complete substitution of the profile Pi of said database (3) whose identifier Ei is identical to the identifier Er received when said profile Pi exists.

10. The search engine as claimed in one of claims 1 to 9, characterized in that the codes of said first set (J1) are executable by said search terminal (TR) so as, in the course of the aforesaid step 1a) to receive from said interrogation terminal (TI) a profile identifier Ei and to send in response by way of said telecommunication network (R) the profile Pi which is recorded in said database (3) and is identified by said identifier Ei, the instruction codes of said second set (J2) being executable by said interrogation terminal (TI) so as, in the aforesaid step 1a), to use said profile Pi received, possibly modified or completed by a user (U) of said interrogation terminal (TI), as reference profile Pr of a request.

11. The search engine as claimed in one of claims 1 to 10, characterized in that said interrogation software module (8) sent to said interrogation terminal (TI) comprises a list of optional data associable with said accessible fields Cj, the instruction codes of said second set (J2) being executable by said interrogation terminal (TI) so as to allow a user (U) of said interrogation terminal (TI) to include said optional data in said reference profile Pr, by associating them with said corresponding accessible fields Cj.

12. The search engine as claimed in one of claims 1 to 11, characterized in that, said search terminal (TI) being linked by way of said telecommunication network (R) with at least a third computer terminal, the so-called partner terminal (TP), the codes of said first set (J1) are executable by said search terminal (TR) so as to receive from any partner terminal (TP) a contact command (15), said command comprising an address of an interrogation terminal (TI) and so as to execute said contact command (15) by sending said interrogation software module (8) to said interrogation terminal (TI).

13. The search engine as claimed in claim 12, characterized in that the interrogation software module (8) sent by said search terminal (TR) in response to said contact command (15) predetermines said accessible fields Cj and/or said fields of the interrogation domain as a function of the partner terminal (TP) from which said contact command (15) originates, said interrogation domain preferably being predetermined so as to pertain to a product or service that said partner terminal (TP) is able to supply.

14. The search engine as claimed in claim 11 taking in combination with one of claims 12 and 13, characterized in that said optional data, contained in the interrogation software module (8) sent by said search terminal (TR) in execution of a contact command (15), comprise partner-data Dpm connected with the partner terminal (TP) from which said contact command (15) originates, said partner-data Dpm arising from a second database (19) stored in said storage means (2) of the search terminal (TR), said partner-data Dpm preferably comprising information about products and/or services intended to be supplied by said partner terminal (TP), for example names designating said products and/or services.

15. The search engine as claimed in claim 14, characterized in that the codes of said first set (J1) are executable by said search terminal (TR) so as to perform a filtering of said response data Dqm as a function of said partner-data Dpm, the filtering of said response data Dqm comprising the steps consisting

i/ in comparing each response data item Dqm with the partner-data Dpm which are associated with the same field Cm as said response data item Dqm,

ii/ when said response data item Dqm is substantially identical to a partner-data item Dpm connected with a partner terminal (TP), in including an address of said partner terminal (TP) in said generated response (12).

16. The search engine as claimed in claim 15, characterized in that the filtering of said response data comprises the step consisting in deleting from said generated response (12) each response data item Dqm which is not substantially identical to any of the partner-data items Dpm connected with a predetermined partner terminal (TP), said predetermined partner terminal (TP) preferably being the partner terminal (TP) from which said contact command (15) originates.

17. The search engine as claimed in one of claims 15 and 16, characterized in that the filtering of said response data comprises the step consisting in executing a logic test for each response data item Dqm, said logic test consisting in varying whether a complementary data item D'"'"'pm stored in said second database (19) fulfills a predetermined criterion, the result of said logic test being a boolean number, said instructions of the first set (J1) being executable by said search terminal (TR) so as to exclude said response data item Dqm from said response (12) if the result of said logic test is false, the instructions of said second set (J2) being executable by said interrogation terminal (TI) so as to allow a user (U) to predetermine said criterion.

18. The search engine as claimed in one of claims 15 to 17, characterized in that the codes of said first set (J1) are executable by said search terminal (TR) so as to render a partner terminal (TP), preferably a partner terminal (TP) with which is connected a partner-data item Dpm substantially identical to the response data item Dqm whose weighted frequency FPqm is a maximum, recipient of said response (12) and so as to include an address of said interrogation terminal (TI) in said response (12) sent, so that said partner terminal (TP) can enter into communication with said interrogation terminal (TI) after receipt of said response (12).

19. The search engine as claimed in one of claims 1 to 18, characterized in that said interrogation terminal (TI) is a recipient of said response (12).

20. Computer aided process for making commercial offers, each commercial offer comprising the name of a commodity to be supplied and the address of a supplier able to supply said commodity, characterized in that it implements the search engine as claimed in one of claims 1 to 11, the storage means (2) of the search terminal (TR) comprising a second database (19) for storing supplier-data Dpm specific to said supplier, said supplier-data Dpm comprising a list of commodities that can be supplied by said supplier, the codes of said first set (J1) being executable by said search terminal (TR) so as to perform, after generation of said response (12), a filtering of said response data Dqm as a function of said supplier-data Dpm, the filtering of said response data Dqm comprising a step consisting in comparing each response data item Dqm with the supplier-data Dpm which are associated with the same field Cm as said response data item Dqm, in deleting from said response (12) any response data item substantially different from all the supplier-data Dpm and in including an address of said supplier in said response (12) when a response data item Dqm is substantially identical to a supplier-data item Dpm, said commercial offer consisting of said response (12) sent to said interrogation terminal (TI).