US20020029221A1 - Method and apparatus for navigating and displaying data points stored in a multidimensional database - Google Patents

Method and apparatus for navigating and displaying data points stored in a multidimensional database Download PDF

Info

Publication number
US20020029221A1
US20020029221A1 US09/819,059 US81905900A US2002029221A1 US 20020029221 A1 US20020029221 A1 US 20020029221A1 US 81905900 A US81905900 A US 81905900A US 2002029221 A1 US2002029221 A1 US 2002029221A1
Authority
US
United States
Prior art keywords
data point
child
displaying
data
data points
Prior art date
Legal status (The legal status 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 status listed.)
Abandoned
Application number
US09/819,059
Inventor
Robert C. Lokken
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Microsoft Technology Licensing LLC
Original Assignee
Robert C. Lokken
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 Robert C. Lokken filed Critical Robert C. Lokken
Priority to US09/819,059 priority Critical patent/US20020029221A1/en
Publication of US20020029221A1 publication Critical patent/US20020029221A1/en
Assigned to MICROSOFT TECHNOLOGY LICENSING, LLC reassignment MICROSOFT TECHNOLOGY LICENSING, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: MICROSOFT CORPORATION
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/283Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/242Query formulation
    • G06F16/2425Iterative querying; Query formulation based on the results of a preceding query
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/242Query formulation
    • G06F16/2428Query predicate definition using graphical user interfaces, including menus and forms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/26Visual data mining; Browsing structured data
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/953Organization of data
    • Y10S707/957Multidimensional
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/964Database arrangement
    • Y10S707/966Distributed
    • Y10S707/967Peer-to-peer
    • Y10S707/968Partitioning
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99931Database or file accessing
    • Y10S707/99933Query processing, i.e. searching

Definitions

  • the present invention relates generally to a method and apparatus for visually displaying data, and more specifically, to a method and apparatus for navigating and displaying data points stored in a multidimensional database.
  • the data in a multidimensional information system can be defined (or arranged) along multiple dimensions.
  • the data in a sales management system may include time, location, customer, and product dimensions.
  • a dimension may include many members. The members in one dimension can be organized as a hierarchical tree with multiple levels.
  • FIG. 1 shows an exemplary dimension tree for the data along a product dimension; in which “All Products” is a member; “Furniture” is a member; “Electronics” is a member; “Beds” is a member; and so on.
  • the upward connections are called parent connections, and the downward connections are called child connections.
  • “All Products” is the first level member in the dimension tree; “Furniture” and “Electronics” are the second level members in the dimension tree; “Desks”, “Chairs”, “Beds”, “Home Appliance”, and “Office Equipment” are the third level members in the dimension tree; and so on.
  • “Furniture” is the parent of “Desks”, “Chairs”, and “Beds”; “Furniture” and “Electronics” are children of “All Products”; and so on.
  • a member without a parent is called root member.
  • “All Products” is a root member.
  • a data point (or cell) is defined as the intersection of one member from each dimension.
  • the N dimensions form a cube, which contains all data points in the database system.
  • the more dimensions and levels per dimension the more complex is the neighboring data points surrounding a given data point.
  • each data point in the database has 2N immediate neighboring data points or navigation directions.
  • the existing data navigation and display tools does not provide the flexibility in navigating data points along multiple dimensions.
  • the navigation paths are limited by the hierarchical structure of the multidimensional database.
  • a user may not be able to navigate through a multidimensional database in a sequence of paths that fits the user's thought process.
  • the existing data navigation and display tool displays the data points separately on a computer screen. Thus, it does not present a comprehensive view for the data points that are being navigated.
  • the existing data navigation and display tool processes multidimensional data points within a single dimensional hierarchy.
  • a user has to perform a so called “pivotal” process to bring a new dimension into focus. In doing so, the user may lose the navigation paths previously performed, thus losing the context and importance of the piece of data that is being currently displayed on the computer screen. Also, such a “pivotal” process is relatively complicated and not easy for an average user to grasp.
  • the present invention provides such a method and apparatus to meet these three needs.
  • the present invention provides a novel method for displaying data points stored in a multidimensional database.
  • the invention provides a method for displaying data points stored in a multidimensional database.
  • the data points are defined along at least two dimensions.
  • the method comprises the steps of: extracting a parent data point from the multidimensional database; displaying the parent data point as a parent data point icon in a data point tree; selecting the parent data point icon from the data point tree; extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions; and displaying the child data points as respective icons in the data point tree, together with the relationships between the parent data point and the child data points.
  • the present invention also provides a corresponding apparatus to perform the steps described in the above method
  • FIG. 1 shows an exemplary dimension tree for the data along a product dimension
  • FIG. 2 is a block diagram showing a system for displaying a decomposition tree, in accordance with the present invention
  • FIG. 3 shows a hierarchy structure of an exemplary multidimensional database, which will be used to demonstrate the process of displaying a decomposition tree, in accordance with the present invention
  • FIG. 4A shows a hierarchy structure of the Product dimension shown in FIG. 3;
  • FIG. 4B shows a hierarchy structure of the Regions dimension shown in FIG. 3
  • FIG. 4C shows a hierarchy structure of the Time dimension shown in FIG. 3
  • FIG. 4D shows a hierarchy structure of the Customer dimension shown in FIG. 3;
  • FIG. 5 shows a screen shot illustrating a user graphic interface for invoking the Dtree program of the present invention
  • FIG. 6 shows a screen shot illustrating a step of creating a session and linking the session to a multidimensional database
  • FIG. 7 shows a screen shot illustrating a screen shot of selecting a measure for viewing
  • FIG. 8 shows a screen shot illustrating a step of selecting a root (starting) data point for the decomposition tree
  • FIG. 9 shows a screen shot illustrating a step of selecting a dimension and level for viewing
  • FIG. 10 shows a screen shot illustrate the decomposition tree along the “Customers” dimension at the “Channel” level
  • FIG. 11 shows a screen shot illustrate a step of skipping the “Channel” level along the “Customers” dimension
  • FIG. 12 shows a screen shot illustrating that the root data point (“All Customers” data point) is broken down to the “Customer Sectors”;
  • FIG. 13 shows a screen shot illustrate a step of displaying the child data points under the “Reseller” data point
  • FIG. 14 shows a screen shot illustrating a step of displaying the child data points under the “Corporate” data point
  • FIG. 15 shows a screen shot illustrating a step of shifting (or splitting) the data points grouped in the “Bottom” data point icon onto the screen
  • FIG. 16 shows a screen shot illustrating a step of changing dimension at a data point from which the decomposition tree is further broken down
  • FIG. 17 shows a screen shot illustrating that the “Corporate” data point is broken down along the “Regions” dimension at the “Country” level;
  • FIG. 18 shows a screen shot illustrating a step of displaying the child data points under the “Educational” data point
  • FIG. 19 shows a screen shot illustrating a step of selecting a level based on which the “USA” data point will be further broken down
  • FIG. 20 shows a screen shot illustrating the decomposition tree resulting from the user's selection in the screen shot shown in FIG. 19;
  • FIG. 21 shows a screen shot illustrating a step of changing dimension at “Austin” data point
  • FIG. 22 shows a screen shot illustrating the decomposition tree resulting from the user's selection in FIG. 21;
  • FIG. 23 shows a screen shot illustrating a step of changing the breaking down level along the “Product” dimension at the “Educational” data point
  • FIG. 24 shows a screen shot illustrating the decomposition tree resulting from the user's selection in FIG. 23;
  • FIG. 25 shows a screen shot illustrating a step of changing measure for decomposition tree
  • FIG. 26 shows a screen shot illustrating a measure menu
  • FIG. 27 shows a screen shot illustrating the decomposition tree resulting from the user's selection in FIG. 26;
  • FIGS. 28 A-B are two flowcharts for forming a decomposition tree.
  • FIG. 29 is a block diagram of a computer system, which can be used as a hardware platform for running the program to perform the process shown in FIGS. 5 - 27 and 28 A-B.
  • FIG. 2 is a block diagram showing a system 200 for displaying a decomposition tree containing the data points that are stored in a multidimensional database, in accordance with the present invention.
  • the system 200 includes a graphic user interface 206 that is displayed on a computer monitor screen, a decomposition tree (Dtree) program 208 , an OLAP (On Line Analysis Processing) database API (Application Interface) 210 , an OLAP multidimensional database server (OLAP server) 212 , and a multidimensional database (OLAP database) 214 .
  • Dtree decomposition tree
  • OLAP On Line Analysis Processing
  • OLAP server OLAP multidimensional database server
  • OLAP database multidimensional database
  • the OLAP database 214 stores data in multidimensional format, and the structural information (called meta-data) about the data.
  • the OLAP server 212 manages the multidimensional data stored in the OLAP database 214 . Specifically, the OLAP server 212 allows users to define the structure of the multidimensional data, load data into the OLAP database 214 , and execute data queries over data in the OLAP database 214 .
  • the OLAP database API 210 receives data queries from the Dtree program 208 , sends them to the OLAP server 212 , and receives resulting information from the OLAP server 212 .
  • a commercial available OLAP database API is the OLE-DB for OLAP, published by Microsoft Corporation and implemented in several OLAP products.
  • Meta-data which describes the structure and contents of the OLAP database 214 , consists of available data files, cubes, dimensions, levels, measures, etc.
  • a user can communicate with the Dtree program 208 , sending control requests and data queries to the Dtree program 208 .
  • the Dtree program 208 sets the decomposing parameters for displaying a decomposition tree.
  • the Dtree program 208 retrieves the meta-data from the OLAP database API 210 and presents the meta-data as menu options to the user as to the structure of the data points in the OLAP database 214 .
  • the Dtree program 208 When the user indicates, via the graphic user interface 206 , to the Dtree program 208 which data point is of interest and which structure element (i.e. dimension and level) he/she wants to break down, the Dtree program 208 issues a data query to the OLAP database API 210 . Upon receiving the data values of the data points of interest, the Dtree program 208 displays the data points and data values in a tree format to the user, according to the structure defined by the meta-data.
  • FIG. 3 shows a hierarchy structure of an exemplary multidimensional database, which will be used to demonstrate the process of displaying a decomposition tree below, in accordance with the present invention.
  • the database structure 300 includes four dimensions: Time, Customers, Regions, and Products.
  • the “Time” dimension is divided into three levels: Year, Quarter, and Month.
  • the “Customers” dimension is divided into three levels: Channel, Sector, and Name.
  • the “Regions” dimension is divided four levels: Region, Country, State province, and City.
  • the “Products” dimension is divided into three levels: Line, Family, and Itemname.
  • the four dimensions form a cube, which contains all data points in the multidimensional database.
  • the database structure 300 further includes Measures having three individual measures: Quantity, Sale, and Profit. Measures are quantitative values in the space cube. Each of the data points in the OLAP database 214 has its respective values relating to these three measures.
  • FIG. 4A shows a hierarchy structure of the “Products” dimension shown in FIG. 3.
  • the “Products” dimension has a root member “All Products”, which connects to three child members: Accessories, PCs, and Services.
  • the “Accessories” member connects to six child members: Cables, Hubs, Miscellaneous, Modems, NICs, and Printers.
  • the “Hub” member further connects to six child members: CentralHub 53 , CentralHub 59 , CentralHub 62 , NetMax 171 , NetMax 173 , and NetMax 174 .
  • the “PCs” member connects to four child members: Business PCs, Home PCs, Laptops, and Servers.
  • the “Services” member connects to three child members: consulting, Miscellaneous Services, and Training.
  • FIG. 4B shows a hierarchy structure of the “Regions” dimension of FIG. 3.
  • FIG. 4C shows a hierarchy structure of the “Time” dimension of FIG. 3.
  • FIG. 4D shows a hierarchy structure of the “Customers” dimension of FIG. 3.
  • the hierarchy structures in FIGS. 4 B-D can be broken down using a similar process described in connection with FIG. 4A.
  • FIGS. 5 - 25 show a sequence of screen shots illustrating a process of navigating through a plurality of data points and displaying them in the decomposition tree on a computer monitor screen, in accordance with the present invention.
  • the data points to be displayed have been stored in the OLAP database 214 with a structure as defined in FIGS. 3 and 4A-D.
  • a user is navigating through the data points by using a mouse having a right button and a left button (not shown). These data points will be represented as data point icons on the monitor screen.
  • the user can select a data point by left-clicking on the data point icon that represents the data point.
  • the user can select an item contained in a menu or pull-down list by left-clicking on the item.
  • Each of the data points associates with a menu containing the information (meta-data) about the structure of the data point.
  • the user can invoke (select) a menus that is associated with a data point by right-clicking on a corresponding data point icon.
  • the decomposition tree also associates with a menu.
  • the user can invoke the menu that is associated with the decomposition tree by right-clicking a vacant area on the screen shots shown in FIGS. 5 - 25 .
  • FIG. 5 shows a screen shot illustrating a graphic user interface 500 for invoking the Dtree program 208 produced by Knosvs, Inc.
  • the user left-clicks on (selects) the “View” button 502 .
  • the Dtree program 208 displays the screen shot 600 , as shown in FIG. 6.
  • FIG. 6 shows a screen shot illustrating a step of creating a session for displaying a decomposition tree, and of linking the session to the OLAP database 214 .
  • a pull-down list 602 is displayed on the screen shot 600 .
  • a second level pull-down list 604 is displayed on the screen shot 600 .
  • a third level pull-down list 608 is displayed on the screen shot 600 .
  • the Dtree program 208 In response to user's left-click on (selection of) the “Decomposition Tree” item 610 in the pull-down list 608 , the Dtree program 208 displays the screen shot 700 as shown in FIG. 7 on the screen. The user's left-click on (selection of) the “Decomposition Tree” item 610 causes the Dtree program 208 to create a session for the process and link the session to the OLAP database 214 .
  • FIGS. 7 - 9 show three screen shots allowing the user to set decomposing parameters (measure, sorting order, dimension, level, etc) for the decomposition tree to be formed.
  • FIG. 7 shows the screen shot 700 illustrating a step of selecting a measure for viewing.
  • the user left-clicks on (selects) “Sales” from the pull-down list 704 as a measure so that a respective sales value in the OLAP database 214 will be displayed together with each of the data points in the decomposition tree.
  • the user left-clicks on (selects) the “Biggest Items” as sorting order so that the data points in the decomposing process will be sorted in a descending order. If the user had selected the “Smallest Item” as sorting order, the data points in the decomposition tree would be sorted in an ascending order.
  • the Dtree program 208 displays the screen shot 800 as shown in FIG. 8.
  • FIG. 8 shows the screen shot 800 illustrating a step of selecting a root (starting) data point for the decomposition tree. As shown in FIG. 8, the “All Customers” data point is selected, as indicated by highlighted display. In response to the user's selection of the “Next” button, the Dtree program 208 displays the screen shot 900 as shown in FIG. 9.
  • FIG. 9 shows the screen shot 900 illustrating a step of selecting a dimension and level to begin the decomposing process.
  • the user left-clicks on (selects) the “Customer” dimension and the “Channel” level, as indicated by the highlighted display.
  • the Dtree program 208 maintains and automatically updates (if necessary) the decomposing parameters (including measure, sorting order, dimension, level, and root data point) selected by the user, and uses them in the decomposing process. However, as will be described below, the user can change decomposing parameters in the middle of the decomposing process.
  • the Dtree program 208 displays the screen shot 1000 , as shown in FIG. 1000.
  • FIG. 10 shows the screen shot 1000 illustrating the decomposition tree including three data point icons that represent three data points.
  • the “All Customers” data point is broken down along the “Customers” dimension at the “Channel” level.
  • the “All Customers” data point connects to two child data points: an “Indirect Channel” data point and a “Direct Channel” data point.
  • the “Indirect Channel” and “Direct Channel” data points have sales of 83M (million) and 79M, respectively; and contribute 51% and 49% of the sales measure respectively to the “All Customers” data point.
  • These two data points are displayed according to a descending order according to the sales measure, specified in the screen shot 700 .
  • the relationships between the “All Customers” data point and the two “Channel” data points are represented by the connecting lines between them.
  • FIG. 11 shows the screen shot 1100 illustrating a step of skipping the “Channel” level in the “Customers” dimension.
  • the user right-clicks on (selects) the “All Customers” data point icon to display a dimension menu associated with the “All Customers” data point.
  • the Dtree program 208 displays a pull-down list 1102 on the screen.
  • the pull-down list 1102 contains four dimension options (Customers, Products, Regions, and Time).
  • the user further left-clicks on (selects) the “Customers” dimension in the pull-down list 1102 .
  • the Dtree program 208 displays a pull-down list 1106 , which contains three level options (Channel—the first level, Sector —the second level, and Name—the third level) along the “Customers” dimension.
  • the user left-clicks (selects) “Sector” level in the pull-down list 1106 .
  • the user's selection of “Sector” level causes the Dtree program 208 to break the “All Customers” data point down to “Customers Sectors” along the “Customers” dimension.
  • the Dtree program displays the screen short 1200 shown in FIG. 12.
  • FIG. 12 shows the screen shot 1200 illustrating that the “All Customers” data point is broken down to the “Customer Sectors”, skipping the “Channel” level along the “Customers dimension”.
  • the “All Customers” data point is broken down to eight “Customer Sector” data points, which are represented by eight data point icons: Reseller, Corporate, Government, Distributor, Education, and OEM.
  • These eight “Customer Sector” data points have sales of 158M, 80M, 69M, 17M, 10M, ⁇ 3M, respectively; and they are displayed in a descending order according to the sales measure. These eight data points make up the contributes of 48%, 24%, 21%, 5%, 3%, and ⁇ 1 % of the sales to the “All Customers” data point.
  • FIG. 13 shows a screen shot 1300 illustrating a step of displaying the child data points under the “Reseller” data point.
  • the user left-clicks on (selects) the “Reseller” data point icon.
  • the Dtree program 208 retrieves 328 data points under the “Reseller” data point from the LAP database 214 , and displays six child data point icons to represent the 328 data points. It can be noticed that the Dtree program 208 groups 323 child data points having the lowest sales values into the “Bottom” data icon, so that all the child data points under the “Reseller” data point can be displayed in the monitor screen.
  • the Dtree program 208 would group 323 child data points having the highest sales values into a “Top” data icon. As shown in the screen shot 1300 , the aggregation of the Sales values in the six child data point icons equals to the total sales value in the “Reseller” data point. Again, the six data point icons are displayed in a descending order according to Sales value.
  • FIG. 14 shows a screen shot 1400 illustrating a step of displaying the child data points under the “Corporate” data point.
  • the user left-clicks on (selects) the “Corporate” data point icon.
  • the Dtree program 208 retrieves 157 child data points under the “Corporate” data point, and displays seven child data point icons to represent the 157 child data points.
  • the Dtree program 208 erases the six data point icons under the “Reseller” data point.
  • the Dtree program 208 groups 151 child data points having the lowest sales values into the “Bottom” data icon, so that all the child data points under the “Corporate” data point can be displayed on the monitor screen. Had the “Smallest Items” been selected in the screen shot 700 , the Dtree program 208 would group 151 child data points having the highest sales values into a “Top” data icon.
  • FIG. 15 shows a screen shot 1500 illustrating a step of shifting (or splitting) the data points grouped in the “Bottom” data point icon onto the monitor screen.
  • the user left-clicks on (selects) the “Bottom” data point icon once.
  • the Dtree program 208 shifts the child data point having the highest sales out of the “Bottom” data icon, and displays a data point icon to represent the data point that has been shifted out of the grouped data icon.
  • the Dtree program 208 groups the data point icon having the second highest sales value into the data point icon having the highest sales value.
  • the Dtree program 208 displays five data point icons to represent the five data points having the highest sales in the “Bottom” data point icon. These five shifted data points are: Kenduskeag System, Nooksack Distribution, Majestic Inc., Heartwell War, and Sweanee Inc. In the meantime, the Dtree program 208 groups the five data point icons in the screen shot 1400 into a “Top” data point. These five grouped data points are: Laconia Syste, Gumberry Company, Oakridge Distribution, Laupahoehoe, and Basin Technology.
  • FIG. 16 shows a screen shot 1600 illustrating a step of changing dimension at a data point from which the decomposition tree is further broken down.
  • the user right-clicks on (selects) the “Corporate” data point icon.
  • the Dtree program 208 displays a dimension menu associated with the “Corporate” data point at the “Sector” level in a pull-down list 1604 .
  • the Dtree program 208 further displays a level menu in a pull-down list 1606 .
  • the Dtree program 208 changes the dimension from “Customers” to “Regions”, and displays the screen shot 1700 as shown in FIG. 17.
  • FIG. 17 show the screen shot 1700 illustrating that the “Corporate” data point is broken down along the “Regions” dimension at “Country” level. It should be noted that in the decomposition tree shown in the screen shot 1700 , the “Region” level along the “Regions” dimension is skipped.
  • FIG. 18 shows a screen shot 1800 illustrating a step of displaying the child data points under the “Educational” data point.
  • the user left-clicks on (selects) on the “Educational” data point icon in FIG. 17.
  • the Dtree program 208 retrieves the 21 data points under the “Educational” data point from the OLAP database 214 , and displays six child data point icons to represent the 21 data points. Because the dimension has been changed from the “Customers” dimension to the “Regions” dimension at the “Country” level in the screen shot 1600 , the “Educational” data point is broken down along the “Region” dimension at “Country” level.
  • the countries in the six data point icons in the screen shot 1800 are the same with those in the screen shot 1700 .
  • the sales values and display sequence of the six “Country” data point icons are changed in the screen shot 1800 .
  • Spain is the fifth country in sales (2M) for the “Corporate Sector”.
  • Spain is the second country in sales (661K) for the “Educational Sector”.
  • FIG. 19 shows a screen shot 1900 illustrating a step of selecting a level based on which the “USA” data point will be further broken down.
  • the user right-clicks on (selects) the “USA” data point icon.
  • the Dtree program 208 displays a dimension menu in a pull-down list 1904 .
  • the Dtree program 208 further displays a level menu in a pull-down list 1906 .
  • the Dtree program 208 automatically updated the decomposing parameters in the decomposing process.
  • the “USA” data point can only be broken down by the levels below the “Country” level.
  • the user left-clicks on (selects) on the “City” level from the pull-down list 1906 .
  • the Dtree program 208 displays the screen shot 2000 as shown in FIG. 20, to break down the “USA” data point to the “City” level along the “Regions” dimension.
  • FIG. 20 shows the screen shot 2000 illustrating the decomposition tree resulting from the user's selection in the screen shot 1900 .
  • the decomposition tree in the screen shot 2000 can reflect user's analysis process, or train-of-thought.
  • the “Ention Sector” is the fifth Sector in terms of sales
  • the USA is the country having the largest sales (71% of all educational sales) in the “Educational Sector”
  • Austin is the city having the largest sales (9% of all educational sales) in the “Educational Sector” within the USA.
  • FIG. 21 shows a screen shot 2100 illustrating a step of changing dimension at the “Austin” data point, so that the user can inquire “what product families are the “Educational” customers in the city of Austin buying?”.
  • the user right-clicks on (selects) the “Austin” data point.
  • the Dtree program 208 displays a dimension menu in a pull-down list 2104 .
  • the Dtree program 208 displays a level menu in a pull-down list 2106 .
  • the Dtree program 208 In response to user's right-click on (selection of) the “Family” level in the pull-down list 2106 , the Dtree program 208 changes the dimension from “Regions” at “City” level to “Products” at “Family” level. The Dtree program 208 then displays the screen shot 2200 as shown in FIG. 22.
  • FIG. 22 shows a screen shot 2200 illustrating the decomposition tree resulting from the user's selection in the screen shot 2100 .
  • the screen shot 2200 displays a decomposition tree having five different levels of breaking down along three different dimensions.
  • the decomposition tree skipped four levels in the breaking down process: (1) the “Sector” level of the “Customers” dimension (skipping the “Channel” level”), (2) the “Country” level of the “Regions” dimension (skipping the “Region” level), (3) the “City” level of the “Regions” dimension, and (4) the “Family” level of the “Products” dimension.
  • the decomposition tree presents the user with a perspective view about the his/her analysis process.
  • the user may need to inquire whether the “Server Product Family” is that dominate across all sales in the “Educational Sector”. To do so, the user needs to change the break down level along the “Products” dimension at the “Educational” data point, as will be shown in the screen shot 2300 .
  • FIG. 23 shows the screen shot 2300 illustrating a step of changing the breaking down level along the “Product” dimension at the “Educational” data point.
  • the user right-clicks on (selects) the “Educational” data point.
  • the Dtree program 208 displays a dimension menu in a pull-down list 2304 .
  • the Dtree program 208 displays a level menu in a pull-down list 2306 .
  • the Dtree program 208 displays the screen shot 2400 , to break down the “Educational” data point at the “Family” level along the “Products” dimension.
  • FIG. 24 shows the screen shot 2400 illustrating the decomposition tree resulting from the user's selection in the screen shot 2300 .
  • the decomposition tree indicates that Servers product has the largest sales across all sales in “Educational Sector”. However, in contrast to the Servers product sales in Austin which makes up 92% of the total sales within the USA, the Servers product sales across the “Educational Sector” accounts only 43% of the all product sales.
  • the decomposition tree shown in the screen shot 2400 provides additional information.
  • the “Training”, “Miscellaneous Services”, and “Home PCs” product families even did not appear in the decomposition tree shown in the screen shot 2300 .
  • the user may need to inquire the “Profit Margin” for the “Servers Product Family” across the “Educational Sector”. To do so, the user needs to change the measure at the “Educational” data point, as will be shown in the screen shot 2500 .
  • FIG. 25 shows the screen shot 2500 illustrating a step of changing measure for the decomposition tree.
  • the user right-clicks on (selects) a vacant area (meaning it does not contain any data point icons).
  • the Dtree program 208 displays a menu in a pull-down list 2504 .
  • the Dtree program 208 displays a screen shot 2600 as shown in FIG. 26.
  • FIG. 26 shows the screen shot 2600 illustrating a step of changing the measure for the decomposition tree.
  • the screen shot 2600 contains a measure menu in a pull-down list 2604 .
  • the Dtree program 208 displays the screen shot 2700 , to display the “Profit Margin” measures in the data point icons contained in the decomposition tree shown in FIG. 2700.
  • FIG. 27 shows the screen shot 2700 illustrating the decomposition tree resulting from the user's selection in the screen shot 2600 .
  • a “Profit Margin” measure is displayed within each of the data point icon in the decomposition tree. It can be noticed that the data points at both the “Sector” level and “Family” level are displayed in a descending order according to the “Profit Margin” measure.
  • FIGS. 28 A-B are two flowcharts for forming a decomposition tree in a data navigation process by a user, in accordance with the present invention.
  • FIG. 28A is a flowchart illustrating a process of selecting a root data point for the decomposition tree, in accordance with the present invention.
  • step 2802 the user sends a control request, via the graphic user interface 206 , to the Dtree program 208 to create a session.
  • the Dtree program 208 creates a session and links the session to a multidimensional database. (See FIG. 6).
  • step 2804 the user selects a root data point via the graphic user interface 206 .
  • the user selects decomposing parameters (including a dimension, the level within the dimension, and a measure) via the graphic user interface 206 .
  • the Dtree program 208 sets the selected decomposing parameters for breaking down the root data point, in response to the selections in steps 2804 and 2806 .
  • the Dtree program 208 sends a data query to the OLAP database API 210 to retrieve the root data point and the measure value associated with the root data point.
  • the Dtree program 208 receives the root data point and the associated measure value from the OLAP database API 210 .
  • the Dtree program 208 displays a root data point icon on a computer monitor screen, together with the associated measure value, to represent the root data point.
  • FIG. 28B is a flowchart illustrating a process of breaking down a data point that is being displayed on the decomposition tree, in accordance with the present invention.
  • step 2856 the user selects a data point icon (which represents a corresponding data point) from the decomposition tree that is being displayed on the computer monitor screen by left-clicking or right-clicking on the data point data icon.
  • the user's selection causes the graphic user interface 206 sends a control request to the Dtree program 208 .
  • the Dtree program 208 determines whether the decomposing parameters need to be changed. If the decomposing parameters need to be changed (i.e. the user has selected the data point by right-clicking on the data point icon, as shown in FIG. 19 or 21 ), the process is led to step 2862 ; if the decomposing parameters need not to be changed (i.e. the user has selected the data point by left-clicking on (selecting) the data point icon, as shown in FIG. 13 or 14 ), the process is led to step 2860 .
  • step 2860 if the decomposing parameters need not to be changed, the Dtree program 208 uses the decomposing parameters that are maintained in and updated by the Dtree program 208 . The process is then led to step 2868 .
  • the Dtree program 208 displays parameter menu(s) containing parameter options. (See FIG. 19 or 21 ).
  • step 2864 the user selects decomposing parameter(s) from the parameter menu(s). (See FIG. 19 or 21 ). The user's selection causes the graphic user interface 206 to send a control request to the Dtree program 208 .
  • the Dtree program 208 sets the changed decomposing parameter(s) for breaking down the selected data point.
  • the Dtree program 208 sends a data query to the OLAP database API 210 to retrieve the data point(s) under the selected data point and the measure value(s) associated with the data point(s) to be retrieved.
  • the Dtree program 208 requests the OLAP database API 120 to return the data point(s) in a sorted order according to the measure value(s).
  • the Dtree program 208 receives the data point(s) under the selected data point and the associated measure value(s) from the OLAP database API 210 .
  • the Dtree program 208 displays data point icon(s) on the computer monitor screen, together with the associated measure value(s), to represent the retrieved data point(s).
  • the retrieved data point(s) is/are displayed in an order according to the sorted measure value(s).
  • the Dtree program 208 displays the relationship(s) between the selected data point and the retrieved data point(s).
  • the present invention facilitates a user to explore the values and relationships among the data points in a multidimensional database by displaying these data points in a decomposition tree.
  • the decomposition tree allows a user to easily navigate through N-dimensional data and quickly find the underlying values that are driving the aggregated measure values. With this decomposition tree, a user can navigate vertically through multiple layers into the data points that make up a parent data point and horizontally across multiple dimensions while maintaining a vertical perspective of the navigation paths within the multidimensional database.
  • the decomposition tree provides the following features and advantages:
  • the user may start a decomposition tree at any data point in a multidimensional database.
  • Decomposition data points are sorted based on their measure value, and are displayed to the user in the order according to each data point's contribution.
  • the user can select any data point on the decomposition tree, making the selected data point the root data point of a new decomposition tree.
  • the decomposition tree automatically places all data points that cannot be displayed into a “group” data point representing the aggregation of all data points in that group.
  • Any data point in the decomposition tree can be selected and decomposed by any of its available descendent levels within any dimension in the multidimensional database.
  • FIG. 29 shows a block diagram of a computer system 2900 , which can be used as a hardware platform for running the program to form the decomposition tree in the present invention.
  • the computer system comprises a processing unit 2902 , a memory device 2904 , a hard disk 2906 , a disk drive interface 2908 , a display monitor 2910 (including a computer monitor screen), a display interface 2912 , a bus interface 2914 , a mouse 2915 , a keyboard 2916 , and a system bus 2918 .
  • Hard disk 2906 is coupled to disk drive interface 2908 ; display monitor 2910 is coupled to display interface 2912 ; and mouse 2915 and keyboard 2916 are coupled to bus interface 2924 .
  • Coupled to system bus 2918 are: processing unit 2902 , memory device 2904 , disk drive interface 2908 , display interface 2912 , and bus interface 2914 .
  • Memory device 2904 is able to store programs (including data and instructions). Operating together with disk drive interface 2908 , hard disk 2906 is also able to store programs. However, memory device 2904 has faster access speed than hard disk 2906 , while hard disk 2906 has higher capacity than memory device 2904 .
  • display monitor 2910 is able to provide graphic interface between programs being executed and a user.
  • Processing unit 2902 has access to memory device 2904 and hard disk 2906 , and is able to control operations of computer 2900 by executing programs stored in memory device 2904 or hard disk 2906 . Processing unit 2902 is also able to control the transmissions of programs and data between memory device 2904 and hard disk 2906 .
  • the program to perform the process shown in FIGS. 5 - 27 and 28 A-B are stored in memory device 2904 or hard disk 2906 , and executed by the processing unit 2902 .

Abstract

A method and apparatus for forming a decomposition tree in navigating through the data points in a multidimensional database.

Description

    FIELD OF THE INVENTION
  • The present invention relates generally to a method and apparatus for visually displaying data, and more specifically, to a method and apparatus for navigating and displaying data points stored in a multidimensional database. [0001]
  • BACKGROUND OF THE INVENTION
  • The data in a multidimensional information system can be defined (or arranged) along multiple dimensions. For example, the data in a sales management system may include time, location, customer, and product dimensions. A dimension may include many members. The members in one dimension can be organized as a hierarchical tree with multiple levels. [0002]
  • FIG. 1 shows an exemplary dimension tree for the data along a product dimension; in which “All Products” is a member; “Furniture” is a member; “Electronics” is a member; “Beds” is a member; and so on. In the dimensional tree, the upward connections are called parent connections, and the downward connections are called child connections. “All Products” is the first level member in the dimension tree; “Furniture” and “Electronics” are the second level members in the dimension tree; “Desks”, “Chairs”, “Beds”, “Home Appliance”, and “Office Equipment” are the third level members in the dimension tree; and so on. “Furniture” is the parent of “Desks”, “Chairs”, and “Beds”; “Furniture” and “Electronics” are children of “All Products”; and so on. A member without a parent is called root member. Specifically, “All Products” is a root member. [0003]
  • In a multidimensional database system having N dimensions with multiple levels per dimension, a data point (or cell) is defined as the intersection of one member from each dimension. The N dimensions form a cube, which contains all data points in the database system. Thus, the more dimensions and levels per dimension, the more complex is the neighboring data points surrounding a given data point. For example, in an N-dimensional database with each dimension having only one level, each data point in the database has 2N immediate neighboring data points or navigation directions. The multidimensional information system are described in greater detail in [0004] OLAP Solutions by Erik Thomsen published in 1997. This book is incorporated into this application by reference.
  • Thus, efforts have been made to develop tools for facilitating users to navigate through multidimensional database and display data points that are being navigated along multiple dimensions. However, the existing data navigation and display tools does not provide the flexibility in navigating data points along multiple dimensions. Specifically, in the existing data navigation and display tools, the navigation paths are limited by the hierarchical structure of the multidimensional database. Thus, a user may not be able to navigate through a multidimensional database in a sequence of paths that fits the user's thought process. In addition, the existing data navigation and display tool displays the data points separately on a computer screen. Thus, it does not present a comprehensive view for the data points that are being navigated. [0005]
  • Furthermore, the existing data navigation and display tool processes multidimensional data points within a single dimensional hierarchy. To change a dimension in the middle of a data navigation process, a user has to perform a so called “pivotal” process to bring a new dimension into focus. In doing so, the user may lose the navigation paths previously performed, thus losing the context and importance of the piece of data that is being currently displayed on the computer screen. Also, such a “pivotal” process is relatively complicated and not easy for an average user to grasp. [0006]
  • There is, therefore, a need for an improved method and apparatus that provide flexible navigation paths through the data points in a multidimensional database. [0007]
  • There is another need for an improved method and apparatus that provide users with a comprehensive graphical view of the data points stored in a multidimensional database, while the data points are being navigated. [0008]
  • There is yet another need to provide an improved method and apparatus for navigating and displaying the data points stored in a multidimensional database, which are easier for users to use. [0009]
  • The present invention provides such a method and apparatus to meet these three needs. [0010]
  • SUMMARY OF THE INVENTION
  • To overcome the shortcomings in the existing art, the present invention provides a novel method for displaying data points stored in a multidimensional database. [0011]
  • In a broad aspect, the invention provides a method for displaying data points stored in a multidimensional database. The data points are defined along at least two dimensions. The method comprises the steps of: extracting a parent data point from the multidimensional database; displaying the parent data point as a parent data point icon in a data point tree; selecting the parent data point icon from the data point tree; extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions; and displaying the child data points as respective icons in the data point tree, together with the relationships between the parent data point and the child data points. [0012]
  • The present invention also provides a corresponding apparatus to perform the steps described in the above method[0013]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The purpose and advantages of the present invention will be apparent to those skilled in the art from the following detailed description in conjunction with the appended drawing, in which: [0014]
  • FIG. 1 shows an exemplary dimension tree for the data along a product dimension; [0015]
  • FIG. 2 is a block diagram showing a system for displaying a decomposition tree, in accordance with the present invention [0016]
  • FIG. 3 shows a hierarchy structure of an exemplary multidimensional database, which will be used to demonstrate the process of displaying a decomposition tree, in accordance with the present invention [0017]
  • FIG. 4A shows a hierarchy structure of the Product dimension shown in FIG. 3; [0018]
  • [0019]
  • FIG. 4B shows a hierarchy structure of the Regions dimension shown in FIG. 3 [0020]
  • FIG. 4C shows a hierarchy structure of the Time dimension shown in FIG. 3 [0021]
  • FIG. 4D shows a hierarchy structure of the Customer dimension shown in FIG. 3; [0022]
  • FIG. 5 shows a screen shot illustrating a user graphic interface for invoking the Dtree program of the present invention; [0023]
  • FIG. 6 shows a screen shot illustrating a step of creating a session and linking the session to a multidimensional database; [0024]
  • FIG. 7 shows a screen shot illustrating a screen shot of selecting a measure for viewing; [0025]
  • FIG. 8 shows a screen shot illustrating a step of selecting a root (starting) data point for the decomposition tree; [0026]
  • FIG. 9 shows a screen shot illustrating a step of selecting a dimension and level for viewing; [0027]
  • FIG. 10 shows a screen shot illustrate the decomposition tree along the “Customers” dimension at the “Channel” level [0028]
  • FIG. 11 shows a screen shot illustrate a step of skipping the “Channel” level along the “Customers” dimension; [0029]
  • FIG. 12 shows a screen shot illustrating that the root data point (“All Customers” data point) is broken down to the “Customer Sectors”; [0030]
  • FIG. 13 shows a screen shot illustrate a step of displaying the child data points under the “Reseller” data point; [0031]
  • FIG. 14 shows a screen shot illustrating a step of displaying the child data points under the “Corporate” data point; [0032]
  • FIG. 15 shows a screen shot illustrating a step of shifting (or splitting) the data points grouped in the “Bottom” data point icon onto the screen [0033]
  • FIG. 16 shows a screen shot illustrating a step of changing dimension at a data point from which the decomposition tree is further broken down; [0034]
  • FIG. 17 shows a screen shot illustrating that the “Corporate” data point is broken down along the “Regions” dimension at the “Country” level; [0035]
  • FIG. 18 shows a screen shot illustrating a step of displaying the child data points under the “Educational” data point; [0036]
  • FIG. 19 shows a screen shot illustrating a step of selecting a level based on which the “USA” data point will be further broken down; [0037]
  • FIG. 20 shows a screen shot illustrating the decomposition tree resulting from the user's selection in the screen shot shown in FIG. 19; [0038]
  • FIG. 21 shows a screen shot illustrating a step of changing dimension at “Austin” data point; [0039]
  • FIG. 22 shows a screen shot illustrating the decomposition tree resulting from the user's selection in FIG. 21; [0040]
  • FIG. 23 shows a screen shot illustrating a step of changing the breaking down level along the “Product” dimension at the “Educational” data point; [0041]
  • FIG. 24 shows a screen shot illustrating the decomposition tree resulting from the user's selection in FIG. 23; [0042]
  • FIG. 25 shows a screen shot illustrating a step of changing measure for decomposition tree; [0043]
  • FIG. 26 shows a screen shot illustrating a measure menu; [0044]
  • FIG. 27 shows a screen shot illustrating the decomposition tree resulting from the user's selection in FIG. 26; [0045]
  • FIGS. [0046] 28A-B are two flowcharts for forming a decomposition tree; and
  • FIG. 29 is a block diagram of a computer system, which can be used as a hardware platform for running the program to perform the process shown in FIGS. [0047] 5-27 and 28A-B.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
  • The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the preferred embodiments will be readily apparent to those skilled in the art, and the principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded with the broadest scope consistent with the principles and features disclosed herein. [0048]
  • FIG. 2 is a block diagram showing a system [0049] 200 for displaying a decomposition tree containing the data points that are stored in a multidimensional database, in accordance with the present invention.
  • As shown in FIG. 2, the system [0050] 200 includes a graphic user interface 206 that is displayed on a computer monitor screen, a decomposition tree (Dtree) program 208, an OLAP (On Line Analysis Processing) database API (Application Interface) 210, an OLAP multidimensional database server (OLAP server) 212, and a multidimensional database (OLAP database) 214.
  • The [0051] OLAP database 214 stores data in multidimensional format, and the structural information (called meta-data) about the data. The OLAP server 212 manages the multidimensional data stored in the OLAP database 214. Specifically, the OLAP server 212 allows users to define the structure of the multidimensional data, load data into the OLAP database 214, and execute data queries over data in the OLAP database 214. The OLAP database API 210 receives data queries from the Dtree program 208, sends them to the OLAP server 212, and receives resulting information from the OLAP server 212. A commercial available OLAP database API is the OLE-DB for OLAP, published by Microsoft Corporation and implemented in several OLAP products. Information queried from the OLAP server 212 takes two forms: (1) meta-data, and (2) user data. Meta-data, which describes the structure and contents of the OLAP database 214, consists of available data files, cubes, dimensions, levels, measures, etc.
  • Interacting with the [0052] graphic user interface 206 by using a mouse and a keyboard (not shown), a user can communicate with the Dtree program 208, sending control requests and data queries to the Dtree program 208. In response to the control requests (such as selections or changes on dimensions, measures, and levels) from the user, the Dtree program 208 sets the decomposing parameters for displaying a decomposition tree. In response to the data queries, the Dtree program 208 retrieves the meta-data from the OLAP database API 210 and presents the meta-data as menu options to the user as to the structure of the data points in the OLAP database 214. When the user indicates, via the graphic user interface 206, to the Dtree program 208 which data point is of interest and which structure element (i.e. dimension and level) he/she wants to break down, the Dtree program 208 issues a data query to the OLAP database API 210. Upon receiving the data values of the data points of interest, the Dtree program 208 displays the data points and data values in a tree format to the user, according to the structure defined by the meta-data.
  • FIG. 3 shows a hierarchy structure of an exemplary multidimensional database, which will be used to demonstrate the process of displaying a decomposition tree below, in accordance with the present invention. [0053]
  • As shown in FIG. 3, the database structure [0054] 300 includes four dimensions: Time, Customers, Regions, and Products. The “Time” dimension is divided into three levels: Year, Quarter, and Month. The “Customers” dimension is divided into three levels: Channel, Sector, and Name. The “Regions” dimension is divided four levels: Region, Country, State Province, and City. The “Products” dimension is divided into three levels: Line, Family, and Itemname. The four dimensions form a cube, which contains all data points in the multidimensional database. The database structure 300 further includes Measures having three individual measures: Quantity, Sale, and Profit. Measures are quantitative values in the space cube. Each of the data points in the OLAP database 214 has its respective values relating to these three measures.
  • FIG. 4A shows a hierarchy structure of the “Products” dimension shown in FIG. 3. In FIG. 4A, the “Products” dimension has a root member “All Products”, which connects to three child members: Accessories, PCs, and Services. The “Accessories” member connects to six child members: Cables, Hubs, Miscellaneous, Modems, NICs, and Printers. The “Hub” member further connects to six child members: [0055] CentralHub 53, CentralHub 59, CentralHub 62, NetMax 171, NetMax 173, and NetMax 174. The “PCs” member connects to four child members: Business PCs, Home PCs, Laptops, and Servers. The “Services” member connects to three child members: Consulting, Miscellaneous Services, and Training.
  • FIG. 4B shows a hierarchy structure of the “Regions” dimension of FIG. 3. FIG. 4C shows a hierarchy structure of the “Time” dimension of FIG. 3. FIG. 4D shows a hierarchy structure of the “Customers” dimension of FIG. 3. The hierarchy structures in FIGS. [0056] 4B-D can be broken down using a similar process described in connection with FIG. 4A.
  • FIGS. [0057] 5-25 show a sequence of screen shots illustrating a process of navigating through a plurality of data points and displaying them in the decomposition tree on a computer monitor screen, in accordance with the present invention.
  • In describing the process, it is assumed that the data points to be displayed have been stored in the [0058] OLAP database 214 with a structure as defined in FIGS. 3 and 4A-D. A user is navigating through the data points by using a mouse having a right button and a left button (not shown). These data points will be represented as data point icons on the monitor screen. The user can select a data point by left-clicking on the data point icon that represents the data point. By the same token, the user can select an item contained in a menu or pull-down list by left-clicking on the item. Each of the data points associates with a menu containing the information (meta-data) about the structure of the data point. The user can invoke (select) a menus that is associated with a data point by right-clicking on a corresponding data point icon. The decomposition tree also associates with a menu. The user can invoke the menu that is associated with the decomposition tree by right-clicking a vacant area on the screen shots shown in FIGS. 5-25.
  • FIG. 5 shows a screen shot illustrating a [0059] graphic user interface 500 for invoking the Dtree program 208 produced by Knosvs, Inc. To start the Dtree program 208, the user left-clicks on (selects) the “View” button 502. In response to the user's selection, the Dtree program 208 displays the screen shot 600, as shown in FIG. 6.
  • FIG. 6 shows a screen shot illustrating a step of creating a session for displaying a decomposition tree, and of linking the session to the [0060] OLAP database 214. As shown in FIG. 6, a pull-down list 602 is displayed on the screen shot 600. In response to user's left-click on (selection of) the “View 1 Type” item 603 in the pull down list 602, a second level pull-down list 604 is displayed on the screen shot 600. In response to user's left-click on (selection of) the “Advanced Analysis Tools” item 606 in the pull-down list 604, a third level pull-down list 608 is displayed on the screen shot 600. In response to user's left-click on (selection of) the “Decomposition Tree” item 610 in the pull-down list 608, the Dtree program 208 displays the screen shot 700 as shown in FIG. 7 on the screen. The user's left-click on (selection of) the “Decomposition Tree” item 610 causes the Dtree program 208 to create a session for the process and link the session to the OLAP database 214.
  • FIGS. [0061] 7-9 show three screen shots allowing the user to set decomposing parameters (measure, sorting order, dimension, level, etc) for the decomposition tree to be formed.
  • FIG. 7 shows the screen shot [0062] 700 illustrating a step of selecting a measure for viewing. As shown in FIG. 7, the user left-clicks on (selects) “Sales” from the pull-down list 704 as a measure so that a respective sales value in the OLAP database 214 will be displayed together with each of the data points in the decomposition tree. Further, the user left-clicks on (selects) the “Biggest Items” as sorting order so that the data points in the decomposing process will be sorted in a descending order. If the user had selected the “Smallest Item” as sorting order, the data points in the decomposition tree would be sorted in an ascending order. In response to the user's selection of the “Next” button 610 in the screen short 600, the Dtree program 208 displays the screen shot 800 as shown in FIG. 8.
  • FIG. 8 shows the screen shot [0063] 800 illustrating a step of selecting a root (starting) data point for the decomposition tree. As shown in FIG. 8, the “All Customers” data point is selected, as indicated by highlighted display. In response to the user's selection of the “Next” button, the Dtree program 208 displays the screen shot 900 as shown in FIG. 9.
  • FIG. 9 shows the screen shot [0064] 900 illustrating a step of selecting a dimension and level to begin the decomposing process. As shown in FIG. 9, the user left-clicks on (selects) the “Customer” dimension and the “Channel” level, as indicated by the highlighted display. The Dtree program 208 maintains and automatically updates (if necessary) the decomposing parameters (including measure, sorting order, dimension, level, and root data point) selected by the user, and uses them in the decomposing process. However, as will be described below, the user can change decomposing parameters in the middle of the decomposing process. In response to user left-click on (selection of) the “Finish” button, the Dtree program 208 displays the screen shot 1000, as shown in FIG. 1000.
  • FIG. 10 shows the screen shot [0065] 1000 illustrating the decomposition tree including three data point icons that represent three data points. At the root level is the “All Customers” data point, which is broken down along the “Customers” dimension at the “Channel” level. As shown in FIG. 10, the “All Customers” data point connects to two child data points: an “Indirect Channel” data point and a “Direct Channel” data point. The “Indirect Channel” and “Direct Channel” data points have sales of 83M (million) and 79M, respectively; and contribute 51% and 49% of the sales measure respectively to the “All Customers” data point. These two data points are displayed according to a descending order according to the sales measure, specified in the screen shot 700. The relationships between the “All Customers” data point and the two “Channel” data points are represented by the connecting lines between them.
  • FIG. 11 shows the screen shot [0066] 1100 illustrating a step of skipping the “Channel” level in the “Customers” dimension. As shown in FIG. 11, the user right-clicks on (selects) the “All Customers” data point icon to display a dimension menu associated with the “All Customers” data point. In response, the Dtree program 208 displays a pull-down list 1102 on the screen. The pull-down list 1102 contains four dimension options (Customers, Products, Regions, and Time). To display a level menu associated with the “Customers” dimension, the user further left-clicks on (selects) the “Customers” dimension in the pull-down list 1102. In response, the Dtree program 208 displays a pull-down list 1106, which contains three level options (Channel—the first level, Sector —the second level, and Name—the third level) along the “Customers” dimension. To skip the “Channel” level, the user left-clicks (selects) “Sector” level in the pull-down list 1106. The user's selection of “Sector” level causes the Dtree program 208 to break the “All Customers” data point down to “Customers Sectors” along the “Customers” dimension. In response to the user's selection of the “Sector” level, the Dtree program displays the screen short 1200 shown in FIG. 12.
  • FIG. 12 shows the screen shot [0067] 1200 illustrating that the “All Customers” data point is broken down to the “Customer Sectors”, skipping the “Channel” level along the “Customers dimension”. As shown in FIG. 12, the “All Customers” data point is broken down to eight “Customer Sector” data points, which are represented by eight data point icons: Reseller, Corporate, Government, Distributor, Education, and OEM. These eight “Customer Sector” data points have sales of 158M, 80M, 69M, 17M, 10M, −3M, respectively; and they are displayed in a descending order according to the sales measure. These eight data points make up the contributes of 48%, 24%, 21%, 5%, 3%, and −1 % of the sales to the “All Customers” data point.
  • FIG. 13 shows a screen shot [0068] 1300 illustrating a step of displaying the child data points under the “Reseller” data point. To display the child data points under the “Reseller” data point, the user left-clicks on (selects) the “Reseller” data point icon. In response, the Dtree program 208 retrieves 328 data points under the “Reseller” data point from the LAP database 214, and displays six child data point icons to represent the 328 data points. It can be noticed that the Dtree program 208 groups 323 child data points having the lowest sales values into the “Bottom” data icon, so that all the child data points under the “Reseller” data point can be displayed in the monitor screen. Had the “Smallest Items” been selected in the screen shot 700, the Dtree program 208 would group 323 child data points having the highest sales values into a “Top” data icon. As shown in the screen shot 1300, the aggregation of the Sales values in the six child data point icons equals to the total sales value in the “Reseller” data point. Again, the six data point icons are displayed in a descending order according to Sales value.
  • FIG. 14 shows a [0069] screen shot 1400 illustrating a step of displaying the child data points under the “Corporate” data point. To display the child data points under the “Corporate” data point, the user left-clicks on (selects) the “Corporate” data point icon. In response, the Dtree program 208 retrieves 157 child data points under the “Corporate” data point, and displays seven child data point icons to represent the 157 child data points. In the meantime, the Dtree program 208 erases the six data point icons under the “Reseller” data point. It can be noticed that the Dtree program 208 groups 151 child data points having the lowest sales values into the “Bottom” data icon, so that all the child data points under the “Corporate” data point can be displayed on the monitor screen. Had the “Smallest Items” been selected in the screen shot 700, the Dtree program 208 would group 151 child data points having the highest sales values into a “Top” data icon.
  • FIG. 15 shows a [0070] screen shot 1500 illustrating a step of shifting (or splitting) the data points grouped in the “Bottom” data point icon onto the monitor screen. To display a child data point having the highest sales value in the “Bottom” data point icon, the user left-clicks on (selects) the “Bottom” data point icon once. In response, the Dtree program 208 shifts the child data point having the highest sales out of the “Bottom” data icon, and displays a data point icon to represent the data point that has been shifted out of the grouped data icon. In the means time, the Dtree program 208 groups the data point icon having the second highest sales value into the data point icon having the highest sales value. Specifically, to display five data points having the highest sales in the “Bottom” data point icon, the user left-clicks on (selects) the “Bottom” data icon in FIG. 1400 five times. In response, the Dtree program 208 displays five data point icons to represent the five data points having the highest sales in the “Bottom” data point icon. These five shifted data points are: Kenduskeag System, Nooksack Distribution, Majestic Inc., Heartwell War, and Sweanee Inc. In the meantime, the Dtree program 208 groups the five data point icons in the screen shot 1400 into a “Top” data point. These five grouped data points are: Laconia Syste, Gumberry Company, Oakridge Distribution, Laupahoehoe, and Basin Technology.
  • FIG. 16 shows a screen shot [0071] 1600 illustrating a step of changing dimension at a data point from which the decomposition tree is further broken down. To change the dimension at the “Corporate” data point, the user right-clicks on (selects) the “Corporate” data point icon. In response, the Dtree program 208 displays a dimension menu associated with the “Corporate” data point at the “Sector” level in a pull-down list 1604. In response to user's right-click on (selection of) “Regions” dimension in the pull-down list 1604, the Dtree program 208 further displays a level menu in a pull-down list 1606. In response to user's left-click on (selection of) “Country” level in the pull-down list 1606, the Dtree program 208 changes the dimension from “Customers” to “Regions”, and displays the screen shot 1700 as shown in FIG. 17.
  • FIG. 17 show the screen shot [0072] 1700 illustrating that the “Corporate” data point is broken down along the “Regions” dimension at “Country” level. It should be noted that in the decomposition tree shown in the screen shot 1700, the “Region” level along the “Regions” dimension is skipped.
  • FIG. 18 shows a [0073] screen shot 1800 illustrating a step of displaying the child data points under the “Educational” data point. To break down the “Educational” data point, the user left-clicks on (selects) on the “Educational” data point icon in FIG. 17. In response, the Dtree program 208 retrieves the 21 data points under the “Educational” data point from the OLAP database 214, and displays six child data point icons to represent the 21 data points. Because the dimension has been changed from the “Customers” dimension to the “Regions” dimension at the “Country” level in the screen shot 1600, the “Educational” data point is broken down along the “Region” dimension at “Country” level. It can be noticed that the countries in the six data point icons in the screen shot 1800 are the same with those in the screen shot 1700. However, the sales values and display sequence of the six “Country” data point icons are changed in the screen shot 1800. For example, in the screen shot 1700, Spain is the fifth country in sales (2M) for the “Corporate Sector”. In the screen shot 1800, Spain is the second country in sales (661K) for the “Educational Sector”.
  • FIG. 19 shows a [0074] screen shot 1900 illustrating a step of selecting a level based on which the “USA” data point will be further broken down. To do so, the user right-clicks on (selects) the “USA” data point icon. In response, the Dtree program 208 displays a dimension menu in a pull-down list 1904. In response to user's right-click on (selection of) the “Regions” dimension in the pull-down list 1904, the Dtree program 208 further displays a level menu in a pull-down list 1906. It can be noticed that the first two levels of the “Regions” dimension are not available in the level menu, because the “USA” data point is located at the “Country” level along the “Regions” dimension. The Dtree program 208 automatically updated the decomposing parameters in the decomposing process. Thus, the “USA” data point can only be broken down by the levels below the “Country” level. To select the “City” level, the user left-clicks on (selects) on the “City” level from the pull-down list 1906. In response, the Dtree program 208 displays the screen shot 2000 as shown in FIG. 20, to break down the “USA” data point to the “City” level along the “Regions” dimension.
  • FIG. 20 shows the screen shot [0075] 2000 illustrating the decomposition tree resulting from the user's selection in the screen shot 1900. The decomposition tree in the screen shot 2000 can reflect user's analysis process, or train-of-thought. As shown in the screen shot 2000, the “Education Sector” is the fifth Sector in terms of sales, the USA is the country having the largest sales (71% of all educational sales) in the “Educational Sector”, and Austin is the city having the largest sales (9% of all educational sales) in the “Educational Sector” within the USA.
  • FIG. 21 shows a screen shot [0076] 2100 illustrating a step of changing dimension at the “Austin” data point, so that the user can inquire “what product families are the “Educational” customers in the city of Austin buying?”. To change the dimension at the “Austin” data point, the user right-clicks on (selects) the “Austin” data point. In response, the Dtree program 208 displays a dimension menu in a pull-down list 2104. In response to user's right-click on (selection of) the “Products” dimension in the pull-down list 2104, the Dtree program 208 displays a level menu in a pull-down list 2106. In response to user's right-click on (selection of) the “Family” level in the pull-down list 2106, the Dtree program 208 changes the dimension from “Regions” at “City” level to “Products” at “Family” level. The Dtree program 208 then displays the screen shot 2200 as shown in FIG. 22.
  • FIG. 22 shows a screen shot [0077] 2200 illustrating the decomposition tree resulting from the user's selection in the screen shot 2100. As shown in FIG. 22, the screen shot 2200 displays a decomposition tree having five different levels of breaking down along three different dimensions. The decomposition tree skipped four levels in the breaking down process: (1) the “Sector” level of the “Customers” dimension (skipping the “Channel” level”), (2) the “Country” level of the “Regions” dimension (skipping the “Region” level), (3) the “City” level of the “Regions” dimension, and (4) the “Family” level of the “Products” dimension. The decomposition tree presents the user with a perspective view about the his/her analysis process. For example, even though the USA has the largest sales in the “Educational” sector, the Austin has the largest sales in the USA, and the Servers product accounts 92% of sales in Austin city; the “Educational Sector” itself counts only 3% of all sales. At this point, the user may need to inquire whether the “Server Product Family” is that dominate across all sales in the “Educational Sector”. To do so, the user needs to change the break down level along the “Products” dimension at the “Educational” data point, as will be shown in the screen shot 2300.
  • FIG. 23 shows the screen shot [0078] 2300 illustrating a step of changing the breaking down level along the “Product” dimension at the “Educational” data point. To change the break down level along the “Product” dimension, the user right-clicks on (selects) the “Educational” data point. In response, the Dtree program 208 displays a dimension menu in a pull-down list 2304. In response to user's right-click on (selection of) the “Products” dimension in the pull-down list 2304, the Dtree program 208 displays a level menu in a pull-down list 2306. In response to user's right-click on (selection of) “Family” level in the pull-down list 2306, the Dtree program 208 displays the screen shot 2400, to break down the “Educational” data point at the “Family” level along the “Products” dimension.
  • FIG. 24 shows the screen shot [0079] 2400 illustrating the decomposition tree resulting from the user's selection in the screen shot 2300. As shown in the screen shot 2400, the decomposition tree indicates that Servers product has the largest sales across all sales in “Educational Sector”. However, in contrast to the Servers product sales in Austin which makes up 92% of the total sales within the USA, the Servers product sales across the “Educational Sector” accounts only 43% of the all product sales. The decomposition tree shown in the screen shot 2400 provides additional information. Specifically, comparing with the decomposition tree in the screen shot 2400, the “Training”, “Miscellaneous Services”, and “Home PCs” product families even did not appear in the decomposition tree shown in the screen shot 2300. This means that the “Training”, “Miscellaneous Services”, and “Home PCs” product families did not have any sales to “Educational Customers” in Austin. At this point, the user may need to inquire the “Profit Margin” for the “Servers Product Family” across the “Educational Sector”. To do so, the user needs to change the measure at the “Educational” data point, as will be shown in the screen shot 2500.
  • FIG. 25 shows the screen shot [0080] 2500 illustrating a step of changing measure for the decomposition tree. To change the measure for the whole decomposition tree, the user right-clicks on (selects) a vacant area (meaning it does not contain any data point icons). In response, the Dtree program 208 displays a menu in a pull-down list 2504. In response to user's right-click on (selection of) the “Measure” in the pull-down list 2504, the Dtree program 208 displays a screen shot 2600 as shown in FIG. 26.
  • FIG. 26 shows the screen shot [0081] 2600 illustrating a step of changing the measure for the decomposition tree. As shown in FIG. 26, the screen shot 2600 contains a measure menu in a pull-down list 2604. In response to user's right-click on (selection of) the “Profit Margin” in the pull-down list 2604, the Dtree program 208 displays the screen shot 2700, to display the “Profit Margin” measures in the data point icons contained in the decomposition tree shown in FIG. 2700.
  • FIG. 27 shows the screen shot [0082] 2700 illustrating the decomposition tree resulting from the user's selection in the screen shot 2600. As shown in the screen shot 2700, a “Profit Margin” measure is displayed within each of the data point icon in the decomposition tree. It can be noticed that the data points at both the “Sector” level and “Family” level are displayed in a descending order according to the “Profit Margin” measure.
  • FIGS. [0083] 28A-B are two flowcharts for forming a decomposition tree in a data navigation process by a user, in accordance with the present invention.
  • FIG. 28A is a flowchart illustrating a process of selecting a root data point for the decomposition tree, in accordance with the present invention. [0084]
  • As shown in FIG. 28A, at [0085] step 2802, the user sends a control request, via the graphic user interface 206, to the Dtree program 208 to create a session.
  • In response, the [0086] Dtree program 208 creates a session and links the session to a multidimensional database. (See FIG. 6).
  • At [0087] step 2804, the user selects a root data point via the graphic user interface 206.
  • At [0088] step 2806, the user selects decomposing parameters (including a dimension, the level within the dimension, and a measure) via the graphic user interface 206.
  • At [0089] step 2808, the Dtree program 208 sets the selected decomposing parameters for breaking down the root data point, in response to the selections in steps 2804 and 2806.
  • At [0090] step 2812, the Dtree program 208 sends a data query to the OLAP database API 210 to retrieve the root data point and the measure value associated with the root data point.
  • At step [0091] 2814, the Dtree program 208 receives the root data point and the associated measure value from the OLAP database API 210.
  • At step [0092] 2816, the Dtree program 208 displays a root data point icon on a computer monitor screen, together with the associated measure value, to represent the root data point.
  • FIG. 28B is a flowchart illustrating a process of breaking down a data point that is being displayed on the decomposition tree, in accordance with the present invention. [0093]
  • As shown in FIG. 28B, at [0094] step 2856, the user selects a data point icon (which represents a corresponding data point) from the decomposition tree that is being displayed on the computer monitor screen by left-clicking or right-clicking on the data point data icon. The user's selection causes the graphic user interface 206 sends a control request to the Dtree program 208.
  • At [0095] step 2858, the Dtree program 208 determines whether the decomposing parameters need to be changed. If the decomposing parameters need to be changed (i.e. the user has selected the data point by right-clicking on the data point icon, as shown in FIG. 19 or 21), the process is led to step 2862; if the decomposing parameters need not to be changed (i.e. the user has selected the data point by left-clicking on (selecting) the data point icon, as shown in FIG. 13 or 14), the process is led to step 2860.
  • At step [0096] 2860, if the decomposing parameters need not to be changed, the Dtree program 208 uses the decomposing parameters that are maintained in and updated by the Dtree program 208. The process is then led to step 2868.
  • At [0097] step 2862, if the decomposing parameters need to be changed, the Dtree program 208 displays parameter menu(s) containing parameter options. (See FIG. 19 or 21).
  • At [0098] step 2864, the user selects decomposing parameter(s) from the parameter menu(s). (See FIG. 19 or 21). The user's selection causes the graphic user interface 206 to send a control request to the Dtree program 208.
  • At [0099] step 2866, the Dtree program 208 sets the changed decomposing parameter(s) for breaking down the selected data point.
  • At step [0100] 2868, the Dtree program 208 sends a data query to the OLAP database API 210 to retrieve the data point(s) under the selected data point and the measure value(s) associated with the data point(s) to be retrieved. In the present invention, the Dtree program 208 requests the OLAP database API 120 to return the data point(s) in a sorted order according to the measure value(s).
  • At step [0101] 2870, the Dtree program 208 receives the data point(s) under the selected data point and the associated measure value(s) from the OLAP database API 210.
  • At [0102] step 2874, the Dtree program 208 displays data point icon(s) on the computer monitor screen, together with the associated measure value(s), to represent the retrieved data point(s). The retrieved data point(s) is/are displayed in an order according to the sorted measure value(s).
  • At step [0103] 2876, the Dtree program 208 displays the relationship(s) between the selected data point and the retrieved data point(s).
  • It should be appreciated that the present invention facilitates a user to explore the values and relationships among the data points in a multidimensional database by displaying these data points in a decomposition tree. The decomposition tree allows a user to easily navigate through N-dimensional data and quickly find the underlying values that are driving the aggregated measure values. With this decomposition tree, a user can navigate vertically through multiple layers into the data points that make up a parent data point and horizontally across multiple dimensions while maintaining a vertical perspective of the navigation paths within the multidimensional database. Specifically, the decomposition tree provides the following features and advantages: [0104]
  • 1. The user may start a decomposition tree at any data point in a multidimensional database. [0105]
  • 2. The user can decompose any data point to any of its descendent level along any dimension. The descendent levels may be skipped. [0106]
  • 3. Once the user has selected the descendents from a dimensional level, those descendents are combined with the positional location from the other dimensions to derive the set of data points, referred to as the decomposition data point set. [0107]
  • 4. Decomposition data points are sorted based on their measure value, and are displayed to the user in the order according to each data point's contribution. [0108]
  • 5. The user can select any data point on the decomposition tree, making the selected data point the root data point of a new decomposition tree. [0109]
  • 6. If a selected decomposition data set has more data points that can be displayed on the computer monitor screen, the decomposition tree automatically places all data points that cannot be displayed into a “group” data point representing the aggregation of all data points in that group. [0110]
  • 7. The user can shift the data points in a “group” data point left or right to reveal the data points in the “group” data point. [0111]
  • 8. Any data point in the decomposition tree can be selected and decomposed by any of its available descendent levels within any dimension in the multidimensional database. [0112]
  • FIG. 29 shows a block diagram of a [0113] computer system 2900, which can be used as a hardware platform for running the program to form the decomposition tree in the present invention.
  • As shown in FIG. 29, the computer system comprises a [0114] processing unit 2902, a memory device 2904, a hard disk 2906, a disk drive interface 2908, a display monitor 2910 (including a computer monitor screen), a display interface 2912, a bus interface 2914, a mouse 2915, a keyboard 2916, and a system bus 2918.
  • Hard disk [0115] 2906 is coupled to disk drive interface 2908; display monitor 2910 is coupled to display interface 2912; and mouse 2915 and keyboard 2916 are coupled to bus interface 2924. Coupled to system bus 2918 are: processing unit 2902, memory device 2904, disk drive interface 2908, display interface 2912, and bus interface 2914.
  • [0116] Memory device 2904 is able to store programs (including data and instructions). Operating together with disk drive interface 2908, hard disk 2906 is also able to store programs. However, memory device 2904 has faster access speed than hard disk 2906, while hard disk 2906 has higher capacity than memory device 2904.
  • Operating together with [0117] display interface 2912, display monitor 2910 is able to provide graphic interface between programs being executed and a user.
  • Operating together with [0118] bus interface 2914, mouse 2915 and keyboard 2916 are able to provide inputs to computer system 2900. 15
  • [0119] Processing unit 2902 has access to memory device 2904 and hard disk 2906, and is able to control operations of computer 2900 by executing programs stored in memory device 2904 or hard disk 2906. Processing unit 2902 is also able to control the transmissions of programs and data between memory device 2904 and hard disk 2906.
  • The program to perform the process shown in FIGS. [0120] 5-27 and 28A-B are stored in memory device 2904 or hard disk 2906, and executed by the processing unit 2902.
  • While the invention has been illustrated and described in detail in the drawing and foregoing description, it should be understood that the invention may be implemented through alternative embodiments within the sprit of the present invention. Thus, the scope of the invention is not intended to be limited to the illustration and description in this specification, but is to be defined by the appended claims. [0121]

Claims (30)

What is claimed is:
1. A method for displaying data points stored in a multidimensional data base, the data points being defined along at least two dimensions, the method comprising the steps of:
extracting a parent data point from the multidimensional database;
displaying the parent data point as a parent data point icon in a data point tree;
selecting the parent data point icon from the data point tree;
extracting, from the multidimensional data base, a plurality of child data points under the parent data points along of one of the at least two dimensions; and
displaying the child data points as respective icons in the data point tree, together with relationships between the parent data point and the child data points.
2. The method of claim 1, the parent and child data points being associated with at least one measure, the method further comprising the step of:
displaying respective values of the measure for the parent data point and the child data point icons.
3. The method of claim 2, further comprising the step of:
displaying a measure contribution for each of the child data points to the measure of the parent data point.
4. The method of claim 2, further comprising the step of:
displaying the child data points in an order according to their respective measure values.
5. A method for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions, the method comprising the steps of:
extracting a parent data point from the multidimensional database;
displaying the parent data point as a parent data icon in a data point tree;
selecting the parent data point icon from the data point tree;
extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions;
grouping a portion of the child data points;
displaying the grouped child data points as a group icon in the data point tree, together with a relationship between the parent data point and the grouped child data points; and
displaying the remaining child data points as individual child data point icons in the data tree, together with the relationships between the parent data point and the remaining child data points.
6. The method of claim 5, further comprising the step of:
splitting one child data point from the grouped child data points by selecting the group icon from the data point tree;
grouping two of the child data points that are individually displayed;
displaying the two grouped child data points as an icon in the data point tree, together with a relationship between the parent data point and the two grouped two child data points; and
displaying the split child data point as an icon in the data point tree, together with a relationship between the parent data point and the split child data point.
7. A method for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions including a first dimension and a second dimension, each of the dimension be divided into at least three levels having a parent level, a first child level and a second child level, the method comprising the steps of:
selecting the first dimension;
a parent data point from the multidimensional database;
displaying the parent data point as an icon in a data point tree;
selecting the parent data point icon from the data point tree;
extracting, from the multidimensional database, a plurality of first level child data points under the parent data point along the first dimension;
displaying the first level child data points as respective icons in the data point tree;
selecting one of the child data icons from the data point tree;
displaying a menu associated with the selected first level child data point, the menu containing the first and second dimensions; selecting the second dimension from the menu;
extracting, from the multidimensional database, a plurality of second level child data points under the selected first level child data point along the second dimension; and
displaying the second level child data points as individual icons in the data point tree, together with the relationships between the selected first level child data point and the second level child data points.
8. A method for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions including a first dimension and a second dimension, and being measured by at least two measures including a first measure and a second measure, the method comprising the steps of:
selecting the first measure
extracting a parent data point from the multidimensional database;
displaying the parent data point as an icon in a data point tree, together with a value of the first measure;
selecting the parent data point icon from the data point tree;
changing the first measure to the second measure;
extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions;
displaying the child data points as respective icons in the data point tree; and
displaying respective values of the second measure together with the parent data point icon and the child data point icons.
9. The method of claim 8, further comprising the step of:
displaying a menu containing the first and second measures in response to the selection of the parent data point icon; and
selecting the second measure from the menu.
10. A method for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions, each of the at least two dimensions being divided into at least three levers having a first, second, and third levels, the method comprising the steps of:
selecting a data point at the first level;
extracting the data point at the first level from the multidimensional database;
displaying the first level data point as an icon in a data point tree;
selecting the first level data point icon from the data point tree;
selecting the third level;
extracting, from the multidimensional database, a plurality of child data points at the third level under the selected first level data point along one of the two least dimensions dimension
displaying the third level child data points as respective icons in the data point tree, together with the relationships between the selected first level data point and the third level data points.
11. An apparatus for displaying data points stored in a multidimensional data base, the data points being defined along at least two dimensions, the apparatus comprising:
means for extracting a parent data point from the multidimensional database;
means for displaying the parent data point as a parent data point icon in a data point tree;
means for selecting the parent data point icon from the data point tree;
means for extracting, from the multidimensional data base, a plurality of child data points under the parent data points along of one of the at least two dimensions; and
means for displaying the child data points as respective icons in the data point tree, together with relationships between the parent data point and the child data points.
12. The apparatus of claim 11, the parent and child data points being associated with at least one measure, the apparatus further comprising:
means for displaying respective values of the measure for the parent data point and the child data point icons.
13. The apparatus of claim 12, further comprising:
means for displaying a measure contribution for each of the child data points to the measure of the parent data point.
14. The apparatus of claim 12, further comprising:
means for displaying the child data points in an order according to their respective measure values.
15. An apparatus for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions, the apparatus comprising:
means for extracting a parent data point from the multidimensional database;
means for displaying the parent data point as a parent data icon in a data point tree;
means for selecting the parent data point icon from the data point tree;
means for extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions;
means for grouping a portion of the child data points;
means for displaying the grouped child data points as a group icon in the data point tree, together with a relationship between the parent data point and the grouped child data points; and
means for displaying the remaining child data points as individual child data point icons in the data tree, together with the relationships between the parent data point and the remaining child data points.
16. The apparatus of claim 15, further comprising:
means for splitting one child data point from the grouped child data points by selecting the group icon from the data point tree;
means for grouping two of the child data points that are individually displayed;
means for displaying the two grouped child data points as an icon in the data point tree, together with a relationship between the parent data point and the two grouped two child data points; and
means for displaying the split child data point as an icon in the data point tree, together with a relationship between the parent data point and the split child data point.
17. An apparatus for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions including a first dimension and a second dimension, each of the dimension be divided into at least three levels having a parent level, a first child level and a second child level, the apparatus comprising:
means for selecting the first dimension;
means for extracting a parent data point from the multidimensional database;
means for displaying the parent data point as an icon in a data point tree;
means for selecting the parent data point icon from the data point tree;
means for extracting, from the multidimensional database, a plurality of first level child data points under the parent data point along the first dimension;
means for displaying the first level child data points as respective icons in the data point tree;
means for selecting one of the child data icons from the data point tree;
means for displaying a menu associated with the selected first level child data point, the menu containing the first and second dimensions;
means for selecting the second dimension from the menu;
means for extracting, from the multidimensional database, a plurality of second level child data points under the selected first level child data point along the second dimension; and
means for displaying the second level child data points as individual icons in the data point tree, together with the relationships between the selected first level child data point and the second level child data points.
18. An apparatus for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions including a first dimension and a second dimension, and being measured by at least two measures including a first measure and a second measure, the apparatus comprising:
means for selecting the first measure;
means for extracting a parent data point from the multidimensional database;
means for displaying the parent data point as an icon in a data point tree, together with a value of the first measure;
means for selecting the parent data point icon from the data point tree;
means for changing the first measure to the second measure;
means for extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions;
means for displaying the child data points as respective icons in the data point tree; and
means for displaying respective values of the second measure together with the parent data point icon and the child data point icons.
19. The apparatus of claim 18, further comprising:
means for displaying a menu containing the first and second measures in response to the selection of the parent data point icon; and
means for selecting the second measure from the menu.
20. An apparatus for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions, each of the at least two dimensions being divided into at least three levers having a first, second, and third levels, the apparatus comprising:
means for selecting a data point at the first level;
means for extracting the data point at the first level from the multidimensional database;
means for displaying the first level data point as an icon in a data point tree;
means for selecting the first level data point icon from the data point tree;
means for selecting the third level;
means for extracting, from the multidimensional database, a plurality of child data points at the third level under the selected first level data point along one of the two least dimensions dimension;
means for displaying the third level child data points as respective icons in the data point tree, together with the relationships between the selected first level data point and the third level data points.
21. A computer-readable medium containing instructions for displaying data points stored in a multidimensional data base, the data points being defined along at least two dimensions, wherein execution of the instructions performs the steps of:
extracting a parent data point from the multidimensional database;
displaying the parent data point as a parent data point icon in a data point tree;
selecting the parent data point icon from the data point tree;
extracting, from the multidimensional data base, a plurality of child data points under the parent data points along of one of the at least two dimensions; and
displaying the child data points as respective icons in the data point tree, together with relationships between the parent data point and the child data points.
22. The computer-readable medium of claim 21, wherein execution of the instructions further performs the step of:
displaying respective values of the measure for the parent data point and the child data point icons.
23. The computer-readable medium of claim 22, wherein execution of the instructions further performs the step of:
displaying a measure contribution for each of the child data points to the measure of the parent data point.
24. The computer-readable medium of claim 22, wherein execution of the instructions further performs the step of:
displaying the child data points in an order according to their respective measure values.
25. A computer readable medium containing instructions for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions, wherein execution of the instructions performs the steps of:
extracting a parent data point from the multidimensional database;
displaying the parent data point as a parent data icon in a data point tree;
selecting the parent data point icon from the data point tree;
extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions;
grouping a portion of the child data points;
displaying the grouped child data points as a group icon in the data point tree, together with a relationship between the parent data point and the grouped child data points; and
displaying the remaining child data points as individual child data point icons in the data tree, together with the relationships between the parent data point and the remaining child data points.
26. The computer-readable medium of claim 25, wherein execution of the instructions further performs the steps of:
splitting one child data point from the grouped child data points by selecting the group icon from the data point tree;
grouping two of the child data points that are individually displayed;
displaying the two grouped child data points as an icon in the data point tree, together with a relationship between the parent data point and the two grouped two child data points; and
displaying the split child data point as an icon in the data point tree, together with a relationship between the parent data point and the split child data point.
27. A computer-readable medium containing instructions for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions including a first dimension and a second dimension, each of the dimension be divided into at least three levels having a parent level, a first child level and a second child level, wherein execution of the instructions performs the steps of:
selecting the first dimension;
extracting a parent data point from the multidimensional database;
displaying the parent data point as an icon in a data point tree;
selecting the parent data point icon from the data point tree;
extracting, from the multidimensional database, a plurality of first level child data points under the parent data point along the first dimension;
displaying the first level child data points as respective icons in the data point tree;
selecting one of the child data icons from the data point tree;
displaying a menu associated with the selected first level child data point, the menu containing the first and second dimensions;
selecting the second dimension from the menu;
extracting, from the multidimensional database, a plurality of second level child data points under the selected first level child data point along the second dimension; and
displaying the second level child data points as individual icons in the data point tree, together with the relationships between the selected first level child data point and the second level child data points.
28. A computer-readable medium containing instruction for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions including a first dimension and a second dimension, and being measured by at least two measures including a first measure and a second measure, wherein execution of the instructions performs the steps of:
selecting the first measure;
extracting a parent data point from the multidimensional database;
displaying the parent data point as an icon in a data point tree, together with a value of the first measure;
selecting the parent data point icon from the data point tree;
changing the first measure to the second measure;
extracting, from the multidimensional database, a plurality of child data points under the parent data point along one of the at least two dimensions;
displaying the child data points as respective icons in the data point tree; and
displaying respective values of the second measure together with the parent data point icon and the child data point icons.
29. The computer-readable medium of claim 28, wherein execution of the instructions further performs the steps of:
displaying a menu containing the first and second measures in response to the selection of the parent data point icon; and
selecting the second measure from the menu.
30. A computer-readable medium containing instructions for displaying data points stored in a multidimensional database, the data points being defined along at least two dimensions, each of the at least two dimensions being divided into at least three levers having a first, second, and third levels, wherein execution of the instructions performs the steps of:
selecting a data point at the first level;
extracting the data point at the first level from the multidimensional database;
displaying the first level data point as an icon in a data point tree;
selecting the first level data point icon from the data point tree;
selecting the third level;
extracting, from the multidimensional database, a plurality of child data points at the third level under the selected first level data point along one of the two least dimensions dimension;
displaying the third level child data points as respective icons in the data point tree, together with the relationships between the selected first level data point and the third level data points.
US09/819,059 1999-05-12 2000-12-22 Method and apparatus for navigating and displaying data points stored in a multidimensional database Abandoned US20020029221A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US09/819,059 US20020029221A1 (en) 1999-05-12 2000-12-22 Method and apparatus for navigating and displaying data points stored in a multidimensional database

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US09/311,207 US6167396A (en) 1999-05-12 1999-05-12 Method and apparatus for navigating and displaying data points stored in a multidimensional database
US09/819,059 US20020029221A1 (en) 1999-05-12 2000-12-22 Method and apparatus for navigating and displaying data points stored in a multidimensional database

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/311,207 Continuation US6167396A (en) 1999-05-12 1999-05-12 Method and apparatus for navigating and displaying data points stored in a multidimensional database

Publications (1)

Publication Number Publication Date
US20020029221A1 true US20020029221A1 (en) 2002-03-07

Family

ID=23205879

Family Applications (2)

Application Number Title Priority Date Filing Date
US09/311,207 Expired - Lifetime US6167396A (en) 1999-05-12 1999-05-12 Method and apparatus for navigating and displaying data points stored in a multidimensional database
US09/819,059 Abandoned US20020029221A1 (en) 1999-05-12 2000-12-22 Method and apparatus for navigating and displaying data points stored in a multidimensional database

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09/311,207 Expired - Lifetime US6167396A (en) 1999-05-12 1999-05-12 Method and apparatus for navigating and displaying data points stored in a multidimensional database

Country Status (4)

Country Link
US (2) US6167396A (en)
EP (1) EP1190348A4 (en)
CA (1) CA2377353C (en)
WO (1) WO2000068842A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090177988A1 (en) * 2008-01-08 2009-07-09 International Business Machines Corporation Generating data queries using a graphical selection tree
US20090210384A1 (en) * 2008-02-19 2009-08-20 International Business Machines Corporation Visualization of code units across disparate systems
KR101169096B1 (en) 2005-01-24 2012-07-26 마이크로소프트 코포레이션 Diagrammatic access and arrangement of data

Families Citing this family (60)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7277931B1 (en) 1999-06-08 2007-10-02 International Business Machines Corporation Representing, configuring, administering, monitoring, and/or modeling connections using catalogs and matrixes
US6647394B1 (en) * 1999-06-08 2003-11-11 International Business Machines Corporation Doing business employing linked trees having retrievable embedded information
US6424972B1 (en) * 1999-06-22 2002-07-23 Microsoft Corporation Floating point conversion for records of multidimensional database
US6385604B1 (en) 1999-08-04 2002-05-07 Hyperroll, Israel Limited Relational database management system having integrated non-relational multi-dimensional data store of aggregated data elements
US6408292B1 (en) 1999-08-04 2002-06-18 Hyperroll, Israel, Ltd. Method of and system for managing multi-dimensional databases using modular-arithmetic based address data mapping processes on integer-encoded business dimensions
US7639256B1 (en) * 1999-10-08 2009-12-29 I2 Technologies Us, Inc. System and method for displaying graphs
FR2806183B1 (en) * 1999-12-01 2006-09-01 Cartesis S A DEVICE AND METHOD FOR INSTANT CONSOLIDATION, ENRICHMENT AND "REPORTING" OR BACKGROUND OF INFORMATION IN A MULTIDIMENSIONAL DATABASE
US6418427B1 (en) * 1999-12-30 2002-07-09 Decode Genetics Ehf Online modifications of dimension structures in multidimensional processing
US20020029207A1 (en) 2000-02-28 2002-03-07 Hyperroll, Inc. Data aggregation server for managing a multi-dimensional database and database management system having data aggregation server integrated therein
US7269786B1 (en) 2000-05-04 2007-09-11 International Business Machines Corporation Navigating an index to access a subject multi-dimensional database
US6915289B1 (en) 2000-05-04 2005-07-05 International Business Machines Corporation Using an index to access a subject multi-dimensional database
US6567804B1 (en) * 2000-06-27 2003-05-20 Ncr Corporation Shared computation of user-defined metrics in an on-line analytic processing system
JP2002024286A (en) * 2000-06-30 2002-01-25 Hitachi Ltd Method and device for data display and recording medium with recorded processing program thereof
US7818286B2 (en) * 2001-01-22 2010-10-19 Sas Institute Inc. Computer-implemented dimension engine
KR100375831B1 (en) * 2001-03-14 2003-03-15 한국전자통신연구원 Fast texture - based image database Browsing and Sorting Method
US20090254801A1 (en) * 2001-05-14 2009-10-08 The Mathworks, Inc. Model navigation
US20020184043A1 (en) * 2001-06-04 2002-12-05 Egidio Lavorgna Systems and methods for managing business metrics
US7720842B2 (en) * 2001-07-16 2010-05-18 Informatica Corporation Value-chained queries in analytic applications
US7720795B2 (en) 2002-02-05 2010-05-18 General Electric Company Digital cockpit
US7328215B2 (en) * 2002-03-01 2008-02-05 Sap Ag Hybrid and dynamic representation of data structures
US6839719B2 (en) * 2002-05-14 2005-01-04 Time Industrial, Inc. Systems and methods for representing and editing multi-dimensional data
US20040006556A1 (en) * 2002-06-18 2004-01-08 Daniel Kwoh Visual presentation of information in multiple dimensions
US10176476B2 (en) 2005-10-06 2019-01-08 Mastercard Mobile Transactions Solutions, Inc. Secure ecosystem infrastructure enabling multiple types of electronic wallets in an ecosystem of issuers, service providers, and acquires of instruments
US7703028B2 (en) * 2002-12-12 2010-04-20 International Business Machines Corporation Modifying the graphical display of data entities and relational database structures
US7467125B2 (en) * 2002-12-12 2008-12-16 International Business Machines Corporation Methods to manage the display of data entities and relational database structures
US7472127B2 (en) * 2002-12-18 2008-12-30 International Business Machines Corporation Methods to identify related data in a multidimensional database
US20040181518A1 (en) * 2003-03-14 2004-09-16 Mayo Bryan Edward System and method for an OLAP engine having dynamic disaggregation
GB2402587B (en) * 2003-06-02 2006-09-13 Yisia Young Suk Lee A hand held display device and method
GB2402506A (en) * 2003-06-02 2004-12-08 Yisia Young Suk Lee Navigation of hierarchical data
US20050182641A1 (en) * 2003-09-16 2005-08-18 David Ing Collaborative information system for real estate, building design, construction and facility management and similar industries
GB2407746B (en) * 2003-10-28 2008-01-23 Yisia Young Suk Lee Method and apparatus for retrieving information from an informtion source
US7653637B2 (en) * 2004-10-20 2010-01-26 Microsoft Corporation Indirect persistent storage for plugin in container
GB2420429A (en) * 2004-11-22 2006-05-24 Yisia Young Suk Lee Method of navigating a hierarchical structure
US7698349B2 (en) * 2005-05-25 2010-04-13 Microsoft Corporation Dimension member sliding in online analytical processing
US10032160B2 (en) 2005-10-06 2018-07-24 Mastercard Mobile Transactions Solutions, Inc. Isolating distinct service provider widgets within a wallet container
EP2667344A3 (en) 2005-10-06 2014-08-27 C-Sam, Inc. Transactional services
US9336267B2 (en) * 2005-10-11 2016-05-10 Heng Toon Ting Method and system for navigation and visualization of data in relational and/or multidimensional databases
US8762193B2 (en) * 2005-11-11 2014-06-24 Accenture Global Services Limited Identifying target customers for campaigns to increase average revenue per user
US20070118444A1 (en) * 2005-11-11 2007-05-24 Matteo Maga Analytic tool for evaluating average revenue per user for multiple revenue streams
US7917383B2 (en) * 2005-11-11 2011-03-29 Accenture Global Services Limited Method and system for boosting the average revenue per user of products or services
US8428997B2 (en) * 2005-11-21 2013-04-23 Accenture Global Services Limited Customer profitability and value analysis system
US9715710B2 (en) * 2007-03-30 2017-07-25 International Business Machines Corporation Method and system for forecasting using an online analytical processing database
US20090158218A1 (en) * 2007-05-04 2009-06-18 Lockheed Martin Corporation Structured model navigator
KR100934270B1 (en) * 2007-09-27 2009-12-28 주식회사 아이큐엠씨 Method and system for generating reports using object-oriented programs
US8345012B2 (en) * 2008-10-02 2013-01-01 Utc Fire & Security Americas Corporation, Inc. Method and interface device for operating a security system
US8677279B2 (en) * 2009-05-06 2014-03-18 Business Objects Software Limited Visual hierarchy explorer
US8161413B2 (en) * 2009-09-01 2012-04-17 Oracle International Corporation Method and system for providing user interface representing organization hierarchy
JP5910502B2 (en) * 2010-10-20 2016-04-27 日本電気株式会社 Data processing terminal, data search method and control program
EP2767110A4 (en) 2011-10-12 2015-01-28 C Sam Inc A multi-tiered secure mobile transactions enabling platform
US8970595B2 (en) 2011-10-26 2015-03-03 Microsoft Corporation Display and interaction with multidimensional data
FR2995421B1 (en) * 2012-09-11 2015-11-13 R2C System NAVIGATION METHOD IN A NAVIGATION TREE CREATED FROM DATA RELATING TO ELEMENTS
US9218335B2 (en) * 2012-10-10 2015-12-22 Verisign, Inc. Automated language detection for domain names
US9239887B2 (en) * 2012-12-18 2016-01-19 Cisco Technology, Inc. Automatic correlation of dynamic system events within computing devices
US20140229267A1 (en) * 2013-02-11 2014-08-14 Emailvision Holdings Limited Data visualisation tool
US9465523B2 (en) * 2013-06-27 2016-10-11 Sap Se Visual exploration of multidimensional data
CA2945915A1 (en) 2015-10-23 2017-04-23 Teletracking Technologies, Inc. Real time data tracking, analytics data warehousing, and front end reporting system
US11853690B1 (en) 2016-05-31 2023-12-26 The Mathworks, Inc. Systems and methods for highlighting graphical models
US11526532B2 (en) * 2017-09-19 2022-12-13 Sap Se Dynamic data viewer
US11200223B2 (en) * 2018-10-18 2021-12-14 Oracle International Corporation System and method for dependency analysis in a multidimensional database environment
US20200272284A1 (en) * 2019-02-27 2020-08-27 Dell Products, L.P. Grafting hierarchical trees in a graphical user interface (gui)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5359724A (en) * 1992-03-30 1994-10-25 Arbor Software Corporation Method and apparatus for storing and retrieving multi-dimensional data in computer memory
JPH06176081A (en) * 1992-12-02 1994-06-24 Hitachi Ltd Hierarchical structure browsing method and device
US5781906A (en) * 1996-06-06 1998-07-14 International Business Machines Corporation System and method for construction of a data structure for indexing multidimensional objects
US5767854A (en) * 1996-09-27 1998-06-16 Anwar; Mohammed S. Multidimensional data display and manipulation system and methods for using same
US5978796A (en) * 1997-06-30 1999-11-02 International Business Machines Corporation Accessing multi-dimensional data by mapping dense data blocks to rows in a relational database

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101169096B1 (en) 2005-01-24 2012-07-26 마이크로소프트 코포레이션 Diagrammatic access and arrangement of data
US20090177988A1 (en) * 2008-01-08 2009-07-09 International Business Machines Corporation Generating data queries using a graphical selection tree
US9563657B2 (en) * 2008-01-08 2017-02-07 International Business Machines Corporation Generating data queries using a graphical selection tree
US20090210384A1 (en) * 2008-02-19 2009-08-20 International Business Machines Corporation Visualization of code units across disparate systems
US9141377B2 (en) * 2008-02-19 2015-09-22 International Business Machines Corporation Visualization of code units across disparate systems

Also Published As

Publication number Publication date
EP1190348A4 (en) 2004-08-18
WO2000068842A9 (en) 2001-11-22
CA2377353C (en) 2011-10-04
EP1190348A1 (en) 2002-03-27
CA2377353A1 (en) 2000-11-16
WO2000068842A1 (en) 2000-11-16
US6167396A (en) 2000-12-26

Similar Documents

Publication Publication Date Title
US6167396A (en) Method and apparatus for navigating and displaying data points stored in a multidimensional database
US11068122B2 (en) Methods and systems for building a view of a dataset incrementally according to characteristics of user-selected data fields
Smith et al. Visualization components for persistent conversations
EP1005681B1 (en) Browser for hierarchical structures
US8161407B2 (en) Multiple sorting of columns in a displayed table in a user interactive computer display interface through sequential radial menus
US20110131101A1 (en) Display and search interface for product database
RU2402060C2 (en) Data access and data organisation through diagrams
US8131821B2 (en) System for publishing, organizing, accessing and distributing information in a computer network
US9336267B2 (en) Method and system for navigation and visualization of data in relational and/or multidimensional databases
US6169985B1 (en) Method and apparatus for determining a set of database entries
US8161087B2 (en) Displaying and manipulating virtual objects on virtual surfaces
US20130232429A1 (en) Systems and methods for implementing multi-application tabs and tab sets
US20050289158A1 (en) Identifier attributes for product data stored in an electronic database
EP1836610A2 (en) Automated default dimension selection within a multidimensional enterprise software system
WO2006059243A2 (en) Aggregatable dimension information fn multidimensional enterprise software system
CA2371724A1 (en) System and method for defining prompts using declarative principles
US20080104498A1 (en) Dynamically Merging Columns Within a Table
US20040210468A1 (en) System and method for providing a territory management tool
WO2002027508A1 (en) Method and software for graphical representation of qualitative search results
JP5496965B2 (en) A system for publishing, organizing, accessing and distributing information on a computer network
Densham et al. Supporting visual interactive locational analysis using multiple abstracted topological structures
AU3845599A (en) A method for comparative visual rendering of data
Mohammadi-Aragh et al. Visualizing and Interacting with Multi-Tree Hierarchical Data
Goldberg et al. From Research to Product: Integrating Treemaps into Enterprise Software

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034766/0509

Effective date: 20141014