CN108765190B - River network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting - Google Patents
River network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting Download PDFInfo
- Publication number
- CN108765190B CN108765190B CN201810479543.4A CN201810479543A CN108765190B CN 108765190 B CN108765190 B CN 108765190B CN 201810479543 A CN201810479543 A CN 201810479543A CN 108765190 B CN108765190 B CN 108765190B
- Authority
- CN
- China
- Prior art keywords
- river network
- river
- network data
- confluence
- areas
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000011144 upstream manufacturing Methods 0.000 claims abstract description 10
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 11
- 239000002689 soil Substances 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 abstract description 8
- 238000004088 simulation Methods 0.000 abstract description 7
- 238000013499 data model Methods 0.000 abstract description 2
- 230000008676 import Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 5
- 230000006978 adaptation Effects 0.000 description 1
- 238000012271 agricultural production Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000009776 industrial production Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Health & Medical Sciences (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a river network data expression method which is oriented to large-scale parallel and suitable for river network multilevel nesting, and aims to solve the problems that in the prior art, a river network data model is poor in self-adaption and large in retrieval limitation. The river network data expression method facing the large-scale parallel and suitable for river network multi-level nesting expresses areas by nodes, expresses upstream and downstream confluence relations among the areas by edges with arrows, expresses confluence relations among the areas by graphs, analyzes standard river network data, imports a graph database, and stores a confluence structure by the graph database. The river network data expression method has strong self-adaptation, can reflect the river network topological structure in nature more truly, has stronger dynamic expandability, can adapt to the requirement of quick retrieval, is convenient for quick convergence calculation, better describes the hydrological topological structure of the river network and the upstream and downstream convergence relations among all the areas, and provides a better basis for task division in hydrological simulation and calculation of the convergence relations among the river networks.
Description
Technical Field
The invention belongs to the technical field of water resource protection, and particularly relates to a river network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting.
Background
With the ever-expanding population, water resources, both in industrial and agricultural production and in everyday water, are becoming increasingly important. To make full use of and protect water resources, it is necessary to know the water resources sufficiently. In the prior art, a water resource database is generally established through hydrologic simulation, sub-basin information, a hydrologic model and model parameters of a river network are stored in the database, and changes of water resources are predicted or tracked through technologies such as river network coding and the like. The river network coding is used for reproducing and storing data in a confluence process, the river network data structure is an important basis in a parallel task dividing process, each simulation area is distributed to each computing unit, the areas are taken as units, a river network topological structure is formed, and a confluence relation is computed.
At present, there are two kinds of river network coding methods, the first is binary tree river network coding Method, and the second is Multi-tree river network coding Method (MCM).
The binary tree river network coding regards the river network as a binary tree structure, and only the intersection of two rivers is considered. The method takes the root node of the tree as the exit of the watershed, and each node of the tree is represented by a binary group (L, V): where L refers to the depth of the node in the tree (i.e., the topological distance from the basin exit), and V is the number from left to right of the same level (starting with 0). Thus, if the node is (L, V), then the upstream node is
Wherein
Represents rounding down; the downstream nodes are (L,2V) and (L,2V +1), respectively. Although the binary tree river network coding method can reflect the topological relation between river basin water systems, the value of V increases exponentially with L, so that useless codes of a large number of vacant nodes are caused, and the performance of the whole system is further rapidly reduced.
And a Multi-tree Code Method (MCM) represents nodes using a triplet (L, V, Z): l represents the number of layers of the tree; v is the number of the node from 0 to the right in turn; z represents the V value of the parent node of the current node. A node can be uniquely identified with L and V. If the node (L) is known0,V0,Z0) Then the values of L and V of the nodes downstream thereof are (L)0-1,Z0_). The representation mode has great limitation in the aspect of retrieval and query, and the performance of convergence calculation in hydrological simulation is greatly reduced.
Disclosure of Invention
The embodiment of the invention aims to provide a river network data expression method which is oriented to large-scale parallel and suitable for river network multistage nesting, is used for describing a river network topological structure in hydrological simulation and an upstream and downstream confluence relation among regions (such as sub-river basin), and solves the problems of poor adaptation and large retrieval limitation of a river network data model in the prior art.
In order to solve the technical problem, an embodiment of the present invention provides a river network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting, where the river network data expression method includes:
the areas are represented by nodes, the upstream and downstream confluence relations among the areas are represented by sides with arrows, the confluence relations among the areas are represented by the graphs, standard river network data are analyzed, a graph database is imported, and the graph database is used for storing the confluence structures.
In the above scheme, analyzing the standard river network data and importing a graph database includes the following steps:
step S1, dividing the corresponding areas of the river reach, creating a node in the database for each area of the river reach, and storing the node attribute;
in step S2, for any node X, all nodes are traversed to establish the convergence relationship of the nodes X.
Step S3, the edge representing the confluence relation, the nodes and the related attributes thereof related to the edge are stored in the graph database.
In the above solution, the node attribute includes: the drainage basin geographic information, the water area information and the soil information.
The technical scheme of the invention has the following beneficial effects:
in the above scheme, the river network data expression method facing to large-scale parallel and suitable for river network multi-level nesting can realize large-scale parallel and multi-level nesting, is strong in self-adaptation, can reflect the river network topological structure in nature more truly, can easily refine and expand river network information aiming at a specific river basin area, has stronger dynamic expandability, can adapt to the requirement of quick retrieval, can efficiently retrieve to facilitate quick convergence calculation, can better describe the hydrological topological structure of the river network and the upstream and downstream convergence relations among the areas, and provides a better basis for task division in hydrological simulation and calculation of the convergence relations among the river networks.
Drawings
In order to more clearly illustrate the embodiments of the present invention and the prior art, the following technical scheme description figures of the present invention are briefly introduced, and it is obvious that other figures can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a schematic diagram illustrating a convergence of a river network data expression method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a river network topology structure expressed by the river network data expression method in the embodiment of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments.
The embodiment of the invention aims to provide a multi-level nested river network data expression method which is oriented to large-scale parallel, self-adaptive and dynamically expandable, can adapt to the requirement of quick retrieval, is convenient for quick convergence calculation, and can reflect the river network topological structure in nature more truly, so that the hydrologic topological structure and the upstream and downstream convergence relations among all areas can be better described, and the task division in hydrologic simulation and the calculation of the convergence relations among river networks can be facilitated.
The present invention will be described in further detail with reference to specific examples.
Examples
The embodiment provides a river network data expression method which is oriented to large-scale parallel and suitable for river network multilevel nesting. Fig. 1 is a schematic view of a river network data expression method in the present embodiment. As shown in fig. 1, standard river network data is analyzed, a graph database is imported, and a confluence is stored using the graph database. Different from the binary tree coding method and the multi-tree coding method, in the process of analyzing the river network, a node (e.g., A, B, C, etc.) represents a region, such as a certain sub-river basin, and is no longer an intersection of the river network (e.g., a point numbered as 1, 2, 3, 4 in the figure); the arrowed edges (edge) represent upstream and downstream confluence between regions, not river segments; the graph (graph) shows a confluence relationship between the regions, so that a confluence data structure represented by a graph database can be obtained. The specific process of analyzing the river network is as follows:
step S1, dividing the area corresponding to the river reach, creating a node in the database for each area where the river reach is located, and storing the node attributes.
As shown in fig. 1, the leftmost part in fig. 1 is a schematic diagram of an area where a river reach is located, in this embodiment, three river reaches are taken as an example for description, and a 3-2 river reach, a 4-2 river reach, and a 2-1 river reach are provided, each river reach corresponds to a corresponding area A, B, C, and an area is represented by a node, so that this embodiment includes A, B, C three nodes. Downstream of the region a is a region C, downstream of the region B is a region C, and upstream of the region C is a region A, B. For each region, a graph node is created in the database, and necessary node attributes, such as geographical information of the drainage basin, soil information and the like, are stored.
In step S2, for any node X, all nodes are traversed to establish the convergence relationship of the nodes X.
As shown in the middle upper part of fig. 1, in the present embodiment, taking any one node a as an example, all nodes are traversed to find the node downstream thereof as C, and then an edge a- > C is added, i.e., from _ node and to _ node, the confluence relationship, a to C, is derived. Similarly, taking node B as an example, find node C downstream of it, add edge B- > C, i.e., push the confluent relationship from _ node and to _ node, B to C.
Step S3, the edge representing the confluence relation, the nodes and the related attributes thereof related to the edge are stored in the graph database.
As shown in the middle lower part of fig. 1, the length attribute of the river in the area a is expressed by a "< a > < sh _ l > 0.03657" sentence, and the length attribute of the river in the area B is expressed by a "< B > < sh _ l > 0.0167" sentence. And finally, storing the attribute of the node A, B and the edge A- > C, B- > C representing the confluence relation into a graph database to finish river network coding.
Fig. 2 is a schematic diagram of a river network topology expressed by the river network data expression method in this embodiment.
As shown in fig. 2, the entire diagram represents a hydrologic topology (right half of fig. 2) based on the river network data expression method described in this embodiment, which abstractly represents a water system structure (left half of fig. 2) in nature. Wherein each node (F, G, D, E, C, B, A) in the right half graph (graph) of fig. 2 represents not the junction of the river network but a hydrological area; the edges in the graph (graph) indicate not the river course but the confluence relationship. In the binary tree or multi-tree coding scheme, the edges in the graph (graph) represent the natural hydrological regions, and the nodes (F, G, D, E, C, B, A) in the graph (graph) represent the junction points of rivers. This is also the essential difference between the present invention and the current binary tree or multi-tree coding scheme.
The river network data expression method provided by the embodiment has strong self-adaptation, can reflect the topological structure of the river network in nature more truly, can easily refine and expand river network information aiming at a specific river basin area, has stronger dynamic expandability, can adapt to the requirement of quick retrieval, and can efficiently retrieve to facilitate quick convergence calculation.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (1)
1. A river network data expression method facing to large-scale parallel and suitable for river network multilevel nesting is characterized by comprising the following steps:
representing areas by nodes, representing the upstream and downstream confluence relations among the areas by edges with arrows, representing the confluence relations among the areas by graphs, analyzing standard river network data, importing a graph database, and storing a confluence structure by the graph database;
analyzing standard river network data and importing a graph database, wherein the method comprises the following steps:
step S1, dividing the corresponding areas of the river reach, creating a node in the database for each area of the river reach, and storing the node attribute;
step S2, traversing all nodes for any node X, and establishing the confluence relation of the nodes X;
step S3, the edge representing the confluence relation, the node and the related attribute thereof related to the edge are stored in a graph database;
the node attributes include: the drainage basin geographic information, the water area information and the soil information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810479543.4A CN108765190B (en) | 2018-05-18 | 2018-05-18 | River network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810479543.4A CN108765190B (en) | 2018-05-18 | 2018-05-18 | River network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108765190A CN108765190A (en) | 2018-11-06 |
| CN108765190B true CN108765190B (en) | 2022-04-05 |
Family
ID=64007252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810479543.4A Active CN108765190B (en) | 2018-05-18 | 2018-05-18 | River network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108765190B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109918741B (en) * | 2019-02-13 | 2020-11-27 | 北京科技大学 | Parameter calibration method suitable for large-scale hydrological simulation |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218538A (en) * | 2013-04-28 | 2013-07-24 | 中国水利水电科学研究院 | River network one-dimensional steady flow calculation method based on river network incidence matrix |
| CN103853934A (en) * | 2014-03-28 | 2014-06-11 | 刘舒 | Method and system for calculating river networks model |
| CN105138722A (en) * | 2015-07-14 | 2015-12-09 | 南京师范大学 | Digital river-lake network based method for dividing water collection unit of river basin of plain river network region |
| CN106447106A (en) * | 2016-09-27 | 2017-02-22 | 西安理工大学 | Comprehensive resistance weight and graph theory-based river network connectivity assessment method and gate dam optimization method |
| CN107194040A (en) * | 2017-04-27 | 2017-09-22 | 西交利物浦大学 | Water quality monitoring network multiple-objection optimization dispositions method based on bimodal current |
| CN107944111A (en) * | 2017-11-16 | 2018-04-20 | 河海大学 | Based on the river network degree of communication computational methods for improving graph theory and hydrological simulation |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9311082B2 (en) * | 2006-12-29 | 2016-04-12 | Sap Se | System and method for processing graph objects |
-
2018
- 2018-05-18 CN CN201810479543.4A patent/CN108765190B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218538A (en) * | 2013-04-28 | 2013-07-24 | 中国水利水电科学研究院 | River network one-dimensional steady flow calculation method based on river network incidence matrix |
| CN103853934A (en) * | 2014-03-28 | 2014-06-11 | 刘舒 | Method and system for calculating river networks model |
| CN105138722A (en) * | 2015-07-14 | 2015-12-09 | 南京师范大学 | Digital river-lake network based method for dividing water collection unit of river basin of plain river network region |
| CN106447106A (en) * | 2016-09-27 | 2017-02-22 | 西安理工大学 | Comprehensive resistance weight and graph theory-based river network connectivity assessment method and gate dam optimization method |
| CN107194040A (en) * | 2017-04-27 | 2017-09-22 | 西交利物浦大学 | Water quality monitoring network multiple-objection optimization dispositions method based on bimodal current |
| CN107944111A (en) * | 2017-11-16 | 2018-04-20 | 河海大学 | Based on the river network degree of communication computational methods for improving graph theory and hydrological simulation |
Non-Patent Citations (3)
| Title |
|---|
| 分布式水文模型子流域划分方法;张峰等;《南水北调与水利科技》;20110528(第03期);第101-104页 * |
| 利用几何网络提取河网径流节点的方法研究;刘晓等;《测绘科学》;20110920(第05期);第85-86页 * |
| 基于DEM的流域尺度水资源网络图构建;雷晓辉等;《水文》;20100425(第02期);第6-10页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108765190A (en) | 2018-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yao et al. | A fast space-saving algorithm for maximal co-location pattern mining | |
| Pedryez et al. | Linguistic models and linguistic modeling | |
| CN110059264B (en) | Site retrieval method, equipment and computer storage medium based on knowledge graph | |
| CN111459988B (en) | Automatic design method for machine learning assembly line | |
| CN110275929B (en) | Candidate road section screening method based on grid segmentation and grid segmentation method | |
| CN103823885A (en) | Data provenance dependence relation analysis model-based data dependence analysis method | |
| CN113485144A (en) | Intelligent household control method and system based on Internet of things | |
| CN108765190B (en) | River network data expression method oriented to large-scale parallel and suitable for river network multilevel nesting | |
| Strazzeri et al. | Possibility results for graph clustering: A novel consistency axiom | |
| CN109697206A (en) | A kind of distributive function dependence method for digging | |
| CN110807061A (en) | Method for searching frequent subgraphs of uncertain graphs based on layering | |
| CN115935026A (en) | Graph database-based automatic topology simplification method for SWMM drainage pipe network model | |
| Zhang et al. | Research on the maximum flow in large-scale network | |
| Xing et al. | Discovering traffic outlier causal relationship based on anomalous DAG | |
| Gross et al. | Continuous preservation of situational awareness through incremental/stochastic graphical methods | |
| CN105005628A (en) | Shortest path key node query method based on centralized platform | |
| Abdolazimi et al. | Connected components of big graphs in fixed mapreduce rounds | |
| Bui et al. | The Computational Complexity of Hierarchical Clustering Algorithms for Community Detection: A Review. | |
| Li et al. | The Interval Parameter Optimization Model Based on Three‐Way Decision Space and Its Application on “Green Products Recommendation” | |
| Hu et al. | Improved particle swarm optimization for minimum spanning tree of length constraint problem | |
| Kim et al. | Embedding of rings in 2-D meshes and tori with faulty nodes | |
| CN111581946A (en) | Language sequence model decoding method | |
| CN116383088B (en) | Source code form verification method, device, equipment and storage medium | |
| Strazzeri et al. | Morse theory and an impossibility theorem for graph clustering | |
| Behzadi | Introducing AN Agent-Based Object Recognition Operator for Proximity Analysis |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |