WO2001042383A2 - Procede de representation graphique de donnees enregistrees - Google Patents

Procede de representation graphique de donnees enregistrees Download PDF

Info

Publication number
WO2001042383A2
WO2001042383A2 PCT/EP2000/010489 EP0010489W WO0142383A2 WO 2001042383 A2 WO2001042383 A2 WO 2001042383A2 EP 0010489 W EP0010489 W EP 0010489W WO 0142383 A2 WO0142383 A2 WO 0142383A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
weighting
relationships
nodes
represented
Prior art date
Application number
PCT/EP2000/010489
Other languages
German (de)
English (en)
Other versions
WO2001042383A3 (fr
Inventor
Bernd Groskopf
Marianne Stuhler
Frank Pirnke
Olaf Heinzmann
Original Assignee
Deutsche Telekom Ag
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 Deutsche Telekom Ag filed Critical Deutsche Telekom Ag
Publication of WO2001042383A2 publication Critical patent/WO2001042383A2/fr
Publication of WO2001042383A3 publication Critical patent/WO2001042383A3/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/26—Visual data mining; Browsing structured data
    • 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/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists

Definitions

  • the invention relates to a method according to the preamble of claim 1.
  • Stored data can be divided into individual data sets according to a variety of different criteria. These criteria can be determined, for example, by the location, age, time or type of storage or also by the content of the stored data. There are various types of relationships between the individual data sets.
  • the data sets and their relationships with one another can be represented graphically by a 2-dimensional network or by a 3-dimensional grid model in which the data sets are represented as nodes and the relationships between them as lines between the nodes are.
  • the network representation it is possible to identify relationships between the data volumes and to carry out targeted research or the like. However, it is only specified whether there is a relationship at all between two sets of data; there is no further statement. This can make research very time-consuming and often not deliver an optimal result.
  • Known such networks often have a tree structure, i.e. Amounts of data between which there is a relationship are shown in a hierarchical order. Cross-connections are not shown, so that non-hierarchical relationships cannot be recognized. This can also affect the search results.
  • Each individual relationship can be weighted several times.
  • the weighting refers to one criterion (e.g. group, topic, user).
  • the weighting of the individual relationships should be shown as conspicuously as possible, preferably via the strength or the color of the associated line.
  • the optimal order of viewing the individual data sets during research can be made even easier determine.
  • the weighting of the respective amount of data should be displayed as conspicuously as possible, in particular by the size, shape and / or color of the associated node.
  • each individual amount of data can be weighted several times.
  • the weighting refers to one criterion (e.g. group, topic, user).
  • weightings both for the relationships between data sets and for the data sets themselves are set when the data sets are saved; however, they can be changed at any time if the amount of data changes or the meaning of a relationship or amount of data changes.
  • FIG. 1 shows an unfiltered network with weighted relationships and amounts of data
  • the network shown in FIG. 1, which can be displayed on a screen, is a navigation instrument in user interfaces of computer programs.
  • the nodes are designed as pentagons. All nodes are displayed with their name, an icon or the like.
  • the numbers entered in the nodes indicate the weighting of the respective amount of data that was set or changed after the amount of data was saved.
  • a line is shown between every two nodes, which shows the degree of the relationship between the associated amounts of data. The degree or weighting of a relationship is indicated here by the shape of the line, namely solid, dashed or dotted.
  • a data set can have relationships with a different number of other data sets; data sets that are unrelated to another data set are also possible. There can be a direct relationship between two sets of data on the one hand and a relationship via a third set of data on the other.
  • the lines between the nodes should be rendered inconspicuously.
  • a node of interest is clicked with a mouse click. All lines leading to this node are then highlighted in striking colors depending on their weighting.
  • the filter reduces the number of nodes and / or lines, ie part of the network is left out.
  • 2 shows a type of filtering, in which only the nodes directly connected to a selected node A and the connecting lines between them are shown.
  • the reproduced part of the network has a star-shaped structure.
  • FIG. 4 shows the part of the network in FIG. 1 which comprises nodes with the weights 3 and 5. These correspond, for example, to a weighting of 60% and 100%.
  • the figures 2 to 4 only show some selection criteria for the representation of a part of the overall network. These criteria can be determined in a wide variety of ways depending on the requirements of a search to be carried out.

Abstract

La présente invention concerne un procédé de représentation graphique de données enregistrées, selon une configuration qui forme un réseau. Selon ce procédé, les quantités de données individuelles sont reproduites sous forme de noeuds et les relations entre de telles quantités de données sont reproduites sous forme de lignes entre des noeuds correspondants. L'objectif de cette invention est d'obtenir des résultats optimaux, en peu de temps, lorsqu'une recherche concernant les données enregistrées est menée. Afin d'atteindre cet objectif, les relations sont représentées de manière pondérée, respectivement entre deux quantités de données, de façon indépendante d'un ordre hiérarchique. La réalisation de la recherche peut être davantage facilitée par pondération des quantités de données individuelles également, la pondération d'une quantité de données pouvant être détectée dans le réseau représenté.
PCT/EP2000/010489 1999-12-06 2000-10-25 Procede de representation graphique de donnees enregistrees WO2001042383A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19959692.1 1999-12-06
DE19959692A DE19959692A1 (de) 1999-12-06 1999-12-06 Verfahren zur grafischen Darstellung gespeicherter Daten

Publications (2)

Publication Number Publication Date
WO2001042383A2 true WO2001042383A2 (fr) 2001-06-14
WO2001042383A3 WO2001042383A3 (fr) 2002-08-15

Family

ID=7932214

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2000/010489 WO2001042383A2 (fr) 1999-12-06 2000-10-25 Procede de representation graphique de donnees enregistrees

Country Status (2)

Country Link
DE (1) DE19959692A1 (fr)
WO (1) WO2001042383A2 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102289458A (zh) * 2010-06-18 2011-12-21 微软公司 呈现层次数据结构的显示特征
US10217115B2 (en) * 2001-08-30 2019-02-26 Goldman Sachs & Co. LLC Apparatus, methods, and articles of manufacture for business analysis

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7310780B2 (en) 2003-08-14 2007-12-18 International Business Machines Corporation Methods, systems and computer program products for visually tethering related graphical objects

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5912674A (en) * 1997-11-03 1999-06-15 Magarshak; Yuri System and method for visual representation of large collections of data by two-dimensional maps created from planar graphs
US5926180A (en) * 1996-01-16 1999-07-20 Nec Corporation Browsing unit and storage medium recording a browsing program thereon
EP0950962A2 (fr) * 1998-04-17 1999-10-20 Xerox Corporation Méthodes pour visualiser des tranformations dans des séries apparentées de graphes

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6202058B1 (en) * 1994-04-25 2001-03-13 Apple Computer, Inc. System for ranking the relevance of information objects accessed by computer users
AU2564095A (en) * 1995-05-12 1996-11-29 Dechema Deutsche Gesellschaft Fur Chemisches Apparatewesen, Chemische Technik Und Biotechnologie E.V. Electronic information processing system and process for gen erating a graphic representation of a logical linkage of sea rch keys
DE19901908A1 (de) * 1999-01-19 1999-09-23 Joachim Zuckarelli Verfahren zur Visualisierung von Suchergebnissen für Suchanfragen mit zwei verknüpften Suchbegriffen

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5926180A (en) * 1996-01-16 1999-07-20 Nec Corporation Browsing unit and storage medium recording a browsing program thereon
US5912674A (en) * 1997-11-03 1999-06-15 Magarshak; Yuri System and method for visual representation of large collections of data by two-dimensional maps created from planar graphs
EP0950962A2 (fr) * 1998-04-17 1999-10-20 Xerox Corporation Méthodes pour visualiser des tranformations dans des séries apparentées de graphes

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10217115B2 (en) * 2001-08-30 2019-02-26 Goldman Sachs & Co. LLC Apparatus, methods, and articles of manufacture for business analysis
CN102289458A (zh) * 2010-06-18 2011-12-21 微软公司 呈现层次数据结构的显示特征

Also Published As

Publication number Publication date
DE19959692A1 (de) 2001-06-07
WO2001042383A3 (fr) 2002-08-15

Similar Documents

Publication Publication Date Title
EP1587244B1 (fr) Procédé de configuration d'un dispositif de filtrage pour un flux de données comprenant des trames, et testeur de protocole
EP1425661A2 (fr) Visualisation du resultat d'une comparaison d au moins deux structures arborescentes de donnees
EP1864233A1 (fr) Procede pour disposer des donnees objet dans des cartes electroniques
DE102010042999A1 (de) Verfahren zur Bereitstellung eines Bedienmenüs für ein Feldgerät der Prozessautomatisierungstechnik
EP1720106A1 (fr) Procédé pour la classification et la réprésentation graphique de contributions textuelles en ligne
WO2001042383A2 (fr) Procede de representation graphique de donnees enregistrees
DE3143555A1 (de) Dachkonstruktion fuer ein fahrzeug
Schnabel Teilnahmeverhalten bei Unternehmensbefragungen
DE2940259C2 (de) Zweistufiges Koppelfeld
EP0856176A1 (fr) Systeme de gestion de banque de donnees et procede de transmission de donnees
DE10213231A1 (de) Verfahren zur computergestützten Sortimentsoptimierung und Computersystem
DE1435473A1 (de) Spinnduese zur Herstellung von Verbundfaeden
Hofacker Unternehmensnetzwerke zur Durchsetzung eines Standards
DE102013214197A1 (de) Entwicklungsverfahren für ein technisches Produkt
Arida Soziale Differenzierung und Wirtschaftstheorie
DE10043853A1 (de) Verfahren zur Erstellung von Synthesepfaden
DE10017608B4 (de) Verfahren zur Durchführung von Operationen in einem Datenbanksystem
DE670084C (de) Verfahren zur Verminderung von durch Wellenwiderstandsschwankungen hervorgerufenen Stoerungen in aus mehreren Verstaerkerfeldern bestehenden Fernmelde- und insbesondere Hochfrequenzkabelanlagen
Zainzinger Väterkarenz in Österreich–eine Typologie.
EP0578841A1 (fr) Méthode pour générer des lignes de contour avec un système d'ordinateur
DE10001613C2 (de) Verfahren sowie Datenverarbeitungsanlage zur Verwaltung von Datensätzen
Schiller Die Leistungen der sowjetischen Viehwirtschaft
DE1400475B2 (de) Vorrichtung fuer den rohrleitungslosen aufbau unterschied licher hydraulicher kreislaeufe
DE2550917A1 (de) Bausatz aus systematisch angeordneten elementen
EP1553506B1 (fr) Filtre de données dans un réseau informatique

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): CA US

AL Designated countries for regional patents

Kind code of ref document: A2

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

WWE Wipo information: entry into national phase

Ref document number: 2000972861

Country of ref document: EP

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
WWW Wipo information: withdrawn in national office

Ref document number: 2000972861

Country of ref document: EP