CN108446397A - A kind of method for quickly querying of million grades of Spatialite spatial databases - Google Patents
A kind of method for quickly querying of million grades of Spatialite spatial databases Download PDFInfo
- Publication number
- CN108446397A CN108446397A CN201810257277.0A CN201810257277A CN108446397A CN 108446397 A CN108446397 A CN 108446397A CN 201810257277 A CN201810257277 A CN 201810257277A CN 108446397 A CN108446397 A CN 108446397A
- Authority
- CN
- China
- Prior art keywords
- spot
- avgdist
- data
- slice
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
- G06F16/2433—Query languages
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Remote Sensing (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of simplified SQL statement, the method for quickly querying of million grades of Spatialite spatial databases of the difficulty and complexity for saving memory space, reduction user maintenance and data update, include the following steps：S1, Optimizing Queries, enter step S2 if not, enter step S5；S2, Virtual table is created；S3, the AvgDist for extracting figure spot；S4：Figure spot is sliced；S5, space querying enter step S6 if having, do not enter step S7；S6, input figure spot slice number is calculated；S7, structure SQL；S8, storage/access data, and return the result information.The present invention solves spatial index of the existing technology needs and is voluntarily safeguarded by user, build SQL statement complexity and calculating spatial index resource consumption is serious and caused cumbersome and awkward a series of problems of user's operation.
Description
Technical field
The invention belongs to database technical fields, and in particular to a kind of million grades of Spatialite spatial databases it is quick
Querying method.
Background technology
Spatialite is a simple, practical spatial data made of being extended based on SQLite PostgreSQL database engines
ACID (Atomicity- atomicities, Consistency- consistency, Isolation- isolations, Durability- are abided by library
Persistence) relational database management system characteristic and OGC standards, support cross-platform spatial data to operate.Spatialite is not only
With attribute data management function, by Geometry types also can management space data, be a typical space non-space number
According to the database of integrated management, the industries such as territory, forestry, agricultural, mapping are widely used in, especially in mobile office
Field is especially prominent.
Based on the types of applications system that million grades of Spatialite spatial databases are built, it is concentrated mainly on gradient map and looks into
It sees that browsing, field data acquisition, figure belong to and mutually looks into three aspects, wherein to ensure user experience and efficiency, gradient map is using slow
Mechanism to be deposited or is sliced to be processed original map, field data acquisition carries out real-time rendering and storage by api interface,
Figure belongs to mutually looking into carries out simple queries only for low volume data.With user to geographical information requirement it is continuous enhancing and information not
Disconnected abundant and perfect, user not only needs gradient map to check browsing, while needing thematic data, the geography information of basic data
System GIS analyses are positioned with statistics, figure spot.And basic data have the characteristics that position association, magnanimity, to realize GIS analysis with
Statistics, it is necessary to solve the space quick search of million grades of Spatialite mass datas.Currently, million grades of Spatialite are provided
There is space Indexing Mechanism to solve the search positioning function of massive spatial data, has the following problems：
(1) spatial index is voluntarily safeguarded by user, and maintenance difficulties and complexity are big, causes user's operation cumbersome；
(2) structure SQL statement is complicated；
(3) it is serious to calculate spatial index resource consumption, storage space occupancy is serious, causes inconvenient for use.
Invention content
For above-mentioned deficiency in the prior art, a kind of simplified SQL statement provided by the invention saves memory space, subtracts
The method for quickly querying of million grades of Spatialite spatial databases of the difficulty and complexity of few user maintenance and data update,
It solves spatial index needs of the existing technology voluntarily to be safeguarded by user, build SQL statement complexity and calculate spatial index
Resource consumption is serious and caused cumbersome and awkward a series of problems of user's operation, be widely used in territory, forestry,
Industries, the especially application in mobile office field such as agricultural and mapping are especially prominent.
In order to reach foregoing invention purpose, the technical solution adopted by the present invention is：
The method for quickly querying of a kind of million grades of Spatialite spatial databases, includes the following steps：
S1：Optimizing Queries：According to user ask tables of data judge million grades of Spatialite spatial databases whether into
It has gone optimization, S2 is entered step if not, enters step S5；
S2：Create Virtual table：Using SQL statement, the data table transmition that user in step S1 is asked is Virtual table；
S3：Extract the patch average distance AvgDist of figure spot：The minimum enclosed rectangle MBR of figure spot is extracted, is calculated by step
The AvgDist for the Virtual table that S2 is obtained；
S4：Figure spot is sliced：According to the MBR of the AvgDist of the figure spot obtained by step S3 and figure spot, figure spot slice letter is calculated
Breath；
S5：Space querying：In judgment step S1 user ask tables of data whether contain space querying information, if having into
Enter step S6, does not enter step S7 then；
S6：Calculate input figure spot slice number：According to the space querying information in step S5, extracts space input by user and sit
Information is marked, its corresponding figure spot slice number is calculated；
S7：Build SQL：The figure spot slice number obtained according to the tables of data containing space querying information and by step S6,
Or according to the tables of data without space querying information, build the SQL statement of data query and data storage；
S8：Storage/access data：The figure spot slice information obtained in step S4 is saved in the million grades of spaces Spatialite numbers
According to library, according to million grades of Spatialite spatial datas of SQL statement pair of data query and the data storage built in step S7
Library is read out or stores, and returns the result information.
This programme has the beneficial effect that：
Present method solves the GIS of million grades of Spatialite massive spatial datas analyses and statistics and figure spot search to position
Problem, therefore solve the problems such as user's operation in the prior art is cumbersome, inconvenient for use, SQL statement is simplified, saves and deposits
Storage space, the difficulty and complexity for reducing user maintenance and data update.
Further, the judgment method that whether million grades of Spatialite spatial databases are optimized in step S1,
Include the following steps：
S1-1：Judge whether tables of data is spatial data, if then entering step S1-2, otherwise enters step S2；
S1-2：Judge whether tables of data is Virtual table, if then entering step S1-3, otherwise enters step S2；
S1-3：Judge whether tables of data has carried out figure spot slice, if then entering step S5, otherwise enters step S2.
Further, in step S2 Virtual table creation method, include the following steps：
S2-1：The SQL statement definition of tables of data is extracted by SQL statement；
S2-2：The SQL statement of modification tables of data defines and creates the SQL statement of Virtual table；
S2-3：Execute the SQL statement of revised Virtual table.
Further, in step S3, the calculation formula of AvgDist is：
AvgDist is patch average distance in formula；Δ X is the X-coordinate difference for extracting figure spot；Δ Y is the Y seats for extracting figure spot
Mark difference；N is patch quantity；I numbers for current patch；Count (RowID) is the line number that static fields RowID occurs；
The calculation formula of Δ X is：
Δ X=MaxX-MinX
Δ X is X-coordinate difference in formula；MaxX is maximum X-coordinate；MinX is minimum X-coordinate；
The calculation formula of Δ Y is：
Δ Y=MaxY-MinY
Δ Y is Y coordinate difference in formula；MaxY is maximum Y coordinate；MinY is minimum Y coordinate.
Further, in step S4, the computational methods of figure spot slice information include the following steps：
S4-1：According to the MBR of the figure spot obtained by step S3, the minimum line number, minimum row number, maximum of figure spot slice are calculated
Line number and maximum row number；
S4-2：According to the minimum line number obtained by step S4-1, minimum row number, maximum line number and maximum row number, combine
To figure spot slice information.
Further, in step S4-1, calculation formula is：
MinR=int (MinX/AvgDist)
MinR is minimum line number in formula；MinX is minimum X-coordinate；AvgDist is patch average distance；
MinC=int (MinY/AvgDist)
MinC is minimum row number in formula；MinY is minimum Y coordinate；AvgDist is patch average distance；
MaxR=int (MaxX/AvgDist)
MaxR is maximum line number in formula；MaxX is maximum X-coordinate；AvgDist is patch average distance；
MaxC=int (MaxY/AvgDist)
MaxC is maximum row number in formula；MaxY is maximum Y coordinate；AvgDist is patch average distance.
Further, in step S6 figure spot slice number computational methods, include the following steps：
S6-1:Extract spatial coordinated information X ' and Y ' input by user；
S6-2:According to the spatial coordinated information X ' and Y ' obtained by step S6-1, the line number and row number of slice are calculated, is calculated
Formula is：
R=int (X'/AvgDist)
R is slice line number in formula；X ' is X-coordinate input by user；AvgDist is patch average distance；
C=int (Y'/AvgDist)
C is slice row number in formula；Y ' is Y coordinate input by user；AvgDist is patch average distance；
S6-3:According to the line number and row number of the slice obtained by step S6-2, combination obtains figure spot slice number.
Description of the drawings
Fig. 1 is the method for quickly querying flow chart of a kind of million grades of Spatialite spatial databases；
Fig. 2 is the judgment method flow chart whether million grades of Spatialite spatial databases are optimized；
Fig. 3 is the creation method flow chart of Virtual table；
Fig. 4 is the computational methods flow chart of figure spot slice information；
Fig. 5 is the computational methods flow chart of figure spot slice number；
Fig. 6 is universe figure；
Fig. 7 is partial enlarged view；
Fig. 8 is example figure spot figure.
Specific implementation mode
The specific implementation mode of the present invention is described below, in order to facilitate understanding by those skilled in the art this hair
It is bright, it should be apparent that the present invention is not limited to the ranges of specific implementation mode, for those skilled in the art,
As long as various change is in the spirit and scope of the present invention that the attached claims limit and determine, these variations are aobvious and easy
See, all are using the innovation and creation of present inventive concept in the row of protection.
In the embodiment of the present invention, the method for quickly querying of a kind of million grades of Spatialite spatial databases, including it is as follows
Step：
S1：Whether Optimizing Queries, i.e., the tables of data asked according to user judge million grades of Spatialite spatial databases
It is optimized, S2 is entered step if not, enter step S5；
The judgment method whether million grades of Spatialite spatial databases are optimized, as shown in Fig. 2, including as follows
Step：
S1-1：Judge whether tables of data is spatial data, if then entering step S1-2, otherwise enters step S2；
S1-2：Judge whether tables of data is Virtual table, if then entering step S1-3, otherwise enters step S2；
S1-3：Judge whether tables of data has carried out figure spot slice, if then entering step S5, otherwise enters step S2；
S2：Virtual table is created, that is, utilizes SQL statement, the data table transmition that user in step S1 is asked is Virtual table；
The creation method of Virtual table, as shown in figure 3, including the following steps：
S2-1：The SQL statement definition of tables of data is extracted by SQL statement, SQL statement is SELECT sqlFROM
Sqlite_master WHERE type='table'AND name=' request data tables table name '；
S2-2：The SQL statement of modification tables of data defines and creates the SQL statement of Virtual table；
S2-3：Execute the SQL statement of revised Virtual table；
S3：The patch average distance AvgDist of extraction figure spot, i.e. the minimum enclosed rectangle MBR, MinX of extraction figure spot,
MinY、MaxX、MaxY；
MinX=18379638.636；
MinY=3398200.575；
MaxX=18379953.816；
MaxY=3398474.082；
Calculate the AvgDist by the obtained Virtual tables of step S2；
The calculation formula of AvgDist is：
AvgDist is patch average distance in formula；Δ X is the X-coordinate difference for extracting figure spot；Δ Y is the Y seats for extracting figure spot
Mark difference；N is patch quantity；I numbers for current patch；Count (RowID) is the line number that static fields RowID occurs；
The calculation formula of Δ X is：
Δ X=MaxX-MinX
Δ X is X-coordinate difference in formula；MaxX is maximum X-coordinate；MinX is minimum X-coordinate；
The calculation formula of Δ Y is：
Δ Y=MaxY-MinY
Δ Y is Y coordinate difference in formula；MaxY is maximum Y coordinate；MinY is minimum Y coordinate；
Land-use System data share 217.2193 ten thousand figure spots, 7594.7032 ten thousand coordinate points, figure spot
It is illustrated as Fig. 6 universes figure, Fig. 7 partial enlarged views and Fig. 8 example figure spot figures.According to formulaAvgDist=114.594336242147 is calculated, for ease of subsequently calculating,
To AvgDist=115 after AvgDist roundings；
Its figure spot slice information is calculated from 2,170,000 figure spots from one figure spot of arbitrary selection, as 1 figure spot partial coordinates of table are believed
It ceases shown in table.
1 figure spot partial coordinates information table of table
S4：Figure spot is sliced, i.e., according to the MBR of AvgDist and figure spot by the obtained figure spots of step S3, with the soil in certain year
Ground utilizes present situation change survey data instance, and figure spot slice information is calculated according to algorithm；
The computational methods of figure spot slice information, as shown in figure 4, including the following steps：
S4-1：It is sat according to the MBR of the figure spot obtained by step S3, the i.e. minimum X-coordinate of figure spot, minimum Y coordinate, maximum X
Mark and maximum Y coordinate calculate minimum line number, minimum row number, maximum line number and the maximum row number of figure spot slice；
Calculation formula is：
MinR=int (MinX/AvgDist)
MinR is minimum line number in formula；MinX is minimum X-coordinate；AvgDist is patch average distance；
MinC=int (MinY/AvgDist)
MinC is minimum row number in formula；MinY is minimum Y coordinate；AvgDist is patch average distance；
MaxR=int (MaxX/AvgDist)
MaxR is maximum line number in formula；MaxX is maximum X-coordinate；AvgDist is patch average distance；
MaxC=int (MaxY/AvgDist)
MaxC is maximum row number in formula；MaxY is maximum Y coordinate；AvgDist is patch average distance.
It is calculated：
MinR=159822；
MinC=29549；
MaxR=159825；
MaxC=29551；
S4-2：According to the minimum line number obtained by step S4-2, minimum row number, maximum line number and maximum row number, combine
To figure spot slice information, the slice information of figure spot be expressed as letter r+MinR+ letter Cs+MinC+ "；”+…+“；"+letter r+
MaxR+ letter Cs+MaxC+ ".”：
R159822C29549；R159823C29549；R159824C29549；R159825C29549；
R159822C29550；R159823C29550；R159824C29550；R159825C29550；
R159822C29551；R159823C29551；R159824C29551；R159825C29551.
S5：Space querying, i.e. whether the tables of data that user asks in judgment step S1 contains space querying information, if having
S6 is entered step, does not enter step S7 then；
S6：It calculates input figure spot slice number and extracts space input by user that is, according to the space querying information in step S5
Coordinate information calculates its corresponding figure spot slice number；
The computational methods of figure spot slice number, as shown in figure 5, including the following steps：
S6-1:Extract spatial coordinated information X ' and Y ' input by user；
S6-2:According to the spatial coordinated information X ' and Y ' obtained by step S6-1, the line number and row number of slice are calculated, is calculated
Formula is：
R=int (X'/AvgDist)
R is slice line number in formula；X ' is X-coordinate input by user；AvgDist is patch average distance；
C=int (Y'/AvgDist)
C is slice row number in formula；Y ' is Y coordinate input by user；AvgDist is patch average distance；
S6-3:According to the line number and row number of the slice obtained by step S6-2, combination obtains figure spot slice number, figure spot slice
Number it is：Letter r+slice line number R+ letter Cs+slice row number C.
S7：SQL is built, i.e., the figure spot obtained according to the tables of data containing space querying information and by step S6 is sliced
Number, set the following querying condition sentence of addition in the first place of querying condition：Data table name match ' * figure spots slice number * ' and or root
According to the tables of data without space querying information, the SQL statement of data query and data storage is built；
S8：The figure spot slice information obtained in step S4 is saved in million grades of spaces Spatialite by storage/access data
Database, according to the million grades of spaces Spatialite numbers of SQL statement pair of data query and the data storage built in step S7
It is read out or stores according to library, and return the result information.
Application case：
(1) Spatialite spatial databases essential information：
Data volume：227.7 ten thousand；
Table name：dltb_h_2014_Opt；
Field quantity：62；
Spatial data field name：Geometry.
(2) data query tool：
Spatialite_gui 2.0.0。
(3) data query requirement：
All figure spots of inquiry and coordinate points (18412676.254,3394107.914) intersection.
(4) optimize preceding SQL statement and take：
SQL statement：SELECT*FROM"dltb_h_2014_Opt"
Where intersects(geomfromtext('point(18412676.254 3394107.914)'),
geometry)>0。
It takes：1min7s.
(5) optimize after SQL statement and take：
SQL statement：SELECT*FROM"dltb_h_2014_Opt"
where dltb_h_2014_opt match'*R46031C8485*'
and intersects(geomfromtext('point(18412676.254 3394107.914)'),
geometry)>0。
It takes：0.031s.
The present invention provides a kind of simplified SQL statement, the difficulty saved memory space, reduce user maintenance and data update
With the method for quickly querying of million grades of Spatialite spatial databases of complexity, solves Spatial Cable of the existing technology
Draw needs voluntarily to be safeguarded by user, build SQL statement complexity and calculating spatial index resource consumption is serious and caused user
Cumbersome and awkward a series of problems, is widely used in the industries such as territory, forestry, agricultural and mapping, is especially moving
The application of dynamic office realm is especially prominent.
Claims (7)
1. the method for quickly querying of a kind of million grades of Spatialite spatial databases, which is characterized in that include the following steps：
S1：Optimizing Queries：The tables of data asked according to user judges whether million grades of Spatialite spatial databases carry out
Optimization, S2 is entered step if not, enters step S5；
S2：Create Virtual table：Using SQL statement, the data table transmition that user in step S1 is asked is Virtual table；
S3：Extract the patch average distance AvgDist of figure spot：The minimum enclosed rectangle MBR of figure spot is extracted, calculating is obtained by step S2
The AvgDist of the Virtual table arrived；
S4：Figure spot is sliced：According to the MBR of the AvgDist of the figure spot obtained by step S3 and figure spot, figure spot slice information is calculated,
Enter step S8；
S5：Space querying：Whether the tables of data that user asks in judgment step S1 contains space querying information, and step is entered if having
Rapid S6, does not enter step S7 then；
S6：Calculate input figure spot slice number：According to the space querying information in step S5, space coordinate letter input by user is extracted
Breath, calculates its corresponding figure spot slice number；
S7：Build SQL：The figure spot slice number or root obtained according to the tables of data containing space querying information and by step S6
According to the tables of data without space querying information, the SQL statement of data query and data storage is built；
S8：Storage/access data：The figure spot slice information obtained in step S4 is saved in million grades of Spatialite spatial datas
Library, according to million grades of Spatialite spatial databases of SQL statement pair of data query and the data storage built in step S7
It is read out or stores, and return the result information.
2. the method for quickly querying of according to claim 1 million grades of Spatialite spatial databases, which is characterized in that
The judgment method that whether million grades of Spatialite spatial databases are optimized in the step S1, includes the following steps：
S1-1：Judge whether tables of data is spatial data, if then entering step S1-2, otherwise enters step S2；
S1-2：Judge whether tables of data is Virtual table, if then entering step S1-3, otherwise enters step S2；
S1-3：Judge whether tables of data has carried out figure spot slice, if then entering step S5, otherwise enters step S2.
3. the method for quickly querying of according to claim 1 million grades of Spatialite spatial databases, which is characterized in that
The creation method of Virtual table, includes the following steps in the step S2：
S2-1：The SQL statement definition of tables of data is extracted by SQL statement；
S2-2：The SQL statement of modification tables of data defines and creates the SQL statement of Virtual table；
S2-3：Execute the SQL statement of revised Virtual table.
4. the method for quickly querying of according to claim 1 million grades of Spatialite spatial databases, which is characterized in that
In the step S3, the calculation formula of AvgDist is：
AvgDist is patch average distance in formula；Δ X is the X-coordinate difference for extracting figure spot；Δ Y is that the Y coordinate of extraction figure spot is poor
Value；N is patch quantity；I numbers for current patch；Count (RowID) is the line number that static fields RowID occurs；
The calculation formula of Δ X is：
Δ X=MaxX-MinX
Δ X is X-coordinate difference in formula；MaxX is maximum X-coordinate；MinX is minimum X-coordinate；
The calculation formula of Δ Y is：
Δ Y=MaxY-MinY
Δ Y is Y coordinate difference in formula；MaxY is maximum Y coordinate；MinY is minimum Y coordinate.
5. the method for quickly querying of according to claim 1 million grades of Spatialite spatial databases, which is characterized in that
In the step S4, the computational methods of figure spot slice information include the following steps：
S4-1：According to the MBR of the figure spot obtained by step S3, the minimum line number, minimum row number, maximum line number of figure spot slice are calculated
With maximum row number；
S4-2：Figure is obtained according to the minimum line number obtained by step S4-1, minimum row number, maximum line number and maximum row number, combination
Spot slice information.
6. the method for quickly querying of according to claim 5 million grades of Spatialite spatial databases, which is characterized in that
In the step S4-1, calculation formula is：
MinR=int (MinX/AvgDist)
MinR is minimum line number in formula；MinX is minimum X-coordinate；AvgDist is patch average distance；
MinC=int (MinY/AvgDist)
MinC is minimum row number in formula；MinY is minimum Y coordinate；AvgDist is patch average distance；
MaxR=int (MaxX/AvgDist)
MaxR is maximum line number in formula；MaxX is maximum X-coordinate；AvgDist is patch average distance；
MaxC=int (MaxY/AvgDist)
MaxC is maximum row number in formula；MaxY is maximum Y coordinate；AvgDist is patch average distance.
7. the method for quickly querying of according to claim 1 million grades of Spatialite spatial databases, which is characterized in that
The computational methods of figure spot slice number, include the following steps in the step S6：
S6-1:Extract spatial coordinated information X ' and Y ' input by user；
S6-2:According to the spatial coordinated information X ' and Y ' obtained by step S6-1, the line number and row number of slice, calculation formula are calculated
For：
R=int (X'/AvgDist)
R is slice line number in formula；X ' is X-coordinate input by user；AvgDist is patch average distance；
C=int (Y'/AvgDist)
C is slice row number in formula；Y ' is Y coordinate input by user；AvgDist is patch average distance；
S6-3:According to the line number and row number of the slice obtained by step S6-2, combination obtains figure spot slice number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810257277.0A CN108446397B (en) | 2018-03-27 | 2018-03-27 | Method for rapidly querying million-level spatiale spatial database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810257277.0A CN108446397B (en) | 2018-03-27 | 2018-03-27 | Method for rapidly querying million-level spatiale spatial database |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108446397A true CN108446397A (en) | 2018-08-24 |
| CN108446397B CN108446397B (en) | 2022-05-20 |
Family
ID=63196764
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810257277.0A Active CN108446397B (en) | 2018-03-27 | 2018-03-27 | Method for rapidly querying million-level spatiale spatial database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108446397B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7002572B1 (en) * | 2002-06-19 | 2006-02-21 | Cadence Design Systems, Inc. | Method and apparatus for constructing a convex polygon that encloses a set of points in a region |
| US20110280453A1 (en) * | 2004-07-09 | 2011-11-17 | Ching-Chien Chen | System and Method for Fusing Geospatial Data |
| CN102521254A (en) * | 2011-11-17 | 2012-06-27 | 广东电网公司电力科学研究院 | Uniform access method of isomeric database |
| CN103049517A (en) * | 2012-12-17 | 2013-04-17 | 上海市房屋土地资源信息中心 | Method and system for discriminating changeable graphic spot in dynamic monitoring of present situation of land use |
| CN103198151A (en) * | 2013-04-24 | 2013-07-10 | 北京航空航天大学 | Index inquiry system and method for running information of regional urban buses |
| CN103559209A (en) * | 2013-10-10 | 2014-02-05 | 河南大学 | Method for querying nearest neighbor of efficient space combined by Voronoi Diagram and virtual grids |
| CN104298734A (en) * | 2014-09-30 | 2015-01-21 | 东南大学 | Mobile updating method for change pattern spots in land use status change survey |
| CN104915748A (en) * | 2015-04-01 | 2015-09-16 | 中国石油大学(华东) | Land-use-tax novel acquisition system based on mobile GIS |
| CN105630968A (en) * | 2015-12-23 | 2016-06-01 | 华中师范大学 | Distributed expandable quadtree indexing mechanism oriented to Cassandra and query method based on mechanism |
| CN106091985A (en) * | 2016-06-07 | 2016-11-09 | 西安交通大学 | A kind of three-dimensional acquisition device and 3 D scanning system |
| CN106294575A (en) * | 2016-07-21 | 2017-01-04 | 国家***调查规划设计院 | A kind of forest land based on Lucene figure speckle vector data querying method |
| CN106599129A (en) * | 2016-12-02 | 2017-04-26 | 山东科技大学 | Multi-beam point cloud data denoising method considering terrain characteristics |
| CN106933833A (en) * | 2015-12-30 | 2017-07-07 | 中国科学院沈阳自动化研究所 | A kind of positional information method for quickly querying based on Spatial Data Index Technology |
-
2018
- 2018-03-27 CN CN201810257277.0A patent/CN108446397B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7002572B1 (en) * | 2002-06-19 | 2006-02-21 | Cadence Design Systems, Inc. | Method and apparatus for constructing a convex polygon that encloses a set of points in a region |
| US20110280453A1 (en) * | 2004-07-09 | 2011-11-17 | Ching-Chien Chen | System and Method for Fusing Geospatial Data |
| CN102521254A (en) * | 2011-11-17 | 2012-06-27 | 广东电网公司电力科学研究院 | Uniform access method of isomeric database |
| CN103049517A (en) * | 2012-12-17 | 2013-04-17 | 上海市房屋土地资源信息中心 | Method and system for discriminating changeable graphic spot in dynamic monitoring of present situation of land use |
| CN103198151A (en) * | 2013-04-24 | 2013-07-10 | 北京航空航天大学 | Index inquiry system and method for running information of regional urban buses |
| CN103559209A (en) * | 2013-10-10 | 2014-02-05 | 河南大学 | Method for querying nearest neighbor of efficient space combined by Voronoi Diagram and virtual grids |
| CN104298734A (en) * | 2014-09-30 | 2015-01-21 | 东南大学 | Mobile updating method for change pattern spots in land use status change survey |
| CN104915748A (en) * | 2015-04-01 | 2015-09-16 | 中国石油大学(华东) | Land-use-tax novel acquisition system based on mobile GIS |
| CN105630968A (en) * | 2015-12-23 | 2016-06-01 | 华中师范大学 | Distributed expandable quadtree indexing mechanism oriented to Cassandra and query method based on mechanism |
| CN106933833A (en) * | 2015-12-30 | 2017-07-07 | 中国科学院沈阳自动化研究所 | A kind of positional information method for quickly querying based on Spatial Data Index Technology |
| CN106091985A (en) * | 2016-06-07 | 2016-11-09 | 西安交通大学 | A kind of three-dimensional acquisition device and 3 D scanning system |
| CN106294575A (en) * | 2016-07-21 | 2017-01-04 | 国家***调查规划设计院 | A kind of forest land based on Lucene figure speckle vector data querying method |
| CN106599129A (en) * | 2016-12-02 | 2017-04-26 | 山东科技大学 | Multi-beam point cloud data denoising method considering terrain characteristics |
Non-Patent Citations (10)
| Title |
|---|
| ABDUL JHUMMARWALA 等: "Comparative Evaluation of Various Indexing Techniques of Geospatial Vector Data for Processing in Distributed Computing Environment", 《PROCEEDINGS OF THE 9TH ANNUAL ACM INDIA CONFERENCE》 * |
| LIN W H 等: "A new directional query method for polygon dataset in spatial database", 《EARTH SCIENCE INFORMATICS》 * |
| LIUXUPIAOSHI: "ArcGIS计算图斑的四邻坐标(XMin,XMax,YMin,YMax)", 《HTTPS://BLOG.CSDN.NET/LIUXUPIAOSHI/ARTICLE/DETAILS/46848129》 * |
| 卢蓉 等: "一种提取目标图像最小外接矩形的快速算法", 《计算机工程》 * |
| 徐静波 等: "基于Android平台的土地变更数据移动采集***的设计与实现", 《勘察科学技术》 * |
| 李玲 等: "基于Spatialite轻量级空间数据库的GIS数据管理", 《地理信息世界》 * |
| 柯舒: "面向空间数据分布特征的自适应地图可视化", 《中国优秀博硕士学位论文全文数据库(博士)基础科学辑》 * |
| 牛艳霞 等: "嵌入式Web服务器的Android空间数据离线解决方法", 《测绘科学》 * |
| 郑宇志 等: "图斑编号方法探索及其实现", 《地理空间信息》 * |
| 陈建裕等: "高分辨率海岸带遥感影像中简单地物的最优分割问题", 《中国科学(D辑:地球科学)》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108446397B (en) | 2022-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106933833B (en) | Method for quickly querying position information based on spatial index technology | |
| US8200612B2 (en) | Efficient SQL access to multidimensional data | |
| US8209280B2 (en) | Exposing multidimensional calculations through a relational database server | |
| CN103049554B (en) | A kind of vector QR tree parallel index method | |
| CN112115198A (en) | Urban remote sensing intelligent service platform | |
| CN102867066B (en) | Data Transform Device and data summarization method | |
| CN103399926A (en) | Water conservancy general survey data multidimensional analysis and service system and encapsulation and achieving method thereof | |
| CN111639075B (en) | Non-relational database vector data management method based on flattened R tree | |
| Zhang et al. | Management methods of spatial data based on PostGIS | |
| CN102867065B (en) | Based on Data Transform Device and the method for relevant database | |
| CN103678682B (en) | Magnanimity raster data processing and management method based on abstraction templates | |
| KR101255639B1 (en) | Column-oriented database system and join process method using join index thereof | |
| Zhang et al. | An approach to enabling spatial OLAP by aggregating on spatial hierarchy | |
| CN108446397A (en) | A kind of method for quickly querying of million grades of Spatialite spatial databases | |
| CN102236721B (en) | Method for extracting complex window space information in space data engine | |
| CN115712667B (en) | Graph data fusion analysis method, device and storage medium | |
| CN114860860B (en) | Method for constructing GIS data structure based on geographic element interaction mechanism | |
| CN105654137A (en) | Mass remote sensing data classification and organization method | |
| CN107844538B (en) | Comprehensive disaster prevention and reduction planning data management system and method for mountainous villages and towns | |
| CN107480220B (en) | Rapid text query method based on online aggregation | |
| Saidi | Fundamental Terms and Conceptions in Physical-Spatial Planning (part ll) | |
| Li et al. | A new HR-tree index based on hash address | |
| CN110781245A (en) | Method for constructing national culture knowledge data warehouse | |
| CN110795449A (en) | BS architecture-based environment-friendly public opinion system | |
| Bogorny et al. | Spatial data preparation for knowledge discovery |
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 |