WO2002069192A1 - Système et procédé de visualisation de données - Google Patents

Système et procédé de visualisation de données Download PDF

Info

Publication number
WO2002069192A1
WO2002069192A1 PCT/NZ2002/000021 NZ0200021W WO02069192A1 WO 2002069192 A1 WO2002069192 A1 WO 2002069192A1 NZ 0200021 W NZ0200021 W NZ 0200021W WO 02069192 A1 WO02069192 A1 WO 02069192A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
visualisation
fact
sets
data sets
Prior art date
Application number
PCT/NZ2002/000021
Other languages
English (en)
Inventor
Andrew John Cardno
Original Assignee
Compudigm International Limited
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 Compudigm International Limited filed Critical Compudigm International Limited
Publication of WO2002069192A1 publication Critical patent/WO2002069192A1/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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/34—Browsing; Visualisation therefor

Definitions

  • the invention relates to a data visualisation system and method, particularly but not solely designed to graphically describe or represent information contained within a data warehouse in a user friendly way.
  • the invention provides a data visualisation system comprising a data memory in which is maintained one or more fact data sets comprising an identifier and one or more attributes and one or more finite element data sets wherein the members of each finite element data set define the range of possible values for at least one attribute of at least one fact data set; a retrieval component arranged to retrieve one or more data sets from the memory; and a display component arranged to display a graphical representation of a chosen subset of the set of all fact data sets in the memory as a series of data values.
  • the invention provides a data visualisation computer program comprising a series of fact data sets comprising an identifier and one or more attributes stored in a data memory, and one or more finite element data sets wherein the members of each finite data set defines a range of possible values for at least one attribute of at least one fact data set maintained in a data memory, a retrieval component arranged to retrieve one or more data sets from the memory; and a display component arranged to display a graphical representation of a chosen subset of the set of all fact data sets in the memory as a series of data values.
  • the invention provides a method of data visualisation comprising the steps of maintaining in a data memory one or more fact data sets comprising an identifier and one or more finite element data sets wherein the members of each finite data set defines the range of possible values for at least one attribute of at least one fact data set; retrieving one or more data sets from the memory; and displaying a graphical representation of a chosen subset of the set of all fact data sets in the memory as a series of data values.
  • Figure 1 shows a block diagram of a system in which one form of the invention may be implemented
  • Figure 2 shows the preferred system architecture of hardware on which a present invention may be implemented
  • FIG. 3 is a preferred representation generated in accordance with the invention.
  • FIG. 4 is a preferred representation generated in accordance with the invention.
  • Figure 5 is a preferred representation generated in accordance with the invention including contoured data
  • Figure 6 is a further preferred representation generated in accordance with the invention including contoured data.
  • Figure 7 is a further preferred representation generated in accordance with the invention.
  • FIG. 1 illustrates a block diagram of the preferred system 100 in which the data visualisation sysem, method or computer program of the present invention may be implemented.
  • the system includes one or more clients 120, for example 120A, 120B, 120C, 120D, 120E and 120F, which each may comprise a personal computer or workstation described below or alternatively any computing device.
  • Each client 120 is interfaced to a workstation 130 as shown in Figure 1.
  • Each client 120 could be connected directly to the workstation 130, could be connected through a local area network or LAN, or could be connected through the Internet.
  • Clients 120A and 120B for example, are connected to a network 140, such as a local area network or LAN.
  • the network 140 could be connected to a suitable network server
  • Client 120C is shown connected directly to the workstation 130.
  • Clients 120D, 120E and 120F are shown connected to the workstation 130 through the Internet 150.
  • Client 120D is shown as connected to the Internet 150 with a dial-up or other suitable connection and clients 120E and 120F are shown connected to a network 160 such as a local area network or LAN, the network 160 connected to a suitable network server 165.
  • the preferred system 100 further comprises a data repository 170, for example a data warehouse maintained in a memory. It is envisaged that the data repository may alternatively comprise a single database, a collection of databases, or a data mart.
  • the preferred data repository 170 includes data from a variety of sources, and could include data representing interactions between customers and merchants.
  • a merchant will operate in a commercial premises or store from which a customer purchases goods or services. As a customer interacts with a merchant, the interaction generates interaction data which is then migrated to the data repository 170.
  • the workstation 130 operates under the control of appropriate operating and application software having a data memory 131 connected to a server 132. The invention is arranged to retrieve data from the data repository 170, process the data with the server 132 and to display the data on a client workstation 120 as described below.
  • FIG. 2 shows the preferred system architecture of a client 120 or workstation 130.
  • the computer system 200 typically comprises a central processor 202, a main memory 204 for example RAM and an input/output controller 206.
  • the computer system 200 also comprises peripherals such as a keyboard 208, a pointing device 210 for example a mouse, track ball or touch pad, a display or screen device 212, a mass storage memory 214 for example a hard disk, floppy disk or optical disc, and an output device 216 for example a printer.
  • the system 200 could also include a network interface card or controller 218 and/or a modem 220.
  • the individual components of the system 200 could communicate through a system bus 222, or alternatively could be distributed from each other and interfaced over a network.
  • the data stored in the data repository 170 could be stored in mass storage 214 of the workstation 130, in a client workstation 120, or on a further data memory interfaced to the workstation 130 and/or client 120.
  • Data stored in the data repository 170 could constitute a data warehouse.
  • a data warehouse is comprised of one or more databases.
  • the one or more databases comprised of two types of table: FACT tables and DIMENSION tables.
  • a FACT table is a table on which queries can be performed. These facts could include individual interactions involving various entities such as companies or merchants.
  • a FACT table commonly stores large amounts of information and is essentially comprised of source data columns.
  • a DIMENSION table is a table which defines meaningful ways of separating data contained within a fact table. These attributes or dimensions could include for example a sector identifier representing the industry in which the entity or company operates, and a location identifier identifying the place of operation.
  • Figure 3 illustrates one preferred representation generated in accordance with the invention in which the data repository 170 includes a plurality of tables, for example COMPANY DIMENSIONS table 300 and FACT table 310.
  • COMPANY DIMENSIONS table 300 could include a plurality of records, each record representing a company, organisation, merchant or other entity.
  • the company dimensions table could include various fields for example company identifier 302, sector identifier 304 and location identifier 306.
  • the FACT table 310 could include a plurality of records, each record representing a different interaction involving a company from the COMPANY DIMENSIONS table
  • the FACT table 310 could include various fields, for example, a trade or interaction identifier 312, a company identifier 314, a sector identifier 316 and a monetary value 318.
  • a retrieval component for example, a query processor or search engine could obtain user queries and apply these queries to the data table stored in the data repository 170.
  • a display component could display to a user a graphical representation of the results of such queries.
  • the display could be a software component arranged to display graphic images to a user or the display could be a hardware component such as a computer screen.
  • the invention provides a place for each value/dimension to be placed within the representation.
  • the graphical representation may represent abstract or physical structures and may be represented in 2, 3 to n dimensional space.
  • the graphical representation may comprise a hierarchical layout 330 as shown in Figure 3.
  • the hierarchical layout 330 could include a series of nodes displayed as a connected graph.
  • Each node could represent an individual company or entity, for example 340A and 340B.
  • each node within the representation could be based on the sector 304, the location 306 or some other attribute of the company 302. Companies in the same sector
  • the hierarchical structure 330 enables separation of data and provides a place or location around which further data could be presented.
  • Figure 4 shows the hierarchical represenation 330 of figure 3 in more detail.
  • the central node 410 of the representation 330 represents all relevant data from the data warehouse before any dimensions have been applied to it. Dimensions are applied to the data in order to seperate out data of interest.
  • the inner circle of nodes 420A, 420B, 420C, 420D, 420E, and 420F represent the division of data after a first dimension has been applied to the data. For example, if the first dimension applied was "Sector" then node 420A may represent Consumer, node 420B may represent Healthcare, node 420C may represent
  • node 420D may represent Resources
  • node 420E may represent Media
  • 420F may represent Technology.
  • the second, third and fourth circles of nodes may represent the division of data which results from applying successive dimensions to the data.
  • the dimensions allow for the sorting and presentation of the data from the data warehouse.
  • the second circle of nodes could, for example, represent location.
  • the data at each node in the inner circle would then be divided again according to location.
  • the data included with node 420F could be further divided into nodes 430A, 430B, and 430C, where 430A represents Australia, 430B represents Canada, and 430C represents the United States.
  • a user may be especially interested in the children of a particular node, for example, 420F in figure 4 which represents the Technology sector. Or a node may have many children making it difficult to see the exact configuration for all such children and grandchildren, as is the case for node 430D in figure 4 for example.
  • a user may select a node of interest and the method, system or computer program of the invention may allow the user to view a new hierarchical representation with the selected node at the centre of the configuration and the children and grandchildren of that node arranged around it in a configuration similar to that of the parent graph.
  • the dimensions applied to the data could be applied in any order. This is the case in the example described above.
  • the dimension Sector is applied first and the dimension Location is applied next. It would be just as possible to apply the Location dimension first, followed by Sector.
  • the preference of the user in selecting the first dimension to apply will depend on the focus of the user's interest in the data. In a case such as this, the user may wish to view the data both ways. The user may, therefore, select a node in a first representation and dynamically change it's position in the hierarchy, by dragging it with a mouse for example, or by changing options on a menu or form. The invention may then redisplay the representation with the nodes arranged according to the newly specified hierarchy of dimensions.
  • the successive circles of nodes may have a logical relationship which makes most sense when presented in sequence.
  • the first inner circle could represent country
  • the second circle could represent state
  • the third city could represent city
  • the fourth suburb could represent the order of the successive layers of nodes.
  • the circular graph generated by one or more of the preferred forms of the invention could also form a spatial substrate on which to superimpose contoured data.
  • the nodes of the graph could be used as data points about which to contour supplementary data which may be, for example, one of various key performance indicators or KPIs retrieved from the data repository 170, for example, revenue, turnover, sales, gross profit, net profit, gross margin of return on inventory investment, net margin return on inventory investment, return on net assets and/or loyalty sales data.
  • contour supplementary data may be, for example, one of various key performance indicators or KPIs retrieved from the data repository 170, for example, revenue, turnover, sales, gross profit, net profit, gross margin of return on inventory investment, net margin return on inventory investment, return on net assets and/or loyalty sales data.
  • Figure 5 illustrates a graph of the same basic form as the representation illustrated in figure 4.
  • the data of interest relates to gaming machines located, for example, in casinos, bars and pubs on which players may bet by paying amounts made up of various denominations into one or more slots on the machine.
  • the first dimension which has been applied to the relevent data in this example is "Game Type".
  • the centermost node of data may then be divided into an inner circle of n nodes, for example 510, where n is the number of divisions which result from applying the first dimension.
  • the graph area may be divided accordingly into a series of n segments
  • the segments of the representation may be delineated along the circumference of the representation with dividers 510A and/or labels 51 OB.
  • contours for example 550 and 555.
  • the contours may represent a KPI such as percentage increase in hand pull over a chosen month for the particular machines identified by each node in the graph.
  • the display component could be further arranged to display a circular graph to a user such as that illustrated in Figure 6 at 600.
  • Each data value of interest could be displayed a certain distance from the centre point of the circle. The distance could be based on some measure of importance, for example, if the data value represented a company the measure of importance may be company size or average annual turnover. Important companies could be grouped nearer the centre of the circle, whereas less important companies could be placed at the periphery.
  • the circular graph could again be divided equally between the output values of a given dimension. For example, the graph could be divided into a series of segments according to the application of a dimension "Sector", each segment in the representation corresponding to a different industry sector in which each company operates.
  • sectors include Financial 610A, Resources 610B, Media 610C, Technology 610D, Consumer 610E, and Healthcare 610F sectors.
  • Each of these segments could be further divided into sub-segments representing industry sub-sectors.
  • the financial sector could be further divided into banks 620A, insurance 620B, and real estate 620C.
  • Nodes representing companies could be positioned within the circular graph, for example as shown at 650A and 650B. Each company representation could be placed in a segment of the circular graph based on the sector identifier of the company.
  • the circular graph shown at 600 provides two axes of similarity, namely sector and importance. Patterns are more likely to be meaningful to a user since companies that are close together in the display will be in similar sectors and be of similar importance to the market. It will be appreciated that the invention could display any dimension of data on any substrate. Figure 6 merely shows one example.
  • the invention has divided the circular representations of the data into n equal segments depending on the number of possible values which exist for the first dimension applied to the data.
  • the invention also encompasses the production of other representations of data which are variations on the basic system and method illustrated by the above examples. It will be appreciated that other configurations are possible and may be produced by the method, system and computer program of the present invention.
  • Figure 7 illustrates a configuration of data nodes 700 according to the invention wherein instead of dividing the representation into equal sized segments based on the number of nodes in the inner circle, the outermost nodes have been evenly spaced around the circumference of the representation.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un système de visualisation de données comprenant une mémoire de données dans laquelle un ou plusieurs ensembles de données de faits sont mis à jour, lesquels comprennent un identificateur et un ou plusieurs attributs et un ou plusieurs ensembles de données d'éléments finis, dans lesquels les membres de chaque ensemble de données d'éléments finis définissent la gamme de valeurs possibles pour au moins un attribut d'au moins un ensemble de données de faits; un composant de récupération disposé de manière à récupérer un ou plusieurs ensembles de données à partir de la mémoire; ainsi qu'un composant d'affichage disposé de manière à afficher une représentation graphique d'un sous-ensemble choisi de l'ensemble de tous les ensembles de données de faits dans la mémoire comme une série de valeurs de données. L'invention concerne également un procédé et un programme informatique relatifs.
PCT/NZ2002/000021 2001-02-26 2002-02-26 Système et procédé de visualisation de données WO2002069192A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
NZ510178 2001-02-26
NZ51017801 2001-02-26

Publications (1)

Publication Number Publication Date
WO2002069192A1 true WO2002069192A1 (fr) 2002-09-06

Family

ID=19928364

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/NZ2002/000021 WO2002069192A1 (fr) 2001-02-26 2002-02-26 Système et procédé de visualisation de données

Country Status (1)

Country Link
WO (1) WO2002069192A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7549309B2 (en) 2003-08-29 2009-06-23 Sap Ag Method and system for restructuring a visualization graph so that entities linked to a common node are replaced by the common node in response to a predetermined stimulus
US7617185B2 (en) 2003-08-29 2009-11-10 Sap Ag Methods and systems for providing a visualization graph
US7720857B2 (en) 2003-08-29 2010-05-18 Sap Ag Method and system for providing an invisible attractor in a predetermined sector, which attracts a subset of entities depending on an entity type
US7853552B2 (en) * 2003-08-29 2010-12-14 Sap Ag Method and system for increasing a repulsive force between a first node and surrounding nodes in proportion to a number of entities and adding nodes to a visualization graph
US8235811B2 (en) 2007-03-23 2012-08-07 Wms Gaming, Inc. Using player information in wagering game environments
CN103562905A (zh) * 2011-03-23 2014-02-05 新比斯安全卢森堡有限公司 改进的数据可视化配置系统及方法

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5619632A (en) * 1994-09-14 1997-04-08 Xerox Corporation Displaying node-link structure with region of greater spacings and peripheral branches
JPH11231997A (ja) * 1998-02-09 1999-08-27 Fujitsu Ltd アイコン表示方法、その装置、及び記録媒体
EP0950962A2 (fr) * 1998-04-17 1999-10-20 Xerox Corporation Méthodes pour visualiser des tranformations dans des séries apparentées de graphes
WO2000016307A1 (fr) * 1998-09-10 2000-03-23 Microsoft Corporation Procede et appareil de visualisation et d'exploration de grandes structures hierarchiques
US6104400A (en) * 1997-12-30 2000-08-15 International Business Machines Corporation Large tree structure visualization and display system
US6128617A (en) * 1997-11-24 2000-10-03 Lowry Software, Incorporated Data display software with actions and links integrated with information
WO2000073937A1 (fr) * 1999-05-27 2000-12-07 E-Estate.Net Pty Ltd Base de donnees et systeme de navigation
WO2002008954A1 (fr) * 2000-07-10 2002-01-31 Compudigm International Limited Systeme de suivi de l'activite des consommateurs et procede

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5619632A (en) * 1994-09-14 1997-04-08 Xerox Corporation Displaying node-link structure with region of greater spacings and peripheral branches
US6128617A (en) * 1997-11-24 2000-10-03 Lowry Software, Incorporated Data display software with actions and links integrated with information
US6104400A (en) * 1997-12-30 2000-08-15 International Business Machines Corporation Large tree structure visualization and display system
JPH11231997A (ja) * 1998-02-09 1999-08-27 Fujitsu Ltd アイコン表示方法、その装置、及び記録媒体
EP0950962A2 (fr) * 1998-04-17 1999-10-20 Xerox Corporation Méthodes pour visualiser des tranformations dans des séries apparentées de graphes
WO2000016307A1 (fr) * 1998-09-10 2000-03-23 Microsoft Corporation Procede et appareil de visualisation et d'exploration de grandes structures hierarchiques
WO2000073937A1 (fr) * 1999-05-27 2000-12-07 E-Estate.Net Pty Ltd Base de donnees et systeme de navigation
WO2002008954A1 (fr) * 2000-07-10 2002-01-31 Compudigm International Limited Systeme de suivi de l'activite des consommateurs et procede

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7549309B2 (en) 2003-08-29 2009-06-23 Sap Ag Method and system for restructuring a visualization graph so that entities linked to a common node are replaced by the common node in response to a predetermined stimulus
US7617185B2 (en) 2003-08-29 2009-11-10 Sap Ag Methods and systems for providing a visualization graph
US7720857B2 (en) 2003-08-29 2010-05-18 Sap Ag Method and system for providing an invisible attractor in a predetermined sector, which attracts a subset of entities depending on an entity type
US7853552B2 (en) * 2003-08-29 2010-12-14 Sap Ag Method and system for increasing a repulsive force between a first node and surrounding nodes in proportion to a number of entities and adding nodes to a visualization graph
US8235811B2 (en) 2007-03-23 2012-08-07 Wms Gaming, Inc. Using player information in wagering game environments
US9619969B2 (en) 2007-03-23 2017-04-11 Bally Gaming, Inc. Using player information in wagering game environments
CN103562905A (zh) * 2011-03-23 2014-02-05 新比斯安全卢森堡有限公司 改进的数据可视化配置系统及方法

Similar Documents

Publication Publication Date Title
Ko et al. A survey on visual analysis approaches for financial data
US6995768B2 (en) Interactive business data visualization system
US8200618B2 (en) System and method for analyzing data in a report
US7158968B2 (en) Database query system and method
US9563338B2 (en) Data visualization interface
US8700450B2 (en) Customer relationship management system and method
Abelló et al. YAM/sup 2/(yet another multidimensional model): an extension of UML
US7080090B2 (en) Allocation measures and metric calculations in star schema multi-dimensional data warehouse
US9075859B2 (en) Parameterized database drill-through
US20020129017A1 (en) Hierarchical characterization of fields from multiple tables with one-to-many relations for comprehensive data mining
JP2009508210A (ja) 多次元データベースを自動的に表示するためのコンピュータシステムおよび方法
JP4121566B2 (ja) データベースからのデータ抽出方法
WO2002073532A1 (fr) Caracterisation hierarchique de champs de tables multiples selon des rapports un a plusieurs pour l'exploration de donnees globale
US20120013619A1 (en) System and method for visualizing multi-dimensional data using shape attributes
US20030103070A1 (en) Interactive display with improved visualization for product comparison, selection, and methods of operation
US20230004584A1 (en) Using Objects in an Object Model as Database Entities
Orlovskyi et al. A business intelligence dashboard design approach to improve data analytics and decision making
WO2002082209A2 (fr) Procede et systeme d'analyse d'aide a la decision
WO2002069192A1 (fr) Système et procédé de visualisation de données
US20050052474A1 (en) Data visualisation system and method
US6631380B1 (en) Counting and displaying occurrences of data records
US20220107944A1 (en) Analyzing data using data fields from multiple objects in an object model
Rao et al. A novel approach for Iceberg Query evaluation on multiple attributes using set representation
AU2020102300A4 (en) IAIP- Interactive Business Data: INTERACTIVE INTELLIGENT BUSINESS DATA VISUALIZATION USING AI- BASED PROGRAMMING
US11232120B1 (en) Schema viewer searching for a data analytics platform

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 EC 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 OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM 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 ZM 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 GQ 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)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

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

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP