A method for browsing multidimensional datasets based on two-dimensional slice decomposition
By using a two-dimensional slicing method to create a tree view node directory and utilizing drawing components to display the cube, the problem of low browsing efficiency of cubes is solved, achieving user-friendly and efficient data processing and visualization.
Patent Information
- Application Number
- CN202410157831.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-02-04
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2044-02-04
AI Technical Summary
Current technologies for browsing and loading multidimensional datasets are inefficient, requiring ordinary users to write complex code, which limits their use by non-professional users.
A two-dimensional slicing decomposition method is adopted to create a tree view node directory in the directory tree component. Based on the dimensional relationship of the multidimensional geographic dataset, two-dimensional or one-dimensional data slices are displayed through the drawing component. The next level data node with dimensions higher than two dimensions but less than five dimensions is expanded to display, reducing user interaction.
It improves the efficiency of using cubes, allowing users to quickly complete data processing and visualization tasks without writing complex code, saving time and effort and reducing operational burden.
Smart Images

Figure CN118170725B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of multidimensional dataset browsing technology, specifically to a method for browsing multidimensional datasets based on two-dimensional slice decomposition. Background Technology
[0002] Geographic datasets are the most frequently used data storage format in the development of tools for geographic information systems and earth science big data, such as satellite remote sensing data products, meteorological model output data products, and related derivative data products. These multidimensional datasets have flexible storage methods, typically storing datasets of different dimensions mixed in the same file. For such files storing multidimensional datasets, most existing users still use programming languages to read and browse the data in these files. Each time this data is read or browsed, specific code needs to be called, which affects the efficiency of data use. At the same time, because specific code needs to be called to read or browse this data, it limits the use by ordinary non-professional users who do not understand coding.
[0003] Therefore, how to achieve efficient loading and browsing of multidimensional datasets, thereby improving the efficiency of multidimensional dataset usage, is a technical problem that urgently needs to be solved by those skilled in the art. Summary of the Invention
[0004] To address the aforementioned issues, this application provides a method for browsing multidimensional datasets based on two-dimensional slicing, which enables efficient loading and browsing of multidimensional datasets, thereby improving the efficiency of multidimensional dataset usage.
[0005] The embodiments of this application disclose the following technical solutions:
[0006] A method for browsing multidimensional datasets based on two-dimensional slice decomposition, applied to a computer system, the method comprising:
[0007] Create a tree view node directory in the directory tree component based on the data dimension decomposition relationship of the multidimensional geographic dataset;
[0008] Retrieve the currently selected data node from the tree view node directory;
[0009] When the current data node selected by the user is an end node and the dimension corresponding to the current data node is two-dimensional or one-dimensional, load the two-dimensional data slice or one-dimensional data slice of the current data node and create an image, and display the created image in the drawing component.
[0010] When the current data node selected by the user is a non-end node and the dimension corresponding to the current data node is higher than two dimensions but less than five dimensions, expand to display all the next-level data nodes contained in the current data node.
[0011] In one possible implementation, creating a tree view node directory in the directory tree component based on the data dimension decomposition relationship of the multidimensional geographic dataset includes:
[0012] Create a corresponding root node for the multidimensional geographic dataset file;
[0013] When the dimension of the cube is four-dimensional, a corresponding four-dimensional node is created for the cube and placed below the root node. The cube is then decomposed into multiple three-dimensional cubes, and corresponding three-dimensional node sequences are created and used as child nodes of the four-dimensional node. The three-dimensional cubes are further decomposed into multiple two-dimensional cubes, and corresponding two-dimensional node sequences are created and used as child nodes of the three-dimensional node. The two-dimensional nodes serve as the end nodes in the tree view.
[0014] When the dimension of the cube is three-dimensional, a corresponding three-dimensional node is created for the cube and placed below the root node. The cube is decomposed into multiple two-dimensional cubes, and a corresponding sequence of two-dimensional nodes is created and used as child nodes of the three-dimensional node. The two-dimensional nodes serve as end nodes in the tree view.
[0015] When the loaded cube has a dimension of two or one, a corresponding two-dimensional node or one-dimensional node is created for the cube and placed below the root node, wherein the two-dimensional node or one-dimensional node serves as the end node in the tree view.
[0016] In one possible implementation, loading a two-dimensional or one-dimensional data slice of the node, creating an image, and displaying the created image in the drawing component includes:
[0017] Load the two-dimensional data nodes or one-dimensional data nodes of the multidimensional geographic dataset into two-dimensional data slices or one-dimensional data slices.
[0018] An image is generated based on the loaded two-dimensional data slices and displayed in the drawing component.
[0019] Compared with the prior art, this application has the following advantages:
[0020] This application provides a method for browsing multidimensional datasets based on two-dimensional tile decomposition. Specifically, when executing the method for browsing multidimensional datasets based on two-dimensional tile decomposition provided in this application embodiment, a tree-like node directory is created for the directory tree component according to the dimensional decomposition relationship of the multidimensional geographic dataset. First, the currently selected data node in the tree view node directory is obtained. Then, when the currently selected data node is an end node and the dimension corresponding to the current data node is two-dimensional or one-dimensional, the two-dimensional or one-dimensional data tile of the current data node is loaded and an image is created, which is then displayed in the drawing component. When the currently selected data node is not an end node and the dimension corresponding to the current data node is higher than two-dimensional but less than five-dimensional, all the next-level data nodes contained in the current data node are expanded and displayed. The process of selecting multidimensional data nodes, identifying the current dimension, and using the drawing component to draw images can be completed on the user interface without the user writing or calling complex code. Therefore, users can quickly complete data processing and visualization tasks through simple interactive operations, saving a lot of time and effort, thereby significantly improving the efficiency of browsing multidimensional datasets. This automated processing reduces the user's workload and improves data processing efficiency. Attached Figure Description
[0021] To more clearly illustrate the technical solutions in this embodiment or the prior art, the drawings used in the description of the embodiment or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0022] Figure 1 A user interface window provided for embodiments of this application;
[0023] Figure 2 A flowchart illustrating a method for browsing a multidimensional dataset based on two-dimensional slice decomposition, provided in this application embodiment;
[0024] Figure 3 This is a schematic diagram illustrating the disassembly of multidimensional slice data provided in an embodiment of this application. Detailed Implementation
[0025] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present application.
[0026] To facilitate understanding of the technical solutions provided in the embodiments of this application, the background technology involved in the embodiments of this application will be described below.
[0027] A geographic dataset refers to a collection of data containing various geographic information about the Earth's surface or a specific region. It can include a variety of geographic elements and attributes such as geographic location, topography, demographics, climate data, land use, transportation networks, and water resources.
[0028] Various geographic datasets are the most frequently used data storage formats in the development of tools for geographic information systems and earth science big data. Examples include satellite remote sensing data products, meteorological model output data products, and related derivative data products. Common data storage formats include netCDF (Network Common Data Form), hdf4 (Hierarchical Data Format 4), hdf5 (Hierarchical Data Format 5), GeoTiff (Geographic Tagged Image File Format), and Grib1 / Grib2 (Gridded Binary). These multidimensional datasets offer flexible storage methods, typically storing datasets of different dimensions mixed within the same file. For files containing such multidimensional datasets, most existing users still rely on programming languages to read and browse the data. Each time this data is read or browsed, specific code needs to be called, which impacts data usage efficiency. Furthermore, the need to call specific code limits the use by ordinary, non-professional users who lack coding knowledge.
[0029] To address this issue, this application provides a method for browsing multidimensional datasets based on two-dimensional tile decomposition. A tree view node directory is created in the directory tree component according to the data dimension decomposition relationship of the multidimensional geographic dataset. First, the currently selected data node in the tree view node directory is obtained. Then, when the currently selected data node is an end node and its corresponding dimension is two-dimensional or one-dimensional, the two-dimensional or one-dimensional data tile of the current data node is loaded and an image is created, which is then displayed in the drawing component. When the currently selected data node is not an end node and its corresponding dimension is higher than two dimensions but less than five dimensions, only all the next-level data nodes contained in the current data node are expanded and displayed. This application allows the process of selecting multidimensional data nodes, identifying the current dimension, and drawing images using the drawing component to be completed on the user interface without requiring the user to write or call complex code. Therefore, users can quickly complete data processing and visualization tasks through simple interactive operations, saving a significant amount of time and effort, thereby significantly improving the efficiency of using multidimensional datasets.
[0030] To facilitate understanding of the browsing method for multidimensional datasets based on two-dimensional slice decomposition provided in the embodiments of this application, the following is combined with... Figure 1 The example scenario is shown below. See also... Figure 1 This figure shows a user interface window provided in an embodiment of this application. The user interface window consists of an image drawing component 101 and a directory tree component 102. The directory tree component 102 creates a tree view node directory based on the data dimension decomposition relationship of the multidimensional geographic dataset, including file nodes 103, coarse nodes 104, two-dimensional data nodes 105, and three-dimensional data nodes 106.
[0031] When a user selects a node from the tree view node directory, the computer system first needs to obtain the data node of the multidimensional geographic dataset that the user wants to browse. The data node of the multidimensional geographic dataset can be understood as the node the user currently selects from the tree view node directory. Next, the computer system needs to determine whether the multidimensional geographic dataset data node is an end node without child nodes, such as a two-dimensional data node 105 or a one-dimensional data node. If the multidimensional geographic dataset data node is such an end node, then the computer system can identify the current dimension of the multidimensional geographic dataset data node. Then, when the current dimension is two-dimensional or one-dimensional, the drawing component 101 performs image drawing based on the multidimensional geographic dataset data node. This can be completed on the user interface without the user writing or calling complex code to perform data processing and visualization tasks, thus significantly improving the efficiency of using multidimensional datasets.
[0032] Those skilled in the art will understand that Figure 1 The user interface window shown is merely one example of an implementation of this application. The scope of application of this application's implementation is not limited by any aspect of this framework.
[0033] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.
[0034] See Figure 2 The figure is a flowchart of a method for browsing a multidimensional dataset based on two-dimensional slice decomposition according to an embodiment of this application. Figure 2 As shown, the method for browsing a multidimensional dataset based on two-dimensional slice decomposition may include steps S201-S204:
[0035] S201: Create a tree view node directory in the directory tree component based on the data dimension decomposition relationship of the multidimensional geographic dataset.
[0036] The tree view node directory is constructed when the multidimensional geographic dataset is received. During construction, a file node directory, i.e., the tree view node directory, needs to be created for the data in the multidimensional geographic dataset.
[0037] In one possible implementation, creating a tree view node directory in the directory tree component based on the data dimension decomposition relationship of the multidimensional geographic dataset includes:
[0038] (1) First, create a root node for the multidimensional geographic dataset file. The root node is the top-level node of a tree data structure. The root node can be the parent node of any data node, such as four-dimensional, three-dimensional, two-dimensional, and one-dimensional data nodes.
[0039] (2) When the dimension of the cube is four-dimensional, create a corresponding four-dimensional node for the cube and place it under the root node. Decompose the cube into multiple three-dimensional cubes, create corresponding three-dimensional node sequences and use them as child nodes of the four-dimensional node; further decompose the three-dimensional cubes into multiple two-dimensional cubes, create corresponding two-dimensional node sequences and use them as child nodes of the three-dimensional node. Among them, the two-dimensional node is the end node in the tree view.
[0040] Specifically, when splitting a single multidimensional geographic dataset into a two-dimensional dataset, the proposed solution is as follows: If the single dataset has two dimensions, no further splitting is needed; a tree view node C is directly generated for this dataset, forming the terminal leaf node. If the single dataset has three dimensions, assuming its dimensions are n, h, and w, a tree view node B is generated to represent this three-dimensional dataset. Then, a sequence of tree nodes C of length n is generated as child nodes of node B. Each node C in the sequence represents the data layer composed of the lowest dimension and is the terminal leaf node, containing the starting position and number of rows and columns of the corresponding two-dimensional data layer in the data file. If the single dataset has four dimensions, assuming its dimensions are m, n, h, and w, as... Figure 3 First, a tree view node A is generated to represent the four-dimensional dataset. Then, a sequence of tree nodes B of length m is generated, where each node B represents a three-dimensional dataset and serves as a child node of node A. Next, the three-dimensional data corresponding to each node B is split to form a sequence of two-dimensional tree nodes C of length n, which serve as child nodes of node B.
[0041] (3) When the dimension of the cube is three-dimensional, create a corresponding three-dimensional node for the cube and place it under the root node. Decompose the cube into multiple two-dimensional cubes, create corresponding two-dimensional node sequences and use them as child nodes of the three-dimensional node. The two-dimensional node serves as the end node in the tree view.
[0042] (4) When the loaded cube has two or one dimension, create a corresponding two-dimensional or one-dimensional node for the cube and place it below the root node. The two-dimensional or one-dimensional node serves as the end node in the tree view.
[0043] S202: Obtain the currently selected data node in the tree view node directory.
[0044] It's important to note that only the data node currently selected by the user needs to be processed. Since there are many data nodes, only the one selected by the user needs to be processed. Therefore, only the data node of the multidimensional geographic dataset selected by the user needs to be retrieved for subsequent processing.
[0045] By selecting nodes from the tree view, users can quickly locate the desired multidimensional geographic dataset, and the interactive method of data selection enhances the user experience. Data nodes accessed within the multidimensional geographic dataset enable operations specific to that dataset, such as data loading, visualization, and analysis.
[0046] To obtain the data node of the multidimensional geographic dataset that the user has currently selected in the tree view node directory, the computer system needs to listen for interaction events in the tree view node directory, such as node selection, clicking, and expansion, to capture user actions on the multidimensional data node. Once the user selects a specific node in the tree view node directory, the computer system can obtain relevant information about the currently selected multidimensional data node through the interfaces or methods provided by this component, such as the node's path, identifier, and data storage location. After obtaining the information about the multidimensional data node, the computer system can further process the data, such as reading, parsing, and loading the multidimensional dataset for subsequent data analysis, visualization, or other operations.
[0047] S203: When the current data node selected by the user is an end node and the dimension corresponding to the current data node is two-dimensional or one-dimensional, load the two-dimensional data slice or one-dimensional data slice of the current data node and create an image, and display the created image in the drawing component.
[0048] In a tree structure, terminal nodes are typically used to describe the lowest-level nodes. In a tree view node directory, terminal nodes are nodes without children; they are located at the very bottom of the tree and are the leaf nodes.
[0049] Computer systems can traverse data structures to check if the current node is a terminal node and infer the current dimension accordingly. When the terminal node is a node with no child nodes in the tree view's node directory, the dimension of the current node can be determined by backtracking or marking. For example, one can start from the root node and traverse downwards level by level until the terminal node is found, recording the path information along the way, thus ultimately determining the dimension of the current node.
[0050] When the current dimension is two-dimensional or one-dimensional, the drawing component is used to draw images based on the data nodes of the multidimensional geographic dataset because two-dimensional or one-dimensional data is more intuitive, easier to present on a two-dimensional or one-dimensional plane, and can clearly show the distribution, relationship and trend of the data.
[0051] S204: When the current data node selected by the user is a non-end node and the dimension corresponding to the current data node is higher than two dimensions but less than five dimensions, only all the next-level data nodes contained in the current data node are expanded and displayed.
[0052] When the current dimension is greater than two dimensions but less than five dimensions, it is only necessary to expand and display all the next-level data nodes contained in the data nodes of the multidimensional geographic dataset. Expanding the next-level child nodes can help users better view the structure and hierarchical relationships of the data.
[0053] In one possible implementation, the method further includes:
[0054] When the current dimension is greater than or equal to five dimensions, no processing is performed on the data nodes of the current multidimensional geographic dataset.
[0055] As dimensionality increases, data complexity grows exponentially. In high-dimensional spaces, users find it difficult to intuitively understand and perceive the relationships between data, and even struggle to effectively present the data in a visual graph. This means that when the current dimension is greater than or equal to five, computer systems attempting to directly visualize high-dimensional data often result in information loss and confusion. Therefore, when the current dimension is greater than or equal to five, computer systems will not process or plot the data nodes of the current multidimensional geographic dataset.
[0056] Based on the content of S201-S204, a tree view node directory is created in the directory tree component according to the data dimension decomposition relationship of the multidimensional geographic dataset. First, the currently selected data node in the tree view node directory is obtained. Then, when the node is an end node and its corresponding dimension is two-dimensional or one-dimensional, the two-dimensional or one-dimensional data slice of the node is loaded and an image is created, which is then displayed in the drawing component. When the node is not an end node and its corresponding dimension is higher than two dimensions but less than five dimensions, only all the next-level data nodes contained in the node are expanded and displayed. This application's process of selecting multidimensional data nodes, identifying the current dimension, and using the drawing component to draw images through the tree view node directory can be completed on the user interface without requiring the user to write or call complex code. Therefore, users can quickly complete data processing and visualization tasks through simple interactive operations, saving a significant amount of time and effort, thereby significantly improving the efficiency of using multidimensional datasets. This automated processing reduces the user's operational burden and improves data processing efficiency. Furthermore, a data layer is only temporarily loaded when the user needs to browse a specific two-dimensional data layer, achieving smaller memory usage and faster loading speed. In addition, displaying these split data in a hierarchical tree view node directory makes it easier for users to select and browse.
[0057] The foregoing has provided a detailed description of a method for browsing a multidimensional dataset based on two-dimensional slice decomposition, as provided in this application. The various embodiments in the specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably.
[0058] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.
[0059] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. A method for browsing multidimensional datasets based on two-dimensional slice decomposition, characterized in that, Applied to a computer system, the method includes: Create a tree view node directory in the directory tree component based on the data dimension decomposition relationship of the multidimensional geographic dataset; Retrieve the currently selected data node from the tree view node directory; When the current data node selected by the user is an end node and the dimension corresponding to the current data node is two-dimensional or one-dimensional, load the two-dimensional data slice or one-dimensional data slice of the current data node and create an image, and display the created image in the drawing component. When the current data node selected by the user is a non-end node and the dimension corresponding to the current data node is higher than two dimensions but less than five dimensions, expand and display all the next-level data nodes contained in the current data node; The step of creating a tree view node directory in the directory tree component based on the data dimension decomposition relationship of the multidimensional geographic dataset includes: Create a corresponding root node for the multidimensional geographic dataset file; When the dimension of the cube is four-dimensional, a corresponding four-dimensional node is created for the cube and placed below the root node. The cube is then decomposed into multiple three-dimensional cubes, and corresponding three-dimensional node sequences are created and used as child nodes of the four-dimensional node. The three-dimensional cubes are further decomposed into multiple two-dimensional cubes, and corresponding two-dimensional node sequences are created and used as child nodes of the three-dimensional node. The two-dimensional nodes serve as the end nodes in the tree view. When the dimension of the cube is three-dimensional, a corresponding three-dimensional node is created for the cube and placed below the root node. The cube is then decomposed into multiple two-dimensional cubes, and corresponding two-dimensional node sequences are created and used as child nodes of the three-dimensional node. When the dimension of the loaded cube is two-dimensional or one-dimensional, create a corresponding two-dimensional node or one-dimensional node for the cube and place it below the root node; The process of loading a two-dimensional or one-dimensional data slice of the node, creating an image, and displaying the created image in the drawing component includes: Load the two-dimensional data nodes or one-dimensional data nodes of the multidimensional geographic dataset into two-dimensional data slices or one-dimensional data slices. An image is generated based on the loaded two-dimensional data slices and displayed in the drawing component.
Citation Information
Patent Citations
User interfaces for scoped hierarchical data sets
CN101784985A
Three-dimensional geographic data-oriented transmission and rendering method and system
CN111858828A
