CN104252547B - A kind of extensive geological model of oil accumulation data are rapidly loaded method - Google Patents
A kind of extensive geological model of oil accumulation data are rapidly loaded method Download PDFInfo
- Publication number
- CN104252547B CN104252547B CN201310259671.5A CN201310259671A CN104252547B CN 104252547 B CN104252547 B CN 104252547B CN 201310259671 A CN201310259671 A CN 201310259671A CN 104252547 B CN104252547 B CN 104252547B
- Authority
- CN
- China
- Prior art keywords
- data
- center
- hexahedron
- hexahedral
- coordinate
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Method is rapidly loaded the invention provides a kind of extensive geological model of oil accumulation data, belongs to oil reservoir development field.Methods described includes：(1) determination and name in orientation：Definition center hexahedron, hexahedral eight summits in each center associate an initial data gitter cell hexahedron adjacent thereto correspondingly respectively；(2) coordinate set is set up：The coordinate on the hexahedral summit in all of center is put together and saves as a point coordinates set, the coordinate of the point for being completely superposed only is stored once；(3) index is set up：For each center hexahedron, the original position of the set of its apex coordinate is recorded using massive index, use the relative displacement on small each of which summit of index record；The relative displacement refers to relative displacement of other each summits relative to the original position of the set of apex coordinate；(4) data packing.
Description
Technical field
The invention belongs to oil reservoir development field, and in particular to a kind of extensive geological model of oil accumulation data side of being rapidly loaded
Method, can be applied to reservoir model-building model, seismic data cube and other be related to the application of big data quantity coarse gridding, such as underground water
Flow analysis, weather data analysis etc..
Background technology
At present, the loading and storage of extensive geological model of oil accumulation data has the following disadvantages：
1. using the method for disk storage
The principal element for influenceing processing speed is disk access, and the access speed of disk is developed into today, improve
It is enough, but still far from enough.For example, at least needing 1 minute for the data that grid simply reads 2GB.Based on this
Speed will accomplish smooth possible.
2. the random of disk deposits method
Data are stored in order on disk.And the demand of extensive geological model of oil accumulation data processing often with number
Order according to original storage is not inconsistent, and at this moment may need to carry out up to ten thousand disk-reads and operate, and is every time that reading is come in a grid
Data, because the span for reading is too big, system cache will turn turtle, it is such read its it is time-consuming with read in all
Data are similar.Illustrated below by an example：
The original storage of data is as follows：
(x0, y0, z0), (x1, y0, z0) ..., (xxn, y0, z0) ... (x0, y1, z0), (x1, y1, z0) ..., (xxn,
Yyn, z0) ...
(x0, y0, z1) ..., (xxn, yyn, zzn)
Data above according to so-called x run it is most fast, y takes second place, z most slow agreement storage.If reading a z aspect
(aspect of the normal direction parallel to z-axis), it is only necessary to which once, this is best branch to disk-read.Y aspects then need to read zn times, and x layers
Face needs zn to be multiplied by yn disk-read.
Aforesaid operations are time-consuming if transforming the data into order and storing 3 parts can be optimized to second level (about zero point several seconds
Individual operation).That is some disk spaces are sacrificed, most fast according to x, y is most fast, most fast three order of z store a same respectively
The content of sample.Order is read in appropriate matching, and above-mentioned Lie branches can eliminate.
This method is simple and clear, but shortcoming is also significant.It is the efficiency for optimizing part reading.Some need
The operation for traveling through total data still will read one minute.For example, extract an arbitrary section to be accomplished by traveling through total data, this
It is a visual function, one function of section of establishment will wait one minute, and (actual definitely more than one minute, computing was also compared
It is time-consuming), probably user does not allow to be easily accepted by.
In sum, being rapidly loaded for extensive geological model of oil accumulation data can be realized currently without method.
The content of the invention
It is an object of the invention to solve problem present in above-mentioned prior art, there is provided a kind of extensive reservoir geology mould
Type data are rapidly loaded method, realize being rapidly loaded for extensive geological model of oil accumulation data.
The present invention is achieved by the following technical solutions：
A kind of extensive geological model of oil accumulation data are rapidly loaded method, and the initial data to being stored with Corner-point Grids is carried out
Hereinafter process：
(1) determination and name in orientation：Definition center hexahedron, a pair of the hexahedral eight summits difference 1 in each center
Should one initial data gitter cell hexahedron adjacent thereto of ground association；
(2) coordinate set is set up：The coordinate on the hexahedral summit in all of center is put together and saves as a point coordinates
Set, the coordinate of the point for being completely superposed only is stored once；
(3) index is set up：For each center hexahedron, the starting of the set of its apex coordinate is recorded using massive index
Position, uses the relative displacement on small each of which summit of index record；The relative displacement refers to other each summit phases
For the relative displacement of the original position of the set of apex coordinate；
(4) data packing：According to the structure of initial data with all data of triple scan rounds, while obtaining the face of center six
The position of body and the coordinate of point set, and be each center hexahedron the addition massive index and small index.
Further included after the step (4)：
(5) data are extracted：Obtained and the center hexahedron near it according to the hexahedral position of initial data gitter cell
Point set massive index order, afterwards according to the order of the hexahedral point set in center, search small index, reduce center hexahedron
Point set, the summit needed for extracting current initial data gitter cell hexahedron；Then to each initial data gitter cell
Each summit repeats this step, you can reduction obtains an initial data gitter cell hexahedron；Reduce all initial data
Gitter cell hexahedron just obtains whole initial data.
Three recirculate and refer in the step (4)：According to the sequential loop of layer during outer loop, according to row when middle level is circulated
Sequential loop, during innermost loop according in a line sequential loop.
Compared with prior art, the beneficial effects of the invention are as follows：Plastid on a large scale is improve using the present invention import speed
Degree, directly results in the lifting that user uses software efficiency.
Brief description of the drawings
Fig. 1 is the step of extensive geological model of oil accumulation data of the invention are rapidly loaded method block diagram.
Fig. 2 is grid schematic three dimensional views.
Specific embodiment
The present invention is described in further detail below in conjunction with the accompanying drawings：
Being rapidly loaded for extensive geological model of oil accumulation data can be realized currently without method, its root is disk access band
Come.If can all read in internal memory and processed data compression to a certain extent, this problem just has can be satisfactory
The basis of solution.
Possibility to compressing is as follows with the performance evaluation of compression algorithm：With the model data of the grid of input data 10,000,000
As a example by, table 1 is a contrast test for the reservoir model of use same ten million grid of different universal compressed Software Compressions.It is aobvious and
It is clear to, improves limited in the good speed of compression effectiveness.Fireballing compression effectiveness is very poor.
| Compressed software title | Compression ratio | Compression is time-consuming | Decompression is time-consuming |
| gzip | 10.3% | 4’49” | 2’31” |
| winrar | 11.2% | 5’10” | 3’00” |
| 7z | 10.1% | 5’01” | 3’10” |
| winzip | 12.9% | 5’12” | 3’02” |
| This method | 73.3% | 1’30” | 1’27” |
Table 1
And in fact, the chief value of this experiment is the compressibility of the data for disclosing this reservoir model.That
Continue deeper into thinking compression algorithm principle, and data specific features, this it is sure help find more reasonably algorithm.
The principle of compression algorithm is：There is redundancy and could be compressed in data.Most simple redundancy is exactly the data for repeating, this
Method has obtained the solution of a set of Fast Compression and decompression by analyzing the redundancy feature of grid angle point.
As shown in figure 1, the inventive method is comprised the following steps：
1. the determination and name in orientation：Initial data is according to gitter cell tissue, by grid three-dimensional as shown in Figure 2
Schematic diagram, is four units for extracting Corner-point Grids, and each unit is represented with a Dark grey hexahedron, Dark grey hexahedron table
Show initial data gitter cell hexahedron.Middle hexahedron is middle light grey hexahedron, and it is a logic region, actual
Simultaneously in the absence of such definition, i.e., grayish hexahedron is virtual non-existent to data, is the model of algorithm.Propose that this determines
The purpose of justice be in order to describe algorithm centered on light grey hexahedron, respectively with left and right (left, right), up and down (up,
Below), far and near (far, near) represents three directions of dimension.Eight significant directions are named as ufl, ufr, unl,
Unl, bfl, bfr, bnl, bnr；Grayish hexahedron respectively has a summit on this eight directions, i.e., eight summits, often
The hexahedral summit of one such summit again respectively with eight Dark greys around overlaps, so, each summit is distinguished
Associate a hexahedron for Dark grey correspondingly, the direction of these adjacent cells (referring to adjacent grid) obviously with
Corresponding summit is the same.The hexahedral direction of these Dark greys obviously with corresponding grayish hexahedral summit
It is consistent, accordingly refers to the summit for existing and overlapping.
The Corner-point Grids are specific as follows：
Said from geometry angle, Corner-point Grids refer to the three-dimensional Euclidean space entity closely inlayed with hexahedron.Grid
Column indicate that line segment is indicated by its two-end-point by line segment.Adjacent column is always according to strict sequential arrangement.Per root post
Possess the node (angle point) of fixed qty.Four adjacent columns can be true with two adjacent angle points on each comfortable relevant position
A fixed elementary cell for Corner-point Grids.
Basis on location (i, j, k) coordinate of each grid.Wherein, k is that, along column direction, i and j then passes through each
Layer.In storage, the order of grid cell is natural, is exactly that i changes at first, followed by j, k finally change.In other words,
It is first storing one row, large number of rows constitutes one layer, then stores next layer.
When column is vertical, the upper and lower surface of each grid is bilinear surface and side is plane.
Most of Reservoir simulation softwares all support Corner-point Grids, and Corner-point Grids have been now actual professional standards.
2. coordinate set is set up：The coordinate on all of grayish hexahedral summit is put together and saves as a point seat
Mark set, certainly, what is be completely superposed just stores without repetition.Due to extracting order according to hexahedral eight summits of light gray
Concentrated, so almost it can be found that all of repeat point.It is exactly to concentrate on the area shown in light grey hexahedron to repeat summit
(i.e. last storage is exactly each light grey hexahedral apex coordinate, and repetition is to deposit one time, so not necessarily in domain
It it is 8, usually one or two or three, 8 is extreme case==summit without coincidence).According to the spy of Corner-point Grids
Point, in most cases in the middle of light grey hexahedron can overlap into a point.
3. index is set up：The start bit of the set of each light grey hexahedral apex coordinate is recorded using massive index
Put, using the relative displacement on small each of which summit of index record, the relative displacement refers to light grey relative to this
The relative displacement of the original position of the set of hexahedral apex coordinate.All of light grey six face thus can completely be described
Body.I.e. massive index points out that some light gray is the initial position of the set of the coordinate on hexahedral summit, and small index possesses 8
Point to the relative displacement on summit in domain, each domain.
4. data packing：For convenience, afterwards, the vertex set of light grey hexahedron description is referred to as 8a.Initial data
It is that 8a is between which according to gitter cell tissue.Data processing (the method treatment described in 2.3.) order is according to original
Order is the most simple and clear, two-layer per treatment, then 8a is produced between the two layers；Two rows are then between two rows；Two then
Between two.Therefore according to the structure of initial data with all data of triple scan rounds (during outer loop layer, afterwards, OK, it
It is individual in a line afterwards), the position of 8a and the coordinate (according to the rule described in 1.) of point set are released therebetween.Simultaneously for each 8a is added
The massive index and index.
5. data are extracted：As a example by extracting an initial data gitter cell hexahedron, according to its position, (grid is numbered
(xi, yi, zi)) the index order (according to the rule described in 1.) of the 8a point set neighbour with it is released, afterwards according to 8a point sets
Order, searches index, reduces 8a point sets, the summit (being extracted according to search index) needed for extracting current data cell.For every
Each summit of individual initial data gitter cell so operates, you can (reduction is to be reduced to one data gitter cell of reduction
The form packing of the data of the original tissue of the hexahedral data of Dark grey is to extract grayish storage to be pressed as a kind of
The form of the form of contracting).Reduce all cells and just obtain whole initial data.
The effect of the inventive method is illustrated below by a test：
Test content：One vip formatted file of 10,000,000 grids is packed and is stored, then unpack storage, therebetween to packing
With the arithmetic section timing for unpacking, the result using the inventive method is：Packing used time 1000ms, unpacks used time 300ms.And it is sharp
The time is packed for 8 seconds with prior art, and the time that unpacks is 3 seconds or so.That is it is respectively using the speed of the inventive method
8 times of prior art and 10 times.
Above-mentioned technical proposal is one embodiment of the present invention, for those skilled in the art, at this
On the basis of disclosure of the invention application process and principle, it is easy to make various types of improvement or deformation, this is not limited solely to
The method described by above-mentioned specific embodiment is invented, therefore previously described mode is preferred, and simultaneously without limitation
The meaning of property.
Claims (2)
1. a kind of extensive geological model of oil accumulation data are rapidly loaded method, it is characterised in that：Methods described is to Corner-point Grids
The initial data of storage carries out following treatment：
(1) determination and name in orientation：Definition center hexahedron, the hexahedral eight summits difference in each center is correspondingly
One initial data gitter cell hexahedron adjacent thereto of association；
(2) coordinate set is set up：The coordinate on the hexahedral summit in all of center is put together and saves as a point coordinates set,
The coordinate of the point for being completely superposed only is stored once；
(3) index is set up：For each center hexahedron, the start bit of the set of its apex coordinate is recorded using massive index
Put, use the relative displacement on small each of which summit of index record；The relative displacement refers to that other each summits are relative
In the relative displacement of the original position of the set of apex coordinate；
(4) data packing：According to the structure of initial data with all data of triple scan rounds, while the center of acquisition is hexahedral
Position and the coordinate of point set, and be each center hexahedron the addition massive index and small index；
Wherein, further included after the step (4)：
(5) data are extracted：Obtained and the hexahedral point in center near it according to the hexahedral position of initial data gitter cell
The order of the massive index of collection, afterwards according to the order of the hexahedral point set in center, searches small index, reduces the hexahedral point in center
Collection, the summit needed for extracting current initial data gitter cell hexahedron；Then each to each initial data gitter cell
Summit repeats this step, you can reduction obtains an initial data gitter cell hexahedron；Reduce all initial data grids
Cell hexahedron just obtains whole initial data.
2. extensive geological model of oil accumulation data according to claim 1 are rapidly loaded method, it is characterised in that：The step
Suddenly three recirculate and refer in (4)：According to the sequential loop of layer during outer loop, according to capable sequential loop when middle level is circulated, most
According to the individual sequential loop in a line during interior loop.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310259671.5A CN104252547B (en) | 2013-06-26 | 2013-06-26 | A kind of extensive geological model of oil accumulation data are rapidly loaded method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310259671.5A CN104252547B (en) | 2013-06-26 | 2013-06-26 | A kind of extensive geological model of oil accumulation data are rapidly loaded method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104252547A CN104252547A (en) | 2014-12-31 |
| CN104252547B true CN104252547B (en) | 2017-06-06 |
Family
ID=52187437
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310259671.5A Active CN104252547B (en) | 2013-06-26 | 2013-06-26 | A kind of extensive geological model of oil accumulation data are rapidly loaded method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104252547B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105956707A (en) * | 2016-05-09 | 2016-09-21 | 王君岳 | Method of optimizing oil reservoir monitoring system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1956011A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Automatic constructing method of irregular three-D geological geometric block |
| CN1956009A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Presenting method of large scale three-D data set |
| US7373473B2 (en) * | 2004-03-10 | 2008-05-13 | Leica Geosystems Hds Llc | System and method for efficient storage and manipulation of extremely large amounts of scan data |
-
2013
- 2013-06-26 CN CN201310259671.5A patent/CN104252547B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7373473B2 (en) * | 2004-03-10 | 2008-05-13 | Leica Geosystems Hds Llc | System and method for efficient storage and manipulation of extremely large amounts of scan data |
| CN1956011A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Automatic constructing method of irregular three-D geological geometric block |
| CN1956009A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Presenting method of large scale three-D data set |
Non-Patent Citations (1)
| Title |
|---|
| 一般多边形网格的几何压缩;许栋 等;《计算机辅助设计与图形学学报》;20020930;第14卷(第9期);815-819 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104252547A (en) | 2014-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111968231B (en) | Three-dimensional stratum modeling method based on geological map cutting section | |
| CN109271933A (en) | The method for carrying out 3 D human body Attitude estimation based on video flowing | |
| US11307049B2 (en) | Methods, apparatuses, systems, and storage media for storing and loading visual localization maps | |
| CN107944086A (en) | A kind of fast modeling method based on borehole data | |
| CN109102564B (en) | Coupling modeling method for numerical model of complex geologic body | |
| CN106960029B (en) | Method for extracting framing raster data across map geographical range | |
| CN101982837A (en) | Fast three-dimensional visualization method based on preprocessing result of finite-element analysis | |
| CN104966313B (en) | The geometrical shadow drawing method that triangle is rebuild | |
| CN107066562A (en) | A kind of storage method of satellite remote-sensing image data | |
| Dassi et al. | Efficient geometric reconstruction of complex geological structures | |
| CN104252547B (en) | A kind of extensive geological model of oil accumulation data are rapidly loaded method | |
| CN106649776A (en) | Method of semi-automating comprehensive vector polygon | |
| Wu et al. | Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-and-conquer scheme | |
| CN109558614B (en) | Simulation method and system for gas flow in shale gas reservoir multi-scale fracture | |
| Real et al. | Large-scale 3D geospatial processing made possible | |
| Zhang et al. | Automatic salt dome detection using U-net | |
| CN112634428A (en) | Porous medium three-dimensional image reconstruction method based on bidirectional cycle generation network | |
| Xu et al. | An approach to develop 3d Geo-DBMS topological operators by re-using existing 2d operators | |
| Ekkawong et al. | SMARTDRAIN: an intelligent workflow for well-placement optimisation by integrating streamlines time-of-flight and exhaustive search algorithm | |
| CN103984784B (en) | Diagram-model integrated visualization method and system for nuclear power plant | |
| JP2010152863A (en) | System and method for extracting boundary node, and program | |
| CN104407383B (en) | Parallel three-dimensional seismic illumination and analysis implementation method | |
| Zhao et al. | Reproducing 2D implicit curves with sharp features | |
| Bradley | Supporting data analytics for smart cities: an overview of data models and topology | |
| JP2019160254A (en) | Learning discrimination device and method for learning discrimination |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |