KR101929794B1 - Apparatus and method for providing integrated graph - Google Patents

Abstract

The present invention relates to an integrated graph providing apparatus which can provide an overlapped or integrated graph with a drag-and-drop scheme. More specifically, the integrated graph providing apparatus comprises: a user interface for determining as an integrated graph request when at least one graph is dragged and dropped on a first graph; and a processor for comparing dimension information and unit information of graphs requested to be an integrated graph so as to provide an overlapped or integrated graph.

Description

[0001] Apparatus and method for providing integrated graph [

 To a graph integrated device capable of providing graphs superimposed or merged in a drag-and-drop manner.

More specifically, when at least one graph is dragged and dropped on the first graph, the UI is determined as a graph integration request, and the dimension information and the unit information of the graph integration requested graphs are compared to provide a graph superimposed or merged A processor, and a processor.

A variety of information is formed by human activities, either socially or personally. At this time, various information can be information related to text, image, numerical value, and the like.

On the other hand, users are applying research and development, decision making, etc. by utilizing statistics of such information. Therefore, the collection, accumulation, retrieval and use of information depending on advanced science and technology is one of indispensable acts in human intellectual activities in information society.

To this end, various resource management devices are disclosed. Korean Patent No. 10-0535373 is a patent document on such resource management. However, such prior art technology merely provides and manages information including keywords through general keyword search, and there is a difficulty in searching for the numerical information, grasping the relationship, and utilizing it.

Accordingly, the applicant of the present invention intends to provide a graph integrating and providing apparatus that can provide information related to numerical values in a graph by constructing a data structure using numerical information, and can integrally provide the relationship between the provided graphs by a simple drag-and-drop operation .

1. Korean Registered Patent No. 10-0535373 (Announcement of Dec. 2, 2005)

It is an object of the present invention to provide an apparatus and a method for providing an integrated graph capable of providing a superimposed or merged graph by dragging and dropping at least one other graph on a specific graph.

According to another aspect of the present invention, there is provided an apparatus for providing a graph integrated according to an embodiment of the present invention. The apparatus includes a user interface for determining that a graph integration request is requested when at least one second graph is dragged and dropped on a first graph, And a processor for comparing the dimension information and the unit information of the integration requested graphs to provide a superimposed or merged graph.

In addition, the processor may compare the dimension information of the graphs requested to be integrated with the graphs, and determine whether the metrics match with a common dimension if there is a common dimension.

At this time, when one metric type is matched, one of the merging and overlapping user selection is input through the user interface, and a superimposed or merged graph corresponding to the user selection is provided, and a superimposed graph based on a common dimension can do.

In addition, the processor may convert the first graph into a bar graph and the second graph into a line graph when the overlapped graph is provided.

The apparatus may further include a DB for storing cube data matched with the graph and metadata for interpreting the cube data.

The cube data is a set column structure including a time dimension in which time information is recorded, a space dimension in which spatial information is recorded, a user dimension for recording information other than time and space, and a numerical value, .

Wherein the processor is further configured to compare the first graph and the numerical value of the cube data matched to the at least one second graph based on a common dimension of the cube data matched to the first graph and the at least one second graph, May be merged or overlapped.

The processor may also provide a graph superimposed or merged so that the metric units of the metric type are the same if the metrics of the common dimension match.

If the user interface is dragged on a specific graph, it is determined that the request is a graph separation request, and the processor copies the common dimension among the data of the specific graph requested for graph separation, , And then provide a separating graph merging with the highest common hierarchical value of the non-common dimension and the copied common dimension.

Meanwhile, a method of providing a graph integration according to an exemplary embodiment of the present invention includes: determining that at least one second graph is dragged and dropped on a first graph as a graph integration request; And comparing the information to provide a superimposed or merged graph.

The step of providing the overlapped or merged graph may include the steps of: (a) comparing the dimension information of the graphs requested to be integrated with the graphs to determine whether there is a common metric metric if a common dimension exists; (b) (C) providing a superimposed graph based on a common dimension in the case of metric unmatching; and (c) providing a superimposed or merged graph corresponding to the user selection by receiving a user selection of merging and superimposing through the user interface .

In addition, when providing a superimposed graph, the first graph may be converted into a bar graph, and the second graph may be converted into a curve graph to provide superposition.

In addition, the plurality of graphs displayed on the screen may be matched with previously stored cube data and meta data for analyzing the cube data. Wherein the cube data is a set row structure including a time dimension in which time information is recorded, a space dimension in which spatial information is recorded, a user dimension for recording information other than time and space, and a numerical value, The metadata may include unit information.

Here, the step of providing the superimposed or merged graph may include: comparing the first graph and the at least one second graph based on the common dimension of the cube data matched with the first graph and the at least one second graph, 2 The numerical values of the cube data matched to the graph can be merged or superimposed.

In the step (c), when the metrics of the common dimension are matched, the graphs superimposed or merged so as to have the same unit of metrology can be provided.

If a graph is dragged on a specific graph, it is determined that the request is a graph separation request. Then, the common dimension among the data of the specific graph requested for graph separation is copied, the non-common dimension hierarchy is sorted, And may provide a separation graph merging with the highest common layer value and the copied common dimension.

As described above, according to the present invention, a cube data structure of a set column unit is used to process cube data of integrated graphs, so that the merging and overlapping graphs in drag and drop So that the user can visually check whether the integration can be performed and the integrated graph with a simple operation.

In addition, a separating graph can be provided according to a hierarchy of common dimension and non-common dimension during a drag operation on a specific graph.

FIG. 1 is a block diagram showing a schematic configuration of an apparatus for providing a graph integrated according to an embodiment of the present invention.
2 is a diagram for explaining the structure of cube data according to an embodiment of the present invention.
3 is a diagram illustrating cube data according to various embodiments of the present invention.
4 is a view for explaining metadata according to an embodiment of the present invention.
5 to 7 are views for explaining graph superposition according to an embodiment of the present invention.
8 to 10 are views for explaining graph merging according to an embodiment of the present invention.
11 to 13 are diagrams for explaining graph separation according to an embodiment of the present invention.
14 is a flowchart illustrating a method of providing a graph integration according to an embodiment of the present invention.

The terms and words used in the present specification and claims should not be construed as limited to ordinary or dictionary terms and the inventor may properly define the concept of the term in order to best describe its invention It should be construed as meaning and concept consistent with the technical idea of the present invention.

Therefore, the embodiments described in the present specification and the configurations shown in the drawings are merely the most preferred embodiments of the present invention and are not intended to represent all of the technical ideas of the present invention. Therefore, various equivalents It should be understood that water and variations may be present.

Before describing the present invention with reference to the accompanying drawings, it should be noted that the present invention is not described or specifically described with respect to a known configuration that can be easily added by a person skilled in the art, Let the sound be revealed.

FIG. 1 is a block diagram showing a schematic configuration of an apparatus for providing a graph integrated according to an embodiment of the present invention. The apparatus for providing a graph integrated according to an exemplary embodiment of the present invention may include a user interface 100, a processor 200, and a DB 300.

The user interface 100 may provide a screen according to the control of the processor 200, and may receive a user input. For example, the processor 200 may provide graphs corresponding to a user search through a screen of the user interface 100, and the user interface 100 may receive specific commands from a user.

In one embodiment of the present invention, the user interface 100 may determine that a graph aggregation request is made when at least one second graph on the first graph is dragged and dropped. Here, the graph integration can be defined as generating at least two graphs by overlapping or merging.

When the processor 200 receives the graph integration request from the user interface 100, the processor 200 may compare the dimension information and the unit information of the graphs to provide a superimposed or merged graph.

To this end, the graph according to an embodiment of the present invention includes a time dimension in which time information is recorded, a space dimension in which spatial information is recorded, a user dimension in which information other than time and space is recorded, And the metadata for analyzing the cube data. The cube data can be generated by the cube data having the set row structure including the value generated by the cube data.

At this time, the cube data and meta data can be stored in the DB 300, and can be extracted by the processor 200 according to a user request to generate a graph.

Prior to the description of the graph integration (overlapping and merging of graphs) of the present invention, the structure of the cube data and the metadata for the graph integration can be described with reference to FIG. 2 to FIG.

2 is a diagram for explaining the structure of cube data according to an embodiment of the present invention. 2, the cube data includes a time dimension (tn) for recording time information, a space dimension (ln) for recording spatial information, a user dimension (Un) for recording information other than time information and spatial information, and a value row. At this time, the cube data may include a dimension value for at least one of a time dimension (tn), a spatial dimension (ln), and a user dimension (Un) and a numerical value therefor.

In addition, the time dimension, the space dimension, and the user dimension of the cube data are divided into a plurality of dimensions (hierarchical level: n), and a plurality of dimensions are hierarchically divided into at least one sub- Each dimension may have a hierarchical name according to the hierarchical location.

For example, referring to FIG. 2, each dimension may be divided into seven layers.

The time dimension tn can be divided into seven layers having hierarchical names t0 to t6. Here, t6 can be defined to mean the sixth layer of the time dimension. In addition, each layer of t0 to t6 can be given the following hierarchical column name. That is, t0 is the highest concept and t6 is the lowest concept.

t0 t1 t2 t3 t4 t5 t6 century year quarter month Work time Custom

In addition, the spatial dimension ln can be divided into seven layers having layer names l0 to l6. Here, l2 can be defined to mean the second layer of the time dimension. Each hierarchy of 10 to 16 can be given the following hierarchical column name. That is, l0 is the highest concept, and l6 is the lowest concept.

l0 l1 l2 l3 l4 l5 l6 continent country Metropolitan city Municipality Euphee-dong Custom Custom

In addition, the user dimension Un may be divided into seven layers having hierarchical names U0 to U6. Here, U1 can be defined to mean the first layer of the time dimension. On the other hand, the user dimension Un can be registered by the user at the time of inputting data through the data input unit 200 without giving the hierarchical column name as a basis. In addition, when collected through the data collection unit 300, the data structure unit 100 can apply the user-level data included in the collected numerical information. On the other hand, hierarchical column names can be stored in metadata.

At this time, the column names of the cube data are defined in the order of the hierarchical name, and the cube data is stored in the meta data, and the cube data is retrieved using the query or the like to retrieve the cube data matched to the meta data. There is no need to rewrite it.

For example, if the numerical information relates to the number of living things, it can be given as follows.

U0 U1 U2 U3 U4 U5 U6 system door River neck and genus Bell

Or, if it relates to prices, it may be given as follows.

U0 U1 U2 U3 U4 U5 U6 Category Category Product category product name - - -

On the other hand, the cube data has a set row structure, so that the cube data can be expanded in the column direction. At this time, the cube data may be composed of a plurality of set columns, and a plurality of set columns may form one file. That is, the cube data may be formed on a file-by-file basis.

3 is a diagram illustrating cube data according to an exemplary embodiment of the present invention. Referring to FIG. 3, the cube data is generated from numerical information on the number of male and female population (file) by country in July 2015, and the time dimension is t2, t3, the space dimension is 10.12, A hierarchical value for the layers of U1 and a numerical value for each set column 10 may include a population number. In this case, the corresponding cube data may have a column name of 't2, t3, l0, l2, U0, U1', and such column name information may be stored in the corresponding metadata.

FIG. 4 is a diagram illustrating metadata according to an embodiment of the present invention. FIG. 4 is a structure of metadata according to an exemplary embodiment of the present invention. 300, and the metadata may be separately stored and managed with the cube data.

The metadata may include file index information, a column name, analysis information, and management information corresponding to the corresponding cube data.

Here, the file index information may be an index value for extracting cube data stored in units of files, a file name (graph name), and the like. The column name is defined in the hierarchical name order of each dimension included in the corresponding cube data. If the cube data includes the time dimension t1, the user dimension U0, and the numerical value, The column name can be 't1, U0'.

The analysis information is for analyzing the relationship between hierarchical and numerical values included in the cube data and includes at least one of unit information for representing a numerical value included in the inputted numerical information, graph template information, hierarchical column name, and language can do.

Here, the unit information may be classified into a metric type, a reduction unit, and a symbol. A metric can be a numeric value unit such as a weight, a length, a number, a currency unit, etc., and can also include a detailed unit. Here, the detail unit may be meters (m), centimeters (cm), or the like when the length is indicated.

In addition, the reduction unit is a unit for expressing a reduction in a unit of a numerical value. For example, if the numerical value is 1, it can be interpreted as a unit of 10,000. Also, the abbreviation unit may be used to represent a multiplier. For example, in the case of 10 ⁶ representations, the reduction unit can be 6. On the other hand, symbols can be applied when using numerical values such as multiplier, root, and pie.

In addition, the graph template information may be graph template information capable of displaying numerical information according to whether special use of numerical information is available or not. In the case of special use, only the preset number is described, and the analytical method is stored separately, thereby reducing the amount of metadata data.

Also, the language may be a language name representing each layer value of the cube data.

On the other hand, the management information is additional information for data management, and may include the owner of the numerical information, the source (source), the frequency of use of the corresponding cube data, the update period, and the free /

The DB 300 may separately store the cube data, the meta data, and the graph template. The processor 200 extracts metadata matched with the user search keyword, extracts the cube data and the graph template matched to the extracted metadata, and provides graphs according to the search through the user interface 100.

At this time, the processor 200 may provide an integrated graph by determining whether or not the graphs requested to be integrated by the user among the provided graphs can be integrated. Meanwhile, the graph superposition function as shown in FIG. 5 and the graph merge function as shown in FIG. 6 can be described through the structure of the cube data described above.

5 to 7 are views for explaining graph superposition according to an embodiment of the present invention. Referring to FIG. 5, a requested graph such as a user search is provided through a screen of the user interface 100. Here, a first display window 21 providing a requested graph, a second display window 22 providing a graph selected by the user can be displayed, and when a cursor is positioned on a specific graph of the first display window 21 , And a notification window 23 to inform the integrated graph function. On the other hand, this is an example for explanation, and can be variously changed by the designer.

Here, the graph provided in the first display window 21 may be the first graph 30, and the graph drawn and dropped may be the second graph 40. [ At this time, one or more second graphs 40 may be selected.

6, when the user drags and drops the second graph 40 onto the first graph 30, the processor 200 determines the metadata for the first graph 30 and the second graph 40, And extracts the corresponding cube data using the metadata.

The processor 200 compares the dimension information of the first graph 30 cube data with the dimension information of the second graph 40 cube data to determine whether the common dimension metric matches if there is a common dimension.

At this time, if the metrics of the common dimension coincide with each other, the processor 200 may receive the user selection of merging and superimposing through the user interface 100 to provide a superimposed or merged graph corresponding to the user selection. On the other hand, the processor 200 may provide a superimposed graph based on a common dimension in metric inconsistencies.

5 and 6, it can be seen that the first graph 30 and the second graph 40 include time dimensions, but the unit information of the numerical values generated by the time dimension are different from each other. Accordingly, the processor 200 may provide a superimposed graph as shown in FIG. 7 when receiving a graph integration request as in the embodiment of FIG.

At this time, the processor 200 may convert the first graph 30 into a bar graph and convert the second graph 40 into a bar graph when it is determined that the superimposed graph is a superimposed graph. In addition, the processor 200 calculates a first graph 30 and a second graph 30 based on a common dimension, i.e., a time dimension (year), of the cube data matched to the first graph 30 and the second graph 40 40 of the cube data superimposed on the numerical value of the cube data.

That is, the superimposed graph 50 may include a first graph 30 in the form of a bar graph and a second graph 41 in the form of a curve graph. Accordingly, the first graph 30 and the second graph 40, which form different values for each year, can be grasped visually at a glance.

Meanwhile, in the present embodiment, different graph templates are applied so that the numerical values of the first graph and the second graph can be distinguished and easily grasped. However, this is for the understanding of the explanation, and the graph type is not limited, You can also apply a possible graph template.

Meanwhile, the processor 200 may determine whether a metric type matches a common dimension if a common dimension exists, and compare the subdivision of a metric type when the metric type matches. At this time, if the sub-units do not match, the processor 200 converts the sub-units to the same unit by unit conversion and then applies the numerical values of the first graph cube data and the second graph cube data based on the common dimension, Can be provided. Alternatively, it may be applied as nested data according to user selection.

8 to 10 are views for explaining graph merging according to an embodiment of the present invention. The second graph 70 selected from the graph displayed on the second display window 21 is dragged and dropped to the upper portion of the first graph 60 provided on the second display window 22 as an example.

Here, the first graph 60 and the second graph 70 are graphical representations in which the spatial dimension (country, city, group) and the time dimension (year) are common dimensions and the numerical value It can be confirmed that the unit information (the number of persons) is equal to each other.

At this time, the processor 200 can adjust the interval by aligning dimension values of the common dimension in ascending or descending order. That is, the intervals of the first graph cube data and the second graph cube data can be adjusted by combining spatial dimensions. In addition, the time dimension of the first graph cube data and the second graph cube data may be combined to adjust the interval.

Accordingly, the processor 200 may provide a merge graph as shown in FIG. 10 when receiving a graph integration request as in the embodiment of FIG. Alternatively, one of superimposition and merging may be selected from the user through the user interface 100, and a graph according to the user selection may be generated.

At this time, the processor 200 may integrate the numerical values based on the common dimension of the cube data into the graph templates defined in the meta graph when the merge graph is generated. At this time, if the graph templates defined in the first graph metagraph and the first graph metagraph are different from each other, the same can be applied to one of the graph templates.

Referring to Figure 10, the processor 200 determines the spatial dimension (country, city, group) and the time dimension, which are common dimensions of the cube data matched to the first graph 60 and the second graph 70, And a merge graph 80 in which the numerical values of the cube data matched to the first graph 60 and the second graph 70 are merged is provided.

Accordingly, the user can visually grasp the first graph 30 and the second graph 40 forming the numerical values of the number of the population (same unit) in 2009 and 2016 by the Gangwon-do city group at a glance.

Meanwhile, the processor 200 temporarily generates and provides an integrated graph between the graphs when the graph integration request is generated according to the drag and drop, and can download the graph if the user desires. In this case, the integrated metadata and the integrated cube data for the integrated graph can be separately generated and stored in the DB 300, but it is possible to provide the integrated graph (overlapping and merging) separately from the original as shown in FIGS. 7 and 10 have. That is, the integrated graph can be volatile data that is deleted when there is no user request.

11 to 13 are diagrams for explaining graph separation according to an embodiment of the present invention. FIG. 11 shows the graph separation recognition according to the drag operation of the user, FIG. 12 shows the data structure for explaining the graph separation, and FIG. 13 shows the graph separated by FIG.

Referring to FIG. 11, the user interface 100 may provide a pop-up message or the like indicating that graph separation is possible when a cursor is positioned on a specific graph. If the user interface 100 is dragged by a user on a specific graph, the user interface 100 can determine that the request is a graph separation request.

The processor 200 copies the common dimension among the data of the specific graph requested to be separated by the drag recognition, separates the hierarchy of the non-common dimension, arranges it in the preset order, A separation graph merged with a common dimension can be provided.

Referring to FIG. 12, a time dimension and a space dimension, which are common dimensions, and a user dimension, which is a non-common dimension, can be distinguished from data 92 of a specific graph requested for graph segmentation. At this time, the user dimension can be divided into the male layer and the female layer, and can be sorted in the order of the default. For example, in the case of an alphabetical order, it can be arranged in the order of male-female, and the highest hierarchical level can be a male hierarchy.

The processor 200 may copy the common dimension 95 and merge it with a separate layer of the non-common dimension to produce merged split graph data 93,94. At this time, only the separation graph data 93 for the uppermost layer may be generated, and the separation graph data 94 for the remaining layers (the excitation layer in FIG. 13) may be generated according to the user's request.

The processor 200 may provide the separated graph as shown in FIG. 13 on the screen by using the separation graph data 93 for the highest layer among the separation graph data.

Accordingly, the user can visually confirm the separation graph through a simple operation of dragging.

14 is a flowchart illustrating a method of providing a graph integration according to an embodiment of the present invention. 14, when at least one second graph is dragged and dropped (1100) on the upper part of the first graph through the user interface 100 (1100), the graph integration method according to an exemplary embodiment of the present invention It can be judged as a request.

Next, the file information and the unit information (metric type / detail unit information extraction) are extracted from the first graph and meta data of the at least one graph, and the matched cube data is compared to determine whether there is a common dimension (1200).

On the other hand, if there is no common dimension, integrated graph can not be provided. Therefore, it can be notified through a pop-up or the like.

Next, if there is a common dimension, the dimension of the common dimension included in the first graph cube data and the second graph cube data may be aligned to adjust the interval (1300).

Next, the metrics of the first graph cube data and the second graph cube data may be the same, and the first graph metadata and the second graph meta data may be compared (1400).

At this time, when the metrology types are different, a superimposition graph may be provided by superimposing on a common dimension (S1500). Here, when the overlapped graph is provided, the first graph may be converted into a bar graph, and the second graph may be converted into a line graph to provide overlapping.

Next, if the metrics are the same, it can be determined whether the metric units are the same (1600). At this time, if the metric type units are the same, the merged and overlapped selection is received through the user interface 100, and the merged or overlapped integrated graph may be provided according to the received user selection.

On the other hand, if the metric units are not the same, the metric unit conversion process can be applied in the same unit of 1 (1800).

At this time, the merged graph can be provided by merging numerical values based on the common dimension. Accordingly, the user can visually confirm whether or not the integration of at least two graphs is integrated and the integrated graph integrated when integration is possible by a simple operation of drag-and-drop.

On the other hand, if the drag is recognized at the upper part of the specific graph (1800), it can be judged by the graph separation. At this time, a separation graph can be generated depending on whether the common dimension or the non-common dimension exists.

If there is a common dimension (1900), the hierarchy of the non-common dimension can be separated based on the common dimension (2000). Specifically, a common dimension among data of a specific graph requested to be separated by the drag recognition is copied, and the non-common dimension hierarchy is separated and sorted in the preset order. Then, the highest hierarchical value of the non- (2100). ≪ / RTI >

At this time, separation graphs for the remaining layers other than the top separation graph provided on the screen may be generated and provided according to the user's request.

On the other hand, if the drag is recognized at the upper part of the specific graph (1800), it can be judged by the graph separation. At this time, a separation graph can be generated depending on whether the common dimension or the non-common dimension exists.

If there is a common dimension (1900), the hierarchy of the non-common dimension can be separated based on the common dimension (2000). Specifically, a common dimension among data of a specific graph requested to be separated by the drag recognition is copied, and the non-common dimension hierarchy is separated and sorted in the preset order. Then, the highest hierarchical value of the non- (2100). ≪ / RTI >

At this time, separation graphs for the remaining layers other than the top separation graph provided on the screen may be generated and provided according to the user's request.

1 to 14 are merely the main points of the present invention. As various designs can be made within the technical scope of the present invention, the present invention is limited to the configurations of Figs. 1 to 14 It is self-evident.

User Interface: 100 Processor: 200
DB: 300

Claims (12)

A user interface for judging a graph integration request when at least one second graph is dragged and dropped on a first graph; And
And a processor for comparing the dimension information and the unit information of the graph integration requested graphs to provide a superimposed or merged graph,
The processor comprising:
Comparing the dimension information of the graphs requested to be integrated with the graphs to determine whether a common dimension metric match exists if a common dimension exists,
Providing a superimposed or merged graph corresponding to the user selection by inputting one of the merging and superimposing user selection through the user interface when the metric type is matched and providing a superimposed graph based on a common dimension when the metric type does not match Features integrated graphical presentation device.
delete The method according to claim 1,
The processor comprising:
Wherein the first graph is converted into a bar graph and the second graph is converted into a line graph when the overlapped graph is provided.
The method according to claim 1,
Further comprising a DB storing cube data matched to the graph and metadata for interpreting the cube data,
Wherein the cube data is a set row structure including a time dimension in which time information is recorded, a space dimension in which spatial information is recorded, a user dimension in which information other than time and space is recorded, and numerical values,
Wherein the processor is further configured to compare the first graph and the numerical value of the cube data matched to the at least one second graph based on a common dimension of the cube data matched to the first graph and the at least one second graph, To the merging or overlapping of the graphs.
The method according to claim 1,
The processor comprising:
And when the metrics of the common dimension coincide with each other, the graphs are superimposed or merged so that the metric units are the same.
The method according to claim 1,
If the user interface is dragged on a specific graph,
Wherein the processor copies the common dimension among the data of the specific graph requested by the graph separation and separates the hierarchy of the non-common dimension and arranges it in a predetermined order, And provides a merged separation graph.
Determining that the user interface is a graph aggregation request when at least one second graph is dragged and dropped on the first graph; And
Wherein the processor compares the dimension information and the unit information of the graph integration requested graphs to provide a superimposed or merged graph,
Wherein providing the overlaid or merged graph comprises:
(a) comparing the dimension information of the graphs requested to be integrated by the processor, and determining whether a common dimension metric match exists if a common dimension exists;
(b) receiving, by the processor, one user selection of merging and superimposing through a user interface upon metric matching, and providing a superimposed or merged graph corresponding to the user selection; And
(c) providing the graph with a nested graph based on a common dimension when metric mismatches are present.
delete 8. The method of claim 7,
Wherein the processor converts the first graph into a bar graph and the second graph into a line graph when the overlapped graph is provided.
8. The method of claim 7,
Wherein the processor further comprises storing cube data matched to the graph and metadata for interpreting the cube data,
Wherein the cube data is a set row structure including a time dimension in which time information is recorded, a space dimension in which spatial information is recorded, a user dimension for recording information other than time and space, and a numerical value, The metadata includes unit information,
Wherein providing the overlaid or merged graph comprises:
Wherein the processor is configured to calculate a first graph and a numerical value of cube data matched to the at least one second graph based on a common dimension of cube data matched to the first graph and the at least one second graph, And the merging or overlapping is provided.
8. The method of claim 7,
The step (c)
Wherein the processor provides a graph superimposed or merged so that metric units of the metric type are equal if the metrics of the common dimension coincide.
8. The method of claim 7,
If the user interface is dragged on the specific graph, it is determined that the request is a graph separation request, and the common dimension among the data of the specific graph requested for graph separation is copied, and the non-common dimension hierarchy is sorted, Further comprising the step of providing a separating graph merging with the highest common hierarchical value and the copied common dimension.

Images