WO1996036002A1 - Systeme electronique de traitement de l'information et procede de generation d'une representation graphique d'un enchainement logique de cles de recherche - Google Patents

Systeme electronique de traitement de l'information et procede de generation d'une representation graphique d'un enchainement logique de cles de recherche Download PDF

Info

Publication number
WO1996036002A1
WO1996036002A1 PCT/EP1995/001817 EP9501817W WO9636002A1 WO 1996036002 A1 WO1996036002 A1 WO 1996036002A1 EP 9501817 W EP9501817 W EP 9501817W WO 9636002 A1 WO9636002 A1 WO 9636002A1
Authority
WO
WIPO (PCT)
Prior art keywords
search
search terms
operators
logical
symbols
Prior art date
Application number
PCT/EP1995/001817
Other languages
German (de)
English (en)
Inventor
Gerhard Kreysa
Karlheinz DÖHLE
Original Assignee
Dechema Deutsche Gesellschaft Für Chemisches Apparatewesen, Chemische Technik Und Biotechnologie E.V.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Dechema Deutsche Gesellschaft Für Chemisches Apparatewesen, Chemische Technik Und Biotechnologie E.V. filed Critical Dechema Deutsche Gesellschaft Für Chemisches Apparatewesen, Chemische Technik Und Biotechnologie E.V.
Priority to DE29521576U priority Critical patent/DE29521576U1/de
Priority to PCT/EP1995/001817 priority patent/WO1996036002A1/fr
Priority to AU25640/95A priority patent/AU2564095A/en
Publication of WO1996036002A1 publication Critical patent/WO1996036002A1/fr

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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/242—Query formulation
    • G06F16/2428—Query predicate definition using graphical user interfaces, including menus and forms

Definitions

  • the present invention relates to an electronic information system and to a method for generating a graphic image representation of a logical combination of search terms.
  • Such known electronic information systems enable the user in the context of a search query to open an auxiliary menu in which the connection of the link operators and the manner in which they are to be entered is described.
  • the present invention is based on the object of developing a method and an electronic information system for generating a graphical To create a phical image representation of a logical linkage of search terms, which visually illustrates the complex relationships of the linkage operations in a simple manner to the user and, after the search query has been formulated, gives the user the possibility of checking the expected result as to whether it actually meets his expectations corresponds.
  • the present invention provides a method for generating a graphic image representation of a logical combination of search terms in an electronic information system that can be queried using search terms and logical combination operators, with the following steps:
  • the present invention also provides an electronic information system which can be queried using search terms and logical combination operators (218, 220, 222)
  • a graphic display device for generating a graphic image representation (300) of a logical link of search terms (202, 204, 206, 208);
  • a graphic control device for controlling the graphic display device, which has the following features:
  • a device for entering at least two search terms (202, 204, 206, 208);
  • An advantage of the present invention is that the application of the method in an electronic information system leads to a more comfortable user guidance, so that the probability that the user guidance is operated by users who are not familiar with general linking operations increases.
  • Another advantage of the present invention is that it creates the possibility of checking the plausibility of search queries entered before they are processed.
  • FIG. 1 shows a flow diagram of a preferred exemplary embodiment of the method according to the invention
  • FIG. 2 shows an illustration of a screen display of an electronic information system for the input of search terms and corresponding link operators
  • FIG. 3 shows a representation of a selected graphic representation on the basis of the assigned symbols and the entered logical combination operators in an electronic information system.
  • Search term denotes a text to be searched for in the information system. Search terms can be, for example, a search word, a free text fragment, a data category, a country or a location.
  • a symbol denotes a graphic representation that is assigned to each search term. Symbols can e.g. Dots or circles with different colors or hatching.
  • Logical link operator A logical link operator is an operator by which e.g. two search terms are logically linked. Examples of linking operators of Boole's algebra are the "AND”, “OR” or “NOT” operators.
  • Priority determines the ranking, in which certain search terms or combinations of search terms are processed (analogous to the summary of certain mathematical terms in brackets, for example (a + b) xc).
  • Search formulation A search formulation is formed by the entered search terms or the symbols assigned to them and by the link operators.
  • Possible / impossible search formulation This denotes permissible / non-permissible logical combinations of symbols or search terms. This also includes non-meaningful links that would still be possible.
  • the method according to the invention is started in a first step S100.
  • At least two search terms are subsequently entered in step S102. It is obvious that the present invention is not limited to the entry of only two search terms, but that more than two search terms can also be entered in step S102.
  • step S104 the entered search terms are each assigned graphic symbols. A different symbol is assigned to each search term entered.
  • step S106 the individual logical links are entered by entering the corresponding logical link operators.
  • step S108 a query is made regarding the assignment of any priorities.
  • priorities are assigned
  • the method goes to step S110, in which selected priorities are assigned the higher are priorities of other, unselected search terms. In order to summarize search terms with the same priority level, these are put in brackets.
  • the associated symbols can be placed in parentheses according to their priorities.
  • step S108 If it has been determined in step S108 that no priority is to be assigned, or step S110 has been carried out, the routine goes to step S112.
  • the entered search formulation is displayed in step S112.
  • step S114 in which it is determined whether the entered search formulation is possible.
  • a table is provided with all possible logical combinations of the symbols, on the basis of which it is checked whether the search formulation entered is a possible, mathematically correct or sensible logical combination of the symbols.
  • step S114 If the possibility of the search formulation is affirmed in step S114, the method goes to step S116, in which a graphic representation of a plurality of predetermined graphic representations, which represent the possible logical combinations of the symbols, on the basis of the assigned symbols and the input logical logic operator is selected.
  • step S118 The selected graphical representation is then displayed on a screen in step S118.
  • the method then ends in step S120.
  • step S122 If it was determined in step S114 that the specified search formulation is not possible, then in step S122 an error message is displayed on the screen, informing the user of the electronic information system of the impossibility of his search formulation. The method then goes to step S120, where it ends.
  • FIG. 1 is a preferred exemplary embodiment of the present invention.
  • steps S108 to S114 and step S122 are optional.
  • steps S108 and S110 are only useful in the method described with reference to FIG. 1 in the case in which three or more search terms have been entered, since otherwise an assignment of a priority is superfluous.
  • FIG. 2 shows a screen display 200 for entering search terms and corresponding operators.
  • the screen display 200 comprises four input fields 202, 204, 206, 208 for displaying the entered search terms. These search terms 202, 204, 206, 208 are assigned simple, differently hatched or differently colored graphic symbols 210, 212, 214, 216.
  • the individual search terms 202, 204, 206, 208 are linked via fields 218, 220, 222 via link operators.
  • different linking operators can be speaking selection fields 218a, 220a, 222a of the fields 218, 220, 222 can be selected.
  • the represented search formulation 224 is represented by a representation of the individual symbols 226, 228, 230, 232 of the search formulation 224.
  • the search formulation 224 also contains fields 234, 236, 238, 240, 242, 244, which serve to bring about a corresponding priority of selected symbols and thus of entered search terms by setting or entering brackets.
  • the symbols 226 and 228 are provided with a first priority, for example. These two symbols 226 and 228 and the symbol 230 are combined with a further priority, as is illustrated by the brackets shown in the fields 234, 238 and 242.
  • the corresponding selected combination operators can be shown between the individual symbols 226, 228, 230, 232 (not shown in FIG. 2).
  • a user can activate the link graphic by actuating the field 246.
  • FIG. 3 shows a window 300 which has been superimposed on the screen display from FIG. 2.
  • the subsets corresponding to the individual search terms are represented by overlapping circles 302, 304, 306 and 308 which, like the graphic symbols 210, 212, 214, 216 representing the search terms, are hatched differently or have different colors.
  • the number of hits 310 resulting from the search formulation 224 is highlighted in color.
  • each theoretically possible search formulation there is either a corresponding link graphic 300 or a mathematical model for generating a link graphic in which the resultant set 310 of hits is highlighted by hatching or color or some other identifier.
  • the query of the link graphic 300 has the effect that the search formulation 224 created by the user is first checked to see whether it matches a search formulation from the totality of all theoretically possible search formulations.
  • the corresponding link graphic 300 is displayed, which enables the user to easily judge whether the number of hits 310 shown in the graphic 300 corresponds to what he is using the search phrase 224 intended its search query.
  • the electronic information system can contain a large amount of information, which can include, but is not limited to, texts, images, audio information or tapes, slide shows or videos.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • User Interface Of Digital Computer (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Processing Or Creating Images (AREA)

Abstract

Système électronique de traitement de l'information et procédé de génération d'une représentation graphique d'un enchaînement logique de clés de recherche. Selon l'invention, les étapes suivantes sont réalisées: entrée d'au moins deux clés de recherche, attribution d'un symbole à chaque clé de recherche, entrée d'opérateurs logiques indicateurs de l'enchaînement logique des clés de recherche, et sélection et visualisation d'une représentation graphique parmi une pluralité de représentations graphiques prédéterminées qui représentent les enchaînements logiques possibles des symboles au moyen des symboles attribués et des opérateurs logiques entrés.
PCT/EP1995/001817 1995-05-12 1995-05-12 Systeme electronique de traitement de l'information et procede de generation d'une representation graphique d'un enchainement logique de cles de recherche WO1996036002A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
DE29521576U DE29521576U1 (de) 1995-05-12 1995-05-12 Elektronisches Informationssystem zum Erzeugen einer graphischen Bilddarstellung einer logischen Verknüpfung von Suchbegriffen
PCT/EP1995/001817 WO1996036002A1 (fr) 1995-05-12 1995-05-12 Systeme electronique de traitement de l'information et procede de generation d'une representation graphique d'un enchainement logique de cles de recherche
AU25640/95A AU2564095A (en) 1995-05-12 1995-05-12 Electronic information processing system and process for gen erating a graphic representation of a logical linkage of sea rch keys

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP1995/001817 WO1996036002A1 (fr) 1995-05-12 1995-05-12 Systeme electronique de traitement de l'information et procede de generation d'une representation graphique d'un enchainement logique de cles de recherche

Publications (1)

Publication Number Publication Date
WO1996036002A1 true WO1996036002A1 (fr) 1996-11-14

Family

ID=8166017

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP1995/001817 WO1996036002A1 (fr) 1995-05-12 1995-05-12 Systeme electronique de traitement de l'information et procede de generation d'une representation graphique d'un enchainement logique de cles de recherche

Country Status (3)

Country Link
AU (1) AU2564095A (fr)
DE (1) DE29521576U1 (fr)
WO (1) WO1996036002A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19814293A1 (de) * 1998-03-31 1999-10-07 Joachim Zuckarelli Verfahren zur Visualisierung von Suchergebnissen für Suchanfragen mit zwei Suchbegriffen
DE19959692A1 (de) * 1999-12-06 2001-06-07 Deutsche Telekom Ag Verfahren zur grafischen Darstellung gespeicherter Daten

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0541298A2 (fr) * 1991-11-08 1993-05-12 International Business Machines Corporation Dispositif de recherche graphique pour bases de données

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0541298A2 (fr) * 1991-11-08 1993-05-12 International Business Machines Corporation Dispositif de recherche graphique pour bases de données

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SPOERRI A: "INFOCRYSTAL: A VISUAL TOOL FOR INFORMATION RETRIEVAL", PROCEEDINGS OF THE CONFERENCE ON VISUALIZATION, SAN JOSE, OCT. 25 - 29, 1993, no. -, 25 October 1993 (1993-10-25), INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, pages 150 - 157, XP000475422 *

Also Published As

Publication number Publication date
DE29521576U1 (de) 1997-09-04
AU2564095A (en) 1996-11-29

Similar Documents

Publication Publication Date Title
DE3855756T2 (de) Schnittstelle für Materialliste für CAD/CAM-Umgebung
DE10051680B4 (de) Schema zur Darstellung mehrerer Druckauftragsabänderungselemente in einer Drucksoftware-Benutzerschnittstelle
DE60003246T2 (de) Software Schnittstelle
DE68919503T2 (de) Methode und System zur Darstellung einer Benutzeroberfläche auf einem Computerbildschirm.
DE68926428T2 (de) Personalisierung von Benutzerschnittstellen für Anwendungsprogramme
DE69400276T2 (de) Zeichensatzsystem für texteingabe
DE19627472A1 (de) Datenbanksystem
DE19842688A1 (de) Standard-Benutzerschnittstellen-Steuerung für einen Datenanbieter
DE69628374T2 (de) Datenverwaltungssystem
DE10144390A1 (de) Visualisierung eines Vergleichsergebnisses mindestens zweier in Verzeichnisbäumen organisierter Datenstrukturen
WO2004017147A2 (fr) Outil et procede permettant de planifier, de concevoir ou de programmer une installation
EP1159689A2 (fr) Dispositif de detection et de navigation pour documents hypertexte
WO1996036002A1 (fr) Systeme electronique de traitement de l'information et procede de generation d'une representation graphique d'un enchainement logique de cles de recherche
EP3561750A1 (fr) Procédé mis en uvre par ordinateur destiné à la configuration et à la visualisation à l'aide des banques de données d'un syst?me de châssis
DE102007040289A1 (de) Verfahren und System zum Erstellen einer fahrzeugindividuellen Bedienungsanleitung
DE68926119T2 (de) Verfahren zur anzeige oder zum speichern von beziehungsänderungen zwischen objekten in einem datenverarbeitungssystem
DE102006044800A1 (de) Fahrzeugkommunikationssystem für einen Kraftwagen mit einem graphischen Benutzermenü und Verfahren zum Erweitern eines in einer hierarchischen Baumstruktur organisierten graphischen Benutzermenüs
DE102009010908A1 (de) Verfahren und Anordnung zur Steuerung des Einfügens von Registerblättern in einen Druckauftrag sowie ein entsprechendes Computerprogramm und ein entsprechendes computerlesbares Speichermedium
DE102006044865B4 (de) Verfahren zur rechnergestützten Verarbeitung von digitalisierten Informationen zur Anzeige auf einem Anzeigemittel
WO2011103938A1 (fr) Appareil de terrain relevant de la technique d'automatisation des processus, et procédé d'édition de texte et/ou de numération, et dispositif présentant une unité d'affichage et une unité de commande
WO2005069720A2 (fr) Creation d'une interface utilisateur/interface d'affichage graphique pour un vehicule automobile
DE102019205583A1 (de) Anordnung und Verfahren zum Konfigurieren eines Produkts
DE102010033873A1 (de) Selektorsystem für Textverarbeitungsstil mit Verwendung einer 2D-Matrix
DE69016651T2 (de) Benutzerschnittstelle für Datenverarbeitungsanlage und Datenverabeitungsanlage mit einer sochen Schnittstelle.
DE102007044460A1 (de) Verfahren zum automatischen Erfassen einer Menge von Elementen

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AU BR CA CN CZ JP KR MX PL RU SG US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
ENP Entry into the national phase

Ref country code: US

Ref document number: 1997 952031

Date of ref document: 19971104

Kind code of ref document: A

Format of ref document f/p: F

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA