WO2001077889A9 - Systeme de recherche et d'aide au choix - Google Patents
Systeme de recherche et d'aide au choixInfo
- Publication number
- WO2001077889A9 WO2001077889A9 PCT/FR2001/001132 FR0101132W WO0177889A9 WO 2001077889 A9 WO2001077889 A9 WO 2001077889A9 FR 0101132 W FR0101132 W FR 0101132W WO 0177889 A9 WO0177889 A9 WO 0177889A9
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- attributes
- list
- attribute
- contents
- content
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/9038—Presentation of query results
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99944—Object-oriented database structure
- Y10S707/99945—Object-oriented database structure processing
Definitions
- the present invention relates to a data processing method for searching and assisting in the selection of objects from a set of objects stored in the form of cards in a data processing system, in which each object is associated with the content of each of several attributes, as well as a data processing system and man / machine interface for the implementation of this process.
- object designates any material or immaterial entity capable of being described by a certain number of attributes, hereinafter also called containers, the attributes being able to present one of several values given hereinafter called contents.
- attributes In an ordinary database, all the attributes or containers are common to all the files and the information in a file consists of the list of associated content. Searching on these databases, for example, calls for the use of keywords, crossing criteria, etc. In very many cases, research on these conventional databases can lead to the lack of response or to too many responses.
- the invention aims to provide a data processing system for searching for objects which guarantees that users are always presented with answers, and this in the form of short lists of relevant answers, while using computer means of limited power. and by offering a high speed of treatment and a reasonable value for money.
- the invention relates to a data processing system for the selection of objects from a set of objects stored in the form of files in said system, in which each object is identified by the content of each of several attributes, comprising: ai) means for storing a hierarchically structured table of all the attributes and contents associated with said objects, in which said attributes are classified hierarchically into several ranks, each attribute of a secondary rank is attached to a content of an attribute of hierarchically higher rank, and to each pair consisting of an attribute and its content is associated a specific code, a2) means of storage, for each memorized object, of a file in which each attribute of said object and its content is identified by the specific code assigned to said attribute-content pair in said table, and b) means of calculation and interface for, in response to a request for searching for an applicant: c) building a first table (S) containing all of the memorized files relating to said request, d) building, by means of said codes, in accordance with said hierarchical structure of attribute-content pairs,
- the search takes place in stages, each stage involving the choice of an attribute or container among those available and the choice of content among those available in the attribute or container chosen.
- Each step leads to presenting only relevant information to the applicant since it is only presented with search criteria which lead to answers and since search criteria are only presented to it as long as there are answers.
- said calculation and interface means e) for presenting successive choices of attributes and contents to said requester, in the hierarchical order defined in said second table (C), comprise: e1) means for establishing, by exploring said second table (C) at the highest hierarchical rank not yet explored, a list of attributes having at least two contents represented in said first table (S), and one of the two means comprising: e2) means for presenting said list of attributes to said requester with a view to choosing one of said attributes if said list of attributes comprises at least two attributes, and e3) means for directly presenting the contents of a attribute to said requester with a view to choosing one of said contents if said list of attributes includes only said attribute.
- said means e2) for presenting said list of attributes to said requester with a view to choosing one of said attributes, if said list of attributes comprises at least two attributes comprises: e21) means for establishing, in response to the choice of one of said attributes by said requester, a list of contents of said chosen attribute represented in said first table (S), e22) means for presenting said list of contents to said requester for the purpose of choice of one of said contents.
- said means e1) comprise means for establishing, for each of said attributes of said list of attributes, a list of the contents of this attribute which are represented in said first table (S), and said means e2) comprise means for presenting to the requester all the attribute-content pairs selected by said means e1), with a view to the choice of one of said pairs by said requester.
- the invention also includes one or more of the following characteristics considered alone or in combination: said condition of operation g) is satisfied if said list of attributes established by said means e1) is empty. - Said condition of the operation implemented by said means g) is satisfied if the number of cards of said first table (S) is less than a predetermined value.
- said calculation and interface means comprise means for, following said operations implemented by said means c) and f), presenting to said requester the number of said cards from the first table (S).
- said calculation and interface means include means for, following said operations implemented by said means c) and f), presenting to the requester the list of attribute-content pairs previously selected.
- calculation and interface means comprise means for, following said operations implemented by said means c) and f), present to said requester the list of attribute-content pairs which, although never having been selected by the applicant, are nevertheless common to all the remaining files (F) - said calculation and interface means include means for:
- - define at least one of said attribute-content pairs constituting a priority search criterion, - constructing said first table (S) and said second table (C) of said operations implemented by said means c) and d) by selecting, from said set of files, a subset of said files satisfying said criterion, and - executing said operations implemented by said means e) to h) by means of said subset of files, - said definition of a priority search criterion comprises the step consisting in offering said applicant to choose at least one priority criterion consecutively to said step e), adding said priority criterion chosen by said requester to a list of priority criteria, and developing said subset of files by selecting files from said set meeting the priority criteria of said list.
- said means for defining a priority search criterion include means for offering said applicant to choose at least one priority criterion following said operation implemented by said means e), means for adding said priority criterion chosen by said applicant to a list (P) of priority criteria, and means for developing said subset of files by selecting files from said set satisfying the priority criteria of said list (P).
- said system has a client-server architecture, said interface means comprising a client terminal.
- FIG. 1 is a table illustrating the hierarchical structure of all the attributes or containers and the contents associated with the objects in a system according to the invention
- Figure 2 is a table similar to that of Figure 1 illustrating the containers and contents in the case of a practical application;
- FIG. 3 to 9 are flowcharts implemented by the system according to the invention
- FIG. 10 to 13 are tables illustrating an example of coding of content implemented by the system according to the invention.
- Table T in FIG. 1 illustrates the hierarchical structure of all the containers and contents associated with the objects stored in a computer resource and among which a search is likely to be carried out.
- F sheets consisting of: - on the one hand, various information on which it is not possible to carry out research by means of the mechanisms of the invention, for example texts, images, digital data and / or other information of any kind ;
- container-content pairs (cna-cnu) likely each to have one of several contents, which belong to the hierarchical table of FIG. 1 and which serve both for various information and for criteria of research.
- the cna-cnu pairs of a file F constitute a subset of the table T in FIG. 1 and have the following property: if, in the table T, there are cna-cnu sub-couples of a couple cna- cnu determined belonging to the file, then there exists in the file one of these sub-couples, that is to say that the file is complete.
- the containers and contents are classified hierarchically into several rows A, B, C ... and each container of a secondary rank is attached to a content of a containing a hierarchically higher rank.
- a level or rank A of the table is provided for a Container 1 and a Container 2 corresponding to the main classification themes.
- Container 1 can have several possible values or contents, namely cnula, cnulb, cnulc, At the level or hierarchical rank B corresponding to sub-themes, there are four containers.
- the cnulal and cnu1a2 containers are attached to the cnula content.
- the cnulbl and cnu1b2 containers are attached to the cnulb content.
- the cnulal container can have two possible values or contents, namely cnulala or cnulalb.
- the content can be "Apartment” or "House”
- the content can be "Sale” or “Rental”, etc.
- the containers are each attached to one of the contents of the higher hierarchical rank: the containers “Number of rooms” and “Floor” are attached to the “Apartment” content and the container “Land” is attached to the "House” content.
- each container-content pair is unique and can be associated with a specific code making it possible to designate said pairs in sheets F.
- FIGS. 3 to 9 illustrate the mechanisms used to carry out a search among a set of files F coded in accordance with the hierarchical structure of the table in FIG. 1.
- Step 1 corresponds to the start of a search, that is to say the preparation of tables S and C intended to reflect all the existing files F among which the search must be carried out.
- Table S is a table of selected records F and their container-content pairs, this first table being constantly updated during the search.
- the second table C is a table of the contents present in any one of the files of the first table S. If each file F is considered as a subset of contents, then table C can be considered as the set constituted by the union of the subsets F, it being understood that each container-content pair is only represented once in the table C. In addition, this table is organized in accordance with the hierarchical structure of the table T to reflect the hierarchy container-content pairs. This means that the containers are only represented implicitly in this table, since each content has a specific code, from which its container can be deduced as shown in table T. If, following the start of the research in step 1, it turns out that the total number of memorized files among which the search is carried out is less than a predetermined value, test 2 leads directly in 3 to the presentation to the applicant of the list of all the files existing.
- step 1 If the number of files in the table S developed in step 1 is greater than said predetermined value, that is to say if it is not a short list, we go through the test
- step 4 corresponds to a module, a first embodiment of which is illustrated in FIG. 4 and a second embodiment in FIG. 5.
- step or module 4 it is examined in 5 whether there is still a possibility of choice of container / content. If there is still at least one choice, test 5 brings you back to the entry for test 2. Otherwise, you go directly to 3 to present the list of files found.
- the number of files presented to the applicant is greater than a predetermined parameter, this means that it is desirable to improve the search by refining the criteria containing (attribute) -content depending on those chosen.
- search criteria containers and their contents
- contents for one or more existing containers (attributes).
- it can be in this case provided an order to notify the manager of the definition of criteria.
- FIG. 4 illustrating the first embodiment 4.1 of module 4 of FIG. 3.
- This module 4.1 begins with a step 10 entitled "Divisible containers" and illustrated by the flowcharts of FIGS. 6 and 7.
- This module 10 has the purpose of creating a list of containers by hierarchical search in the second table C of the containers having at least two contents represented in the first table S.
- the module 10 begins at step 100 with the exploration of the second table C at the highest hierarchical rank not yet explored to determine which are the container-content pairs of this hierarchical rank.
- each container is treated as will be described with reference to FIG. 7 and at 102 a list of containers is provided for presentation to the applicant as will be described below.
- the step or module 101 begins with step 200 consisting in searching whether the container treated has content represented in table S. If no content is found in 201, that is ie if the result is RO, we go directly to 202 at the end of the processing of the container concerned. If the response to the test 201 is positive, we go to step 203 consisting in finding whether the container treated has a second content represented in the table S. If the result of the test 204 is negative, that is to say if the container has only one content R1, the container is ignored, but the search is extended to 205 by also processing all the containers depending on the content found.
- the result is Rn, that is to say that we found in table S at least two different contents for the container treated.
- the process 101 for processing a container of FIG. 7 is repeated for each of the containers selected in step 100 of FIG. 6, until all the selected containers have been used up.
- test 11 if it turns out in test 11 that the list of containers 102 is empty, that is to say that there is no choice to offer the applicant as indicated in 12, we then go to 3 (figure 3) to present the list of files found. If by virtue of test 11, it turns out that the list of containers 102 is not empty, it is examined at 13 whether this list comprises one or more containers. If this list contains several containers, they are presented to the applicant at 14 and the latter selects one of the containers at 15. When the requester has chosen a container at 15 or if the test 13 determines that the list of containers 102 contains only one container, we go to the content selection module of step 16 consisting in creating a list of represented contents. in table S for the single container or the container chosen at 15 by the requestor.
- the first step 300 of the content selection module 16 consists in locating in table C the container chosen at 15 or the single container from the list 102, hereinafter called DAC, then finding the first CNU content of this container.
- the next step 301 consists in searching if the couple CNA-CNU is part of one of the cards of the table S. If it turns out in 302 that this is the case, then we go to step 303 where l 'we add this CNU content to the list of contents of the CNA container.
- the number of files in table S including the CNA-CNU pair is also calculated in 303 and a list of files in table S is created which includes the couple CNA-CNU.
- test 304 we determine if the DAC container contains other content. If so, we go to 305 to the following content and then we return to step 301 to determine if the new CNA-CNU pair is part of one of the cards in table S. We then repeat steps 302, 303 and 304 until all contents of the CNA container have been examined. If, during this process, it turns out that a CNA-CNU couple is not part of one of the cards in table S, the response to test 302 is negative and we then go to test 304, which means that the content in question is not added to the results list.
- step 17 of FIG. 4 the list of selected contents is provided at 306 and is presented to the applicant in step 17 of FIG. 4.
- the applicant proceeds in 18 to choose a content among those presented to it and then we go to step 19 of reduction which consists in deleting from table S all the files which do not contain one of the container-content pairs indicated by the applicant.
- step 19 of reduction which consists in deleting from table S all the files which do not contain one of the container-content pairs indicated by the applicant.
- step 19 of reduction which consists in deleting from table S all the files which do not contain one of the container-content pairs indicated by the applicant.
- step 20 which indicates that the applicant has made a choice of container in 15 and content in 18, we return to the entry of test 2 in FIG. 3 to determine whether the list of files contained in table S is a short list or not.
- the search is finished and we go to step 3 of presentation of the found files, while in the negative, we repeat the process of module 4 described above by successively exploring the containers and contained in the hierarchical order until a short list is obtained.
- a short list is a list whose number of files is less than or equal to a predetermined value, for example ten files.
- FIG. 5 illustrates a second embodiment 4.2 of module 4 of FIG. 3 in which all the divisible containers by module 10 of FIG. 6 are determined, and all the possible contents of each of the divisible containers found by means of the module 16 of FIG. 8.
- Step 24 indicates that the choice of a container-content pair has been made and, as for the module of figure 4, one returns then to the entry of the test 2. As indicated previously, the process of Successive Selections then continues until obtaining a short list.
- FIG. 9 illustrates an alternative embodiment of the mechanisms of FIGS. 3 to 8 according to which the process of successive selections can be initialized by application of priority criteria necessarily leading to one or more responses.
- priority selection criteria can be predefined, for example:
- step 401 corresponds to this optional predefinition of one or more priority criteria.
- P the list of priority criteria.
- the next step 402 consists in automatically applying to the set of files F all the priority criteria which have been predefined, in order to prepare the tables S and C described above. With the files remaining at the end of step 402, the algorithm "successive selections" in FIG. 3 is then executed in 403 (steps 401 and 402 corresponding to phase 1 of initialization of the search), which implies successive choices by the applicant as described above.
- the applicant has the option in 404 of choosing one or more priority criteria.
- a positive response to test 404 therefore leads to completing in 405 the list P of the priority criteria already obtained by those who have just been newly chosen.
- the list P of priority criteria gives at least one answer.
- step 402 that is to say that the priority criteria of the list P completed in 405 are automatically applied to all the files F and the process of "successive selections" is restarted. until a negative answer is given to test 404.
- FIGS. 10 to 13 illustrate an example of coding of the contents by bit tables for the implementation of the mechanism described above.
- FIG. 10 is a representation in the form of a tree structure equivalent to the table T of FIG. 1.
- each content of the tree hierarchical table is numbered in the order of encounter according to a recursive scan of the tree structure: c is thus that the first content which depends on the container Cna1 of level or hierarchical rank A carries the number 1 (Cnu1 in FIG. 10), the contents of the container Cna 1.1.1 (rank B) depending on Cnu1 carry the numbers 2 and 3 (Cnu2 and Cnu3), etc.
- the sheet F describing each object consists of a table with as many memory locations as there are contents in the table or tree structure of Figure 10, in this case 9 in the example considered.
- Each of these memory locations can take the logical value 1 if the corresponding content of the table T is included in the file and 0 otherwise.
- the position of each memory location in the file F that is to say its address, corresponds to a content number assigned in the table T as shown in Figure 11.
- each memory location of the file F is associated in a one-to-one way to a container-content pair of the table T.
- the table S is made up of all the files F which have been selected until then. Referring to FIG. 12, it will be assumed that after a first choice of a container Cna1 by an applicant, there are four sheets F1, F2, F3 and F4 in table S. These sheets have the following contents:
- F1 Cnu1, Cnu3, Cnu7 and Cnu8;
- F2 Cnu4, Cnu5, Cnu7 and Cnu9;
- the table C is therefore organized in the same way as a file F: the bits or memory locations constituting this table are arranged in the order of a hierarchical exploration of the contents of the table T.
- the order number of the bit also allows to find in one or more annex files not shown (for example one file per language) the description of the content and vice versa.
- This arrangement also makes it possible to group together the bits of the contents which depend on the same container whatever the hierarchical difference between the container and the contents considered. In the example considered, the order is: Cnu1, Cnu2, Cnu3, Cnu4, Cnu5, Cnu ⁇ , Cnu7, Cnu ⁇ , Cnu9.
- This coding mode has the advantage of allowing a very compact representation of the table T, the files F and the tables S and C if the average number of contents per container of the table T is low. We can indeed represent several contents in a single machine word.
- This coding and organization mode also offers the possibility of making a logical OR especially a machine word, therefore on several contents at the same time, which saves considerable time in finding the contents represented in any of the remaining records.
- the module 16 for selecting the contents of FIG. 8 it will be possible to simultaneously test several contents (as many as bits in a machine word) and this module will be accelerated thereby.
- the disadvantage is that the initialization of the search requires the scanning of all the files, which can be circumvented by constituting pre-sorted auxiliary tables to analyze the first criterion introduced.
- the table S in FIG. 12 consists of a table of pointers to each of the files F selected from the set of files among which the search is carried out.
- table S contains the list of all the files F and a marker indicates the total number of files selected.
- all the cards up to the marker are analyzed, and the selected cards are pushed to one end of the table and the marker is moved to indicate the new number of cards remaining.
- the rejected cards can be packed towards the other end of the table, which allows it to be segmented according to the search stages and therefore to quickly go back on a research stage.
- the described method and system are particularly suitable for multi-criteria research when the research theme allows a hierarchy of these criteria.
- the tree structure or hierarchical structure of table T varies according to the theme considered, that is to say that it is not the same depending on whether this theme concerns for example the automobile, real estate, household appliances, etc.
- the search method described can be preceded by a search in traditional mode, for example by keyword, to select the theme which will constitute the root R of all the containers among which the search will be carried out as described with reference to FIGS. 3 to 9.
- the data processing system for the implementation of the mechanisms described requires data storage means for the storage of the table T, the files F and the tables C and S, calculation means for the implementation of the process described with reference to FIGS. 3 to 9 and interface means for presenting choices to the applicant, to allow him to make these choices and to present to him the result of his choices.
- the data processing system can be of any type and it can in particular be a system with client-server architecture used via a network such as the Internet from a client terminal such as a personal computer PC, mobile phone operated by input or by voice recognition, etc.
- the choices offered to an applicant can be offered to him on the screen of his terminal in the form of dynamic pages composed, for example, of one or more of the following windows:
- - a window representing reactive vertical histograms illustrating prices, measures or qualities (weight, size, surface, area, distance, time, period, color,); - a window of remaining possibilities with the selection criteria (attributes or containers) still possible and, for each of these criteria, the list of available values or content with the number of responses opposite, presented in the form of horizontal histograms or drop-down menus;
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/257,672 US7363292B2 (en) | 2000-04-12 | 2001-04-12 | System for searching and selecting hierarchically structured objects |
AU2001252326A AU2001252326A1 (en) | 2000-04-12 | 2001-04-12 | Search and selection aid system |
EP01925630A EP1272944A1 (fr) | 2000-04-12 | 2001-04-12 | Systeme de recherche et d'aide au choix |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR00/04702 | 2000-04-12 | ||
FR0004702A FR2807849B1 (fr) | 2000-04-12 | 2000-04-12 | Procede et systeme de recherche et d'aide au choix |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001077889A1 WO2001077889A1 (fr) | 2001-10-18 |
WO2001077889A9 true WO2001077889A9 (fr) | 2002-04-04 |
Family
ID=8849179
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2001/001132 WO2001077889A1 (fr) | 2000-04-12 | 2001-04-12 | Systeme de recherche et d'aide au choix |
Country Status (5)
Country | Link |
---|---|
US (1) | US7363292B2 (fr) |
EP (1) | EP1272944A1 (fr) |
AU (1) | AU2001252326A1 (fr) |
FR (1) | FR2807849B1 (fr) |
WO (1) | WO2001077889A1 (fr) |
Families Citing this family (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7366709B2 (en) * | 2004-04-02 | 2008-04-29 | Xpertuniverse, Inc. | System and method for managing questions and answers using subject lists styles |
US20050255842A1 (en) * | 2004-05-17 | 2005-11-17 | Spatial Data Analytics Corporation | Communication system and method for comprehensive collection, aggregation and dissemination of geospatial information |
US20060136383A1 (en) * | 2004-12-20 | 2006-06-22 | Alcatel | Method and system enabling Web content searching from a remote set-top control interface or device |
EP1844406A1 (fr) * | 2005-02-02 | 2007-10-17 | Sdn Ag | Systeme d'autoapprentissage base sur l'utilisation de moteurs de recherche |
US8612570B1 (en) | 2006-09-18 | 2013-12-17 | Emc Corporation | Data classification and management using tap network architecture |
US10394849B2 (en) | 2006-09-18 | 2019-08-27 | EMC IP Holding Company LLC | Cascaded discovery of information environment |
US9323901B1 (en) | 2007-09-28 | 2016-04-26 | Emc Corporation | Data classification for digital rights management |
US8522248B1 (en) | 2007-09-28 | 2013-08-27 | Emc Corporation | Monitoring delegated operations in information management systems |
US9461890B1 (en) | 2007-09-28 | 2016-10-04 | Emc Corporation | Delegation of data management policy in an information management system |
US8868720B1 (en) | 2007-09-28 | 2014-10-21 | Emc Corporation | Delegation of discovery functions in information management system |
US9141658B1 (en) | 2007-09-28 | 2015-09-22 | Emc Corporation | Data classification and management for risk mitigation |
US8548964B1 (en) | 2007-09-28 | 2013-10-01 | Emc Corporation | Delegation of data classification using common language |
FR2956499B1 (fr) * | 2010-02-15 | 2012-04-13 | Airbus Operations Sas | Procede et dispositif permettant l'exploitation fonctionnelle, dans un aeronef, d'un grand nombre d'informations issues de differentes sources |
JP5998835B2 (ja) * | 2012-10-18 | 2016-09-28 | 富士ゼロックス株式会社 | 情報処理装置及びプログラム |
CN103714127A (zh) * | 2013-12-11 | 2014-04-09 | 金蝶软件(中国)有限公司 | 表格分信息组展示方法和系统 |
US11082757B2 (en) | 2019-03-25 | 2021-08-03 | Rovi Guides, Inc. | Systems and methods for creating customized content |
US11195554B2 (en) | 2019-03-25 | 2021-12-07 | Rovi Guides, Inc. | Systems and methods for creating customized content |
US11562016B2 (en) | 2019-06-26 | 2023-01-24 | Rovi Guides, Inc. | Systems and methods for generating supplemental content for media content |
US11256863B2 (en) | 2019-07-19 | 2022-02-22 | Rovi Guides, Inc. | Systems and methods for generating content for a screenplay |
US11145029B2 (en) * | 2019-07-25 | 2021-10-12 | Rovi Guides, Inc. | Automated regeneration of low quality content to high quality content |
US11604827B2 (en) | 2020-02-21 | 2023-03-14 | Rovi Guides, Inc. | Systems and methods for generating improved content based on matching mappings |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5765149A (en) * | 1996-08-09 | 1998-06-09 | Digital Equipment Corporation | Modified collection frequency ranking method |
EP0827063B1 (fr) * | 1996-08-28 | 2002-11-13 | Koninklijke Philips Electronics N.V. | Procédé et dispositif pour sélectionner un article d'information |
US5920861A (en) * | 1997-02-25 | 1999-07-06 | Intertrust Technologies Corp. | Techniques for defining using and manipulating rights management data structures |
US6874146B1 (en) * | 1999-06-30 | 2005-03-29 | Unisys Corporation | Metadata driven system for effecting extensible data interchange based on universal modeling language (UML), meta object facility (MOF) and extensible markup language (XML) standards |
US6732331B1 (en) * | 2000-02-15 | 2004-05-04 | Vlad Alexander | System and process for managing content organized in a tag-delimited template using metadata |
-
2000
- 2000-04-12 FR FR0004702A patent/FR2807849B1/fr not_active Expired - Fee Related
-
2001
- 2001-04-12 EP EP01925630A patent/EP1272944A1/fr not_active Withdrawn
- 2001-04-12 WO PCT/FR2001/001132 patent/WO2001077889A1/fr not_active Application Discontinuation
- 2001-04-12 AU AU2001252326A patent/AU2001252326A1/en not_active Abandoned
- 2001-04-12 US US10/257,672 patent/US7363292B2/en not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
US7363292B2 (en) | 2008-04-22 |
FR2807849B1 (fr) | 2002-07-26 |
AU2001252326A1 (en) | 2001-10-23 |
EP1272944A1 (fr) | 2003-01-08 |
FR2807849A1 (fr) | 2001-10-19 |
WO2001077889A1 (fr) | 2001-10-18 |
US20030105750A1 (en) | 2003-06-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2001077889A9 (fr) | Systeme de recherche et d'aide au choix | |
EP0593354B1 (fr) | Procédé d'aide à l'optimisation d'une requête d'un système de gestion de base de données relationnel | |
CA2385503C (fr) | Procede de classification thematique de documents, module de classification thematique et moteur de recherche incorporant un tel module | |
EP2188744B1 (fr) | Installation de gestion d'une base de données | |
FR2840088A1 (fr) | Moteur de recherche et base de donnees, et procedes pour leur mise en oeuvre | |
WO2006027470A2 (fr) | Edition de graphiques vectoriels , notamment de cartes geographiques | |
EP1912170A1 (fr) | Dispositif informatique de corrélation propagative | |
FR2859801A1 (fr) | Procede de traitement de donnees sur la base de structures dynamiques d'elements simples | |
EP0599707A1 (fr) | Méthode d'extraction de profils de statistiques, utilisation des statistiques créées par la méthode | |
WO2002003245A1 (fr) | Procede de stockage d'objets informationnels au format xml dans une base de donnees relationnelle | |
FR2917518A1 (fr) | Procede de tri d'informations | |
EP4300326A1 (fr) | Procédé d'appariement d'un ensemble à évaluer et d'une liste de référence, moteur d'appariement et programme d'ordinateur correspondants | |
WO2020169898A1 (fr) | Procédé de fourniture d'une information pertinente associée à un brevet | |
EP1222575A1 (fr) | Procede pour creer une structure hierarchique variable d'acces a des actions dans un systeme informatique | |
FR3093200A1 (fr) | Procédé de détermination d’un schéma comportemental | |
FR3112220A1 (fr) | Procede de recherche assistee dans une base de donnees et systeme de recherche associe | |
WO2019106239A1 (fr) | Procédé de configuration d'un paramètre variable lié à l'affichage d'une formation et système pour la mise en œuvre du procédé | |
WO2001086496A1 (fr) | Systeme et procede de traitement de donnes pour l'acces cible a un serveur a partir d'une interrogation en langage naturel | |
WO2007088254A1 (fr) | Systeme d'information structure, relationnel et incremental | |
WO2019034452A1 (fr) | Procede de completion de requete sql | |
FR3096157A1 (fr) | procédé d’indexation multidimensionnelle de contenus textuels | |
FR2828308A1 (fr) | Systeme de gestion d'une base de donnees topologique | |
FR3066300A1 (fr) | Recherche semantique d'hebergement, basee sur les images | |
WO2003079697A2 (fr) | Système et procédé de selection d'au moins un produit destine à un utilisateur, parmi une pluralité de produits | |
WO2006035144A2 (fr) | Systeme et procede de construction automatique de bases de connaissance |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
AK | Designated states |
Kind code of ref document: C2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: C2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
COP | Corrected version of pamphlet |
Free format text: PAGES 1-13, DESCRIPTION, REPLACED BY CORRECT PAGES 1-13; PAGES 14-16, CLAIMS, REPLACED BY CORRECT PAGES 14-16; PAGES 1/8-8/8, DRAWINGS, REPLACED BY CORRECT PAGES 1/8-8/8; PUBLISHED INTERNATIONAL SEARCH REPORT REPLACED BY CORRECT INTERNATIONAL SEARCH REPORT |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10257672 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001925630 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 2001925630 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: JP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2001925630 Country of ref document: EP |