WO2004077331A2 - Method and apparatus for visualization of data - Google Patents

Method and apparatus for visualization of data Download PDF

Info

Publication number
WO2004077331A2
WO2004077331A2 PCT/SE2003/002062 SE0302062W WO2004077331A2 WO 2004077331 A2 WO2004077331 A2 WO 2004077331A2 SE 0302062 W SE0302062 W SE 0302062W WO 2004077331 A2 WO2004077331 A2 WO 2004077331A2
Authority
WO
WIPO (PCT)
Prior art keywords
computer
data
monitor
tree
elements
Prior art date
Application number
PCT/SE2003/002062
Other languages
French (fr)
Inventor
Willem De Geer
Sam Giertz
Ludvig Karlsson
Original Assignee
Panopticon Software Ab
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 Panopticon Software Ab filed Critical Panopticon Software Ab
Priority to AU2003291602A priority Critical patent/AU2003291602A1/en
Publication of WO2004077331A2 publication Critical patent/WO2004077331A2/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/06Asset management; Financial planning or analysis

Definitions

  • the present invention concerns a method and an arrangement for the visualisation of data by the use of what is known as "tree-mapping".
  • Tree-mapping is a known technique in which a structured tree is used to organise data and in which data are visually presented through a type of map consisting of, for example, a number of rectangles and squares that together fill the area within an outer frame.
  • each element that is, of each rectangle or square
  • a second parameter is represented by, for example, the colour of each rectangle or square.
  • each rectangle or square represents the stock exchange value of the relevant listed company
  • the colour of the relevant rectangle or square represents the change in share price from, for example, the preceding trading day.
  • the rectangles and the squares can represent, instead of the stock exchange value, the fraction of the share of the total trading volume on the preceding trading day.
  • the rectangles and squares together completely fill the said frame, which is normally a rectangle. This means that the companies that are represented in the map, for example the 30 most frequently traded companies, fill 100% of the area of the frame.
  • the various rectangles and squares are thus given proportions relative to each other.
  • This type of tree-mapping provides an image of the stock exchange over which it is very easy to gain an overview, and which is very easy to understand.
  • the tree-mapping is based on a structured tree.
  • the root has, for example, three offspring.
  • One offspring in the example above may represent, for example, the pharmaceuticals sector, one offspring may represent manufacturing industry, and one offspring may represent the telecommunications industry.
  • Each one of the three offspring has, for example, three offspring.
  • the offspring of the telecommunications industry may be telephone companies, system suppliers and telephone suppliers.
  • Each of these nodes can, in turn, have three offspring.
  • the node of telephone companies can have for its offspring Telia, Tele2 and Vodaphone, which are listed on the Swedish stock exchange.
  • the value of the contents of an inner node is the sum of the values of its offspring, i.e. in the example: the value of the telecommunications sector, the value of the telephone companies, and the individual values of the listed companies Telia, Tele2 and Vodaphone.
  • the structure of the tree may, of course, be freely chosen.
  • the different values can be retrieved from the same database,
  • the tree-mapping is often carried out at different levels.
  • a highest level may be that a map of only the nodes at level 1 is displayed within the said frame.
  • the offspring of the node can fill the complete frame. It is in this way possible to zoom in down to the lowest level.
  • the present invention offers a more efficient method for visualising data than the conventional method in which data for the mapping at different levels come from the same database, and it offers an arrangement for carrying out the method.
  • the present invention thus relates to a method and an arrangement for the creation of a visualisation of data through what is known as "tree-mapping" displayed on a monitor with the aid of a computer, where tree-mapping is a known technique in which a structured tree is used to organise data, in which data are visually presented through a map consisting of geometric elements, such as a number of rectangles and squares, which geometric elements correspond to offspring of the root of the tree and which together represent the highest level of the tree and which together completely or partially fill an outer frame, and in which the size of each element, i.e.
  • each rectangle or square corresponds to the value of one parameter of the data that are stored in the nodes of the tree, and in which a second parameter is represented by, for example, the colour of each rectangle or square, and in which one or several of the said elements can be subdivided into smaller elements, corresponding to a branching of the tree, where the smaller elements represent a lower level, and where the smaller elements together wholly or partially fill the area of the level that lies immediately above and where the said smaller elements in a corresponding manner can be further subdivided into further smaller elements, corresponding to a further branching, which further smaller elements represent a further lower level, etc., and where a computer connected to a first database is caused to control a monitor such that a map is formed of the said elements, and is characterised in that data that are to constitute the said elements are located in one or several databases, in that each type of parameter in these corresponds to a magnitude, such as a value, number, fraction of a whole, etc., in that each magnitude is assigned a property of an
  • FIG. 1 illustrates a first map produced by what is known as “tree-mapping"
  • Each element A - M represents a node, the area of which, i.e. the size of each rectangle or square, corresponds to the value of a parameter in the data that are stored in the node, and where a second parameter is represented by, for example, the colour of each rectangle or square.
  • One or several of the said elements A - C can be subdivided into smaller elements D - F; G - H; I - M; where the smaller elements represent a lower level, and where the smaller elements together fill completely the area A - C of the level immediately above them, and where the said smaller elements can be subdivided in an equivalent manner into further smaller elements, corresponding to a branching of the tree, which further smaller elements represent a further lower level, etc.
  • the figures can as an example be considered to represent a stock exchange X, such as the Swedish stock exchange.
  • the area of the outer rectangle in Figure 1 thus represents the complete stock exchange value for three sectors A, B and C, for which the telecommunications industry, the pharmaceuticals sector and manufacturing industry have been taken as examples above.
  • the area A relative to the outer rectangle thus corresponds to the value of the telecommunications industry relative to the remainder.
  • the element A can be subdivided into smaller elements D, E and F corresponding to the values for different companies such as Ericsson (D) , Nokia (E) and Telia (F) , all of which are companies listed on the Swedish stock exchange.
  • the elements B and C can, in a corresponding manner, be subdivided into smaller elements at a lower level.
  • a computer 1 is available, connected to a database 2, which computer is caused to control a monitor 3 such that a map is formed of the said elements.
  • data that are to constitute the said elements D - M are caused to be sorted in a database 2, see Figure 6, according to one or several types of parameter, where each type of parameter corresponds to a magnitude, such as value, number, fraction of a whole, etc., that is displayed in the map.
  • Each magnitude is assigned a property of an element, such as area, colour, rasterisation, pattern of dots, etc.
  • one parameter is the size of the element, representing the stock exchange value of various included sectors and companies.
  • a second parameter may be the colour of a particular element, not shown, where the colour specifies an increase or decrease of the said value from the previous trading day.
  • the said computer 1 is further caused to be connected to two or several different databases 2, 4, 5, each containing different types of information.
  • the computer is connected to the databases 2, 4, 5 through a server 6 or similar.
  • the computer 1, on the other hand, may contain all necessary software.
  • a highly significant property of the invention is that when an element D - M present on the said monitor 3, representing parameters from a database 2, 4, 5, is marked, the computer 1 is caused to retrieve information from another database 2, 4, 5 that the one to which it is connected, and which represents parameters with data associated with the marked area D - M.
  • a map is shown in Figure 2 of various sectors and companies, as has been described above.
  • An additional line 7 of buttons is also shown in Figure 2 for giving commands.
  • the line of buttons illustrates only one manner in which commands can be given. It is appropriate that lines of buttons or menus are designed according to any one of the manners used for the Windows program of the Microsoft company. The present invention is not limited to any one specific manner.
  • An operator i.e. for example, a fund manager, sees the map in Figure 2. The operator then wants to see, for example, who his or her major customers within the telecommunications sector D are.
  • the operator wants to see a map of the companies within the telecommunications sector, a map of the greatest increase in share price within the companies in the telecommunications sector, the major owners of one or several companies within the telecommunications sector, expected profit for a particular company, etc. It is obvious that there are several alternatives that may arise and it is also clear that information about the various alternatives is stored in different databases.
  • the operator wants to continue by marking, according to the invention, that element in which he or she is interested and selecting the command that relates to the further information that the operator wants, for example, information about the major owners among the clients of the operator of Ericsson D, Nokia E and Telia F.
  • the operator in this case marks the element D. Furthermore the operator clicks on the button named "CLIENTS", as shown in Figure 3. Thereafter the computer 1 retrieves via the server 6 data from, for example, a customer list of a bank that also contains information about the holdings of the customers in different companies. These data are stored in the databases 8, 9, which are part of the database 5 and which are present at the bank in question.
  • the operator can subsequently click on the button "CHANGE” in order in this way to colour the map, such that it is clear from a blue colour ("BLUE”) which companies have experienced an increasing share price and it is clear from a red colour (“RED”) which share prices have fallen.
  • BLUE blue colour
  • RED red colour
  • the operator can subsequently select clients 1 and 2 by clicking on the elements of these clients.
  • the computer 1, 6 is caused to structure the information from a database 2, 4, 5 to which it is connected such that different parts of the information in this are bound to different parameters that, when a map is produced, can be displayed on the said monitor.
  • a computer program is available, preferably in the said server ⁇ , which program is arranged to retrieve from a connected database information that is stored there in a certain manner, and to bind the retrieved data to a parameter for the said map, such that when the computer 1 is commanded to retrieve data with respect to a certain parameter, such as the holdings of the major clients, information about the major clients is retrieved by the server from a customer list in a database, which information is bound to the parameter in the computer 1 that relates to the surface area of the elements in the map.
  • the computer 1 is caused to control the said monitor 3 such that the type of information that a particular element displays is specified on the monitor.
  • the computer 1 is caused to display on the said monitor 3 menus or equivalent showing different selections, which selections can lead to the computer being caused to retrieve data from another database than the one from which the computer most recently retrieved data.
  • a clothing retail chain for example, can display by a map the sales and profit levels of different product groups.
  • a certain product in a product group can be selected and the magnitudes of the different suppliers of this product can be displayed on a map, as can the expected profit when the different suppliers are used. This means that several completely different databases must be available to the system that produces the maps.
  • the relative location of an element in a strict order, rather than its surface area, can be one parameter, and the relevant colour, for example, can be a second parameter.
  • the elements displayed may also be arranged such that the elements displayed do not completely fill the outer frame, but there are present unused areas outside of, and possibly between, the elements displayed, which areas can, for example, form a background for the elements displayed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Processing Or Creating Images (AREA)

Description

Method and Arrangement for the Visualisation of Data
The present invention concerns a method and an arrangement for the visualisation of data by the use of what is known as "tree-mapping".
Tree-mapping is a known technique in which a structured tree is used to organise data and in which data are visually presented through a type of map consisting of, for example, a number of rectangles and squares that together fill the area within an outer frame.
The size of each element, that is, of each rectangle or square, corresponds to one parameter of the data that are stored in the tree, and a second parameter is represented by, for example, the colour of each rectangle or square. The elements, i.e. the rectangles and squares, normally completely fill the said frame.
One example of the use of what is known as "tree-mapping" is to make visible the size and the share price for companies on a stock exchange. In this case the surface area of each rectangle or square represents the stock exchange value of the relevant listed company, and the colour of the relevant rectangle or square represents the change in share price from, for example, the preceding trading day. The rectangles and the squares can represent, instead of the stock exchange value, the fraction of the share of the total trading volume on the preceding trading day. The rectangles and squares together completely fill the said frame, which is normally a rectangle. This means that the companies that are represented in the map, for example the 30 most frequently traded companies, fill 100% of the area of the frame. The various rectangles and squares are thus given proportions relative to each other. This type of tree-mapping provides an image of the stock exchange over which it is very easy to gain an overview, and which is very easy to understand.
The tree-mapping is based on a structured tree. The root has, for example, three offspring. One offspring in the example above may represent, for example, the pharmaceuticals sector, one offspring may represent manufacturing industry, and one offspring may represent the telecommunications industry. Each one of the three offspring has, for example, three offspring. For example, the offspring of the telecommunications industry may be telephone companies, system suppliers and telephone suppliers. Each of these nodes can, in turn, have three offspring. As an example, the node of telephone companies can have for its offspring Telia, Tele2 and Vodaphone, which are listed on the Stockholm stock exchange.
If the colour of a particular element corresponds to the change in share price since the previous trading day, such changes are to be calculated for each leaf and for its ancestors. The changes are then to be inserted into the relevant element.
The value of the contents of an inner node is the sum of the values of its offspring, i.e. in the example: the value of the telecommunications sector, the value of the telephone companies, and the individual values of the listed companies Telia, Tele2 and Vodaphone.
The structure of the tree may, of course, be freely chosen.
The different values can be retrieved from the same database, The tree-mapping is often carried out at different levels. A highest level may be that a map of only the nodes at level 1 is displayed within the said frame. By marking a node by, for example, clicking on a computer monitor, the offspring of the node can fill the complete frame. It is in this way possible to zoom in down to the lowest level.
The present invention offers a more efficient method for visualising data than the conventional method in which data for the mapping at different levels come from the same database, and it offers an arrangement for carrying out the method.
The present invention thus relates to a method and an arrangement for the creation of a visualisation of data through what is known as "tree-mapping" displayed on a monitor with the aid of a computer, where tree-mapping is a known technique in which a structured tree is used to organise data, in which data are visually presented through a map consisting of geometric elements, such as a number of rectangles and squares, which geometric elements correspond to offspring of the root of the tree and which together represent the highest level of the tree and which together completely or partially fill an outer frame, and in which the size of each element, i.e. the size of each rectangle or square, corresponds to the value of one parameter of the data that are stored in the nodes of the tree, and in which a second parameter is represented by, for example, the colour of each rectangle or square, and in which one or several of the said elements can be subdivided into smaller elements, corresponding to a branching of the tree, where the smaller elements represent a lower level, and where the smaller elements together wholly or partially fill the area of the level that lies immediately above and where the said smaller elements in a corresponding manner can be further subdivided into further smaller elements, corresponding to a further branching, which further smaller elements represent a further lower level, etc., and where a computer connected to a first database is caused to control a monitor such that a map is formed of the said elements, and is characterised in that data that are to constitute the said elements are located in one or several databases, in that each type of parameter in these corresponds to a magnitude, such as a value, number, fraction of a whole, etc., in that each magnitude is assigned a property of an element, such as area, colour, rasterisation, pattern of dots, etc., in that the said computer is caused to be connectable to two or several different databases each containing different types of information and in that when an element present on the said monitor, represented parameters from a database, is marked, the computer is caused to retrieve information from another database that represents parameters with data associated with the marked element, and in that the computer is caused to form a new map within the marked element representing parameters from the latter database.
The invention is described in more detail below, partially in association with an embodiment of the invention shown in the attached drawings, in which:
- Figure 1 illustrates a first map produced by what is known as "tree-mapping",
- Figure 2 shows the same map as that shown in Figure 1 with an additional line of buttons for commands,
- Figure 3 shows a second map, - Figure 4 shows a third map,
- Figure 5 shows a fourth map, and
- Figure 6 shows a block diagram.
The elements A, B and C in Figure 1 illustrate branches from the root of the tree, which elements together represent the highest level of the tree and which together fill completely the outer frame. Each element A - M represents a node, the area of which, i.e. the size of each rectangle or square, corresponds to the value of a parameter in the data that are stored in the node, and where a second parameter is represented by, for example, the colour of each rectangle or square.
One or several of the said elements A - C can be subdivided into smaller elements D - F; G - H; I - M; where the smaller elements represent a lower level, and where the smaller elements together fill completely the area A - C of the level immediately above them, and where the said smaller elements can be subdivided in an equivalent manner into further smaller elements, corresponding to a branching of the tree, which further smaller elements represent a further lower level, etc.
The figures can as an example be considered to represent a stock exchange X, such as the Stockholm stock exchange. The area of the outer rectangle in Figure 1 thus represents the complete stock exchange value for three sectors A, B and C, for which the telecommunications industry, the pharmaceuticals sector and manufacturing industry have been taken as examples above. The area A relative to the outer rectangle thus corresponds to the value of the telecommunications industry relative to the remainder. As Figure 1 makes clear, the element A can be subdivided into smaller elements D, E and F corresponding to the values for different companies such as Ericsson (D) , Nokia (E) and Telia (F) , all of which are companies listed on the Stockholm stock exchange. The elements B and C can, in a corresponding manner, be subdivided into smaller elements at a lower level.
What has been described above in association with Figure 1 is actually the prior art. In a patent application filed at the same time as the current application, the said technique is described in more detail, together with an invention that is advantageously applied with the present invention. For this reason, the said patent application is incorporated into the description given in the present invention.
In order to carry out the invention, a computer 1 is available, connected to a database 2, which computer is caused to control a monitor 3 such that a map is formed of the said elements.
According to the invention, data that are to constitute the said elements D - M are caused to be sorted in a database 2, see Figure 6, according to one or several types of parameter, where each type of parameter corresponds to a magnitude, such as value, number, fraction of a whole, etc., that is displayed in the map. Each magnitude is assigned a property of an element, such as area, colour, rasterisation, pattern of dots, etc.
In the map shown in Figure 1, one parameter is the size of the element, representing the stock exchange value of various included sectors and companies. A second parameter may be the colour of a particular element, not shown, where the colour specifies an increase or decrease of the said value from the previous trading day.
According to the invention, the said computer 1 is further caused to be connected to two or several different databases 2, 4, 5, each containing different types of information.
It is preferred that the computer is connected to the databases 2, 4, 5 through a server 6 or similar. The computer 1, on the other hand, may contain all necessary software.
A highly significant property of the invention is that when an element D - M present on the said monitor 3, representing parameters from a database 2, 4, 5, is marked, the computer 1 is caused to retrieve information from another database 2, 4, 5 that the one to which it is connected, and which represents parameters with data associated with the marked area D - M.
In this way, the computer is caused to form within the marked element a new map representing parameters from the latter database. This is illustrated in Figure 2 and Figure 3.
A map is shown in Figure 2 of various sectors and companies, as has been described above. An additional line 7 of buttons is also shown in Figure 2 for giving commands. The line of buttons illustrates only one manner in which commands can be given. It is appropriate that lines of buttons or menus are designed according to any one of the manners used for the Windows program of the Microsoft company. The present invention is not limited to any one specific manner. An operator, i.e. for example, a fund manager, sees the map in Figure 2. The operator then wants to see, for example, who his or her major customers within the telecommunications sector D are. Alternatively, the operator wants to see a map of the companies within the telecommunications sector, a map of the greatest increase in share price within the companies in the telecommunications sector, the major owners of one or several companies within the telecommunications sector, expected profit for a particular company, etc. It is obvious that there are several alternatives that may arise and it is also clear that information about the various alternatives is stored in different databases.
Assume that the operator wants to see a more detailed map of the companies within the telecommunications sector. The operator in this case marks the sector A in Figure 2 by, for example, double clicking with the computer mouse on the element A. This results in the map shown in Figure 3 being formed. Data are retrieved from the same database as that containing the data used in Figure 2.
The operator wants to continue by marking, according to the invention, that element in which he or she is interested and selecting the command that relates to the further information that the operator wants, for example, information about the major owners among the clients of the operator of Ericsson D, Nokia E and Telia F.
The operator in this case marks the element D. Furthermore the operator clicks on the button named "CLIENTS", as shown in Figure 3. Thereafter the computer 1 retrieves via the server 6 data from, for example, a customer list of a bank that also contains information about the holdings of the customers in different companies. These data are stored in the databases 8, 9, which are part of the database 5 and which are present at the bank in question.
The map shown in Figure 4 is in this way formed, showing the holdings of the major clients 1, 2, 3, 4 and 5. It is clear from Figure 4 that the clients 1 and 2 hold shares in the companies D and E, i.e. in Ericsson and Nokia.
The operator can subsequently click on the button "CHANGE" in order in this way to colour the map, such that it is clear from a blue colour ("BLUE") which companies have experienced an increasing share price and it is clear from a red colour ("RED") which share prices have fallen. This can, for example, be marked for clients 1 and 2 though the operator clicking on the relevant element.
The operator can subsequently select clients 1 and 2 by clicking on the elements of these clients. The map in Figure 5, which shows the holdings of clients 1 and 2 in Ericsson and Nokia, is in this manner formed.
The operator can in this manner click on "PROFIT/LOSS" in order to indicate whether the client has gained or lost on his or her holding compared to the acquisition price. This is marked in the selected element with a "+" symbol or a "-" symbol. As Figure 5 makes clear, client 1 has lost on the holding in Ericsson, although the share price of Ericsson is rising, while the client has gained on the, holding in Nokia, which, however, has a falling share price. The description given above is only one example of how data can be used in order to produce all manner of maps by the use of different databases in combination.
According to one highly preferred embodiment, the computer 1, 6 is caused to structure the information from a database 2, 4, 5 to which it is connected such that different parts of the information in this are bound to different parameters that, when a map is produced, can be displayed on the said monitor. This means that a computer program is available, preferably in the said server β, which program is arranged to retrieve from a connected database information that is stored there in a certain manner, and to bind the retrieved data to a parameter for the said map, such that when the computer 1 is commanded to retrieve data with respect to a certain parameter, such as the holdings of the major clients, information about the major clients is retrieved by the server from a customer list in a database, which information is bound to the parameter in the computer 1 that relates to the surface area of the elements in the map.
According to one preferred embodiment, the computer 1 is caused to control the said monitor 3 such that the type of information that a particular element displays is specified on the monitor.
According to one preferred design, the computer 1 is caused to display on the said monitor 3 menus or equivalent showing different selections, which selections can lead to the computer being caused to retrieve data from another database than the one from which the computer most recently retrieved data. An example related to the trading of securities has been described above.
It is, however, clear that the present invention can be used in any type of area of application. A clothing retail chain, for example, can display by a map the sales and profit levels of different product groups. A certain product in a product group can be selected and the magnitudes of the different suppliers of this product can be displayed on a map, as can the expected profit when the different suppliers are used. This means that several completely different databases must be available to the system that produces the maps.
Furthermore, the relative location of an element in a strict order, rather than its surface area, can be one parameter, and the relevant colour, for example, can be a second parameter.
It may also be arranged such that the elements displayed do not completely fill the outer frame, but there are present unused areas outside of, and possibly between, the elements displayed, which areas can, for example, form a background for the elements displayed.
It is clear that the present invention offers opportunities for using what is known as "tree-mapping" in a significantly more efficient manner and with totally new possibilities than those offered by conventional tree-mapping.
The present invention, therefore, is not to be considered to be limited to the embodiments described above. Rather, it can be varied within the framework of the attached claims.

Claims

Claims
1. A method for the creation of a visualisation of data through what is known as "tree-mapping" displayed on a monitor with the aid of a computer where tree-mapping is a known technique in which a structured tree is used to organise data, where the data are visually presented through a map consisting of geometrical figures such as, for example, a number of rectangles and squares (A, B, C) , which geometric figures correspond to offspring of the root of the tree and which together wholly or partially fill an outer frame (X) and where the area of each element, i.e. the size of each rectangle or square, can correspond to the value of one parameter in the data that are stored in the tree, and where a second parameter is represented by, for example, the colour of each rectangle or square, and where one or several of the said elements can be subdivided into smaller elements, corresponding to a branching of the tree, where the smaller elements (D - M) represent a lower level and where the smaller elements together wholly or partially fill the area
(A, B, C) of the level that lies immediately above them and where the said smaller elements in an equivalent manner can be further subdivided into further smaller elements, corresponding to a further branching, which further smaller elements represent a further lower level, etc., and in which a computer (1) connected to a first database (2) is caused to control a monitor (3) such that a map of the said elements is formed, c h a r a c t e r i s e d in that data that are to constitute the said elements are present in one or several databases, in that each type of parameter in these corresponds to a magnitude, such as value, number, fraction of a whole, etc., in that each magnitude is assigned one property of an element (A - M) such as area, colour, rasterisation, pattern of dots, relative location, etc., in that the said computer (1) is caused to be connectable to two or more different databases (2, 4, 5) each containing different types of information and in that when an element (A - M) present on the said monitor (3) , representing parameters from a database, is marked, the computer (1) is caused to retrieve information from another database that represents parameters with data associated with the marked element (A - M) and in that the computer (1) is caused to form within the marked element a new map representing parameters from the latter database.
2. The method according to claim 1, c h a r a c t e r i s e d in that the computer (1) is caused to retrieve data from another database on marking an element (A - M) and to form a map.
3. The method according to claim 1 or 2, c h a r a c t e r i s e d in that the computer (1) is caused to control the said monitor (3) such that the type of information that a certain element (A - M) displays is specified on the monitor.
4. The method according to claim 1, 2 or 3, c h a r a c t e r i s e d in that the computer (1) is caused to organise data from a database (2, 4, 5) to which it is connected such that different parts of the information are bound to different parameters which, when a map has been formed, can be displayed on the said monitor (3) .
5. The method according to claim 1, 2, 3 or 4, c h a r a c t e r i s e d in that the computer (1) is caused to display on the said monitor (3) different menus (7) or equivalent showing different selections, which selections can result in that the computer (1) is caused to retrieve data from another database than that from which the computer most recently retrieved data.
6. An arrangement for the creation of a visualisation of data through what is known as "tree-mapping" displayed on a monitor with the aid of a computer where tree-mapping is a known technique in which a structured tree is used to organise data, where the data are visually presented through a map consisting of geometrical figures such as, for example, a number of rectangles and squares (A, B, C) , which geometric figures correspond to offspring of the root of the tree and which together wholly or partially fill an outer frame (X) and where the area of each element, i.e. the size of each rectangle or square, can correspond to the value of one parameter in the data that are stored in the tree, and where a second parameter is represented by, for example, the colour of each rectangle or square, and where one or several of the said elements can be subdivided into smaller elements, corresponding to a branching of the tree, where the smaller elements (D - M) represent a lower level and where the smaller elements together wholly or partially fill the area (A, B, C) of the level that lies immediately above them and where the said smaller elements in an equivalent manner can be further subdivided into further smaller elements, corresponding to a further branching, which further smaller elements represent a further lower level, etc., and in which a computer (1) connected to a first database (2) is caused to control a monitor (3) such that a map of the said elements is formed, c h a r a c t e r i s e d in that data that are to constitute the said elements are stored in one or several databases, in that each type of parameter in these corresponds to a magnitude, such as value, number, fraction of a whole, etc., in that each magnitude is assigned one property of an element (A - M) such as area, colour, rasterisation, pattern of dots, relative location, etc., in that the said computer (1) is arranged such that it can be connected to two or more different databases (2, 4, 5) each containing different types of information and in that when an element (A - M) present on the said monitor (3), representing parameters from a database, is marked, the computer (1) is arranged to retrieve information from another database that represents parameters with data associated with the marked element (A - M) and in that the computer (1) is arranged to form within the marked element a new map representing parameters from the latter database.
7. The arrangement according to claim 6, c h a r a c t e r i s e d in that the computer (1) is arranged to retrieve data from another database on marking an element (A - M) and to form a map.
8. The arrangement according to claim 6 or 7, c h a r a c t e r i s e d in that the computer (1) is arranged to control the said monitor (3) such that the type of information that a certain element (A - M) displays is specified on the monitor.
9. The arrangement according to claim 6, 7 or 8, c h a r a c t e r i s e d in that the computer (1) is arranged to organise data from a database (2, 4, 5) to which it is connected such that different parts of the information are bound to different parameters which, when a map has been formed, can be displayed on the said monitor (3) .
10. The arrangement according to claim 6, 7, 8 or 9, c h a r a c t e r i s e d in that the computer (1) is arranged to display on the said monitor (3) different menus (7) or equivalent showing different selections, which selections can result in that the computer (1) is caused to retrieve data from another database than that from which the computer most recently retrieved data.
PCT/SE2003/002062 2002-12-20 2003-12-22 Method and apparatus for visualization of data WO2004077331A2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2003291602A AU2003291602A1 (en) 2002-12-20 2003-12-22 Method and apparatus for visualization of data

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE0203810-7 2002-12-20
SE0203810A SE0203810D0 (en) 2002-12-20 2002-12-20 Procedure for visualization of data

Publications (1)

Publication Number Publication Date
WO2004077331A2 true WO2004077331A2 (en) 2004-09-10

Family

ID=20289960

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2003/002062 WO2004077331A2 (en) 2002-12-20 2003-12-22 Method and apparatus for visualization of data

Country Status (3)

Country Link
AU (1) AU2003291602A1 (en)
SE (1) SE0203810D0 (en)
WO (1) WO2004077331A2 (en)

Also Published As

Publication number Publication date
SE0203810D0 (en) 2002-12-20
AU2003291602A1 (en) 2004-09-17

Similar Documents

Publication Publication Date Title
US7212999B2 (en) User interface for an electronic trading system
US20180357717A1 (en) System and Method for Displaying Market Information and Order Placement in an Electronic Trading Environment
US6064984A (en) Graphical user interface for a computer-implemented financial planning tool
US6993504B1 (en) User interface for semi-fungible trading
JP4927819B2 (en) Share map display device, share map display system, program
US6973432B1 (en) Real estate coordination program
US20020013720A1 (en) Business position display system and computer-readable medium
US8482563B2 (en) Equities information and visualization system that processes orders as information is received via data feed in real-time
US20090299877A1 (en) User interface for displaying purchase concentration data for unique items based on consumer-specified constraints
US20200126159A1 (en) Virtual over-the-counter financial product exchange system
US20030229526A1 (en) Computer-implemented system and method for assessing supply chain solutions
US7813994B1 (en) System and method for displaying highest and lowest traded prices of tradable objects
WO2001016852A2 (en) User interface for semi-fungible trading
EP1856662A2 (en) Electronic trading system
CN101069207A (en) Process for providing timely quality indication of market trades
US20020087451A1 (en) Security inquiry management techniques
US20050278198A1 (en) Methods and systems for managing a portfolio of insurance products
US8036977B1 (en) Method and interface for historical display of market information
CA2640068A1 (en) System and method configured for facilitating financial analysis
AU2006338310A1 (en) Method configured for facilitating financial consulting services
WO2004077331A2 (en) Method and apparatus for visualization of data
US20070073757A1 (en) Method and arrangement for the visualisation of data
US8878853B2 (en) Visualization of a collection of orders
US20030154148A1 (en) Launching via dynaquote
WO2001037124A2 (en) Real estate coordination program

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG 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 NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK 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
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase in:

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP