CN101789028A - Search engine for geographical position and constructing method thereof - Google Patents
Search engine for geographical position and constructing method thereof Download PDFInfo
- Publication number
- CN101789028A CN101789028A CN201010127869A CN201010127869A CN101789028A CN 101789028 A CN101789028 A CN 101789028A CN 201010127869 A CN201010127869 A CN 201010127869A CN 201010127869 A CN201010127869 A CN 201010127869A CN 101789028 A CN101789028 A CN 101789028A
- Authority
- CN
- China
- Prior art keywords
- layer
- tree
- quadtree
- node
- data
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a search engine for a geographical position and a constructing method thereof. The search engine is in a quad-tree structure and comprises M layers which are overlapped from top to bottom, wherein the first layer comprises a quad-tree node representing the whole map; the quad-tree node comprises a B tree established according to at least one attribute of a search object; the Mth layer respectively comprises 4M-1 quad-tree nodes representing 1/4M-1 of the whole map; and each quad-tree node comprises 0-1 B tree established according to at least one attribute of the search object, i.e. the Mth layer comprises (4M-1-X) B trees, M is a natural integer and decided by the data volume imported from a database and X is the number of the B trees which are not established since data imported into the Mth layer are inconsistent with data in the designated geographical position range. The search engine for the geographical position is formed by compositely constructing a plurality of index phases representing a plurality of attributes of the search objects. The invention can effectively improve the search efficiency, reduce the load of a computer and improve the response speed.
Description
Technical field
The present invention relates to a kind of search engine and construction method thereof, be specifically related to a kind of will be corresponding to the mutually compound search engine for geographical position and the construction method thereof of index of at least two kinds of different attributes of object search.
Background technology
Up to ten million data objects is arranged in the database of search engine, and each object all has own longitude and latitude position and the timestamp that occurs for the last time on world map, and these objects have some other attribute simultaneously, such as: age, sex etc.If need in some application scenarioss, the user need in certain scope of map, (such as in the geographic coverage of Shanghai) searching sex be the woman, age is at the 20-25 object in year, and arrange preceding 100 by the time inverted order that occurs, be presented on the map according to their longitude and latitude.Final effect is that the user can screen the object of specifying in the geographic range according to the hobby of oneself, carries out next step operation.And existing database technology (no matter being oracle, mysql, informix etc.) is wanted up to ten million, even is realized the demand in more than one hundred million objects, and calculated amount is very large.
Particularly, for the demand, existing search engine technique can select for use two kinds of methods to carry out data base querying usually:
First method is that database will filter out the object (geographical index priority principle) that meets the geographic position condition earlier, then these objects is sorted by the time, carries out the coupling of age, sex then, obtains a result at last.The method is fit to geographic range hour to be used, and for example only in the search of the pudong airport in Shanghai, may satisfy result's thousand of data deficiencies, and then these data according to time sequence can be very fast, and Search Results can obtain very soon.
Second method is that database is selected object (time index priority principle), the geographic position of match objects, age, sex then by the time inverted order earlier.Use when the suitable geographic range of the method is big,, utilize time index so this moment earlier such as seeking on the scope that accounts for whole map 80% at area, draw the inverted order result very soon, each result is gone to mate the geographic position condition, and satisfied possibility is very big, and Search Results also can obtain very soon.
But on the condition setting that these two methods are selected is very difficult, key just is how to divide less or big these two notions of geographic range. and perhaps area accounts for neither one object in the scope of whole map 80%, all objects all concentrate in other scopes of 20%, to wait so mated all objects just can go out Search Results.Perhaps extreme case is in the search of the pudong airport in Shanghai, and the data that may satisfy the result have up to a million, and these data calculated amount according to time sequence also is very large, and search time also can be very long.
Summary of the invention
The objective of the invention is to propose a kind of search engine for geographical position and construction method thereof, it can effectively improve search efficiency, alleviates computer load, improves its response speed, thereby overcomes deficiency of the prior art.
For achieving the above object, the present invention has adopted following technical scheme:
A kind of search engine for geographical position, it is characterized in that, this search engine is a quaternary tree shape structure, it comprises folded successively from top to bottom M the layer of establishing, wherein, the 1st layer of quadtree's node that comprises 1 whole map of representative, this quadtree's node comprise 1 B tree of setting up by at least a attribute of object search, and the M layer comprises 4 respectively
M-1Individual 1/4 of the whole map of representing respectively
M-1Quadtree's node, each quadtree's node comprises 0～1 B tree of setting up by at least a attribute of object search, that is, the M layer comprises (4 altogether
M-1-X) B sets, and above-mentioned M is a natural number, and it is by the data volume decision of pouring into from database, and X is because of the unfounded B tree of the data that do not meet the specified geographic location scope in the data of pouring the M layer into quantity.
Particularly, the quaternary tree shape structure of described search engine is to generate simultaneously in pouring the process of data into, and its detailed process is:
Pour data into from database, just having begun data pours into and rests on ground floor and set up B tree, when data volume when ground floor surpasses N, the B tree of ground floor is when continuing to increase data volume, beginning is division downwards, judgment data belongs to which B tree of the second layer, and pour the second layer into, when the data volume of certain B tree of the second layer also reaches N, promptly also begin downward division, judgment data belongs to which B tree of the 3rd layer, and be poured in the 3rd layer, by that analogy, fallen until data, finish the foundation of quaternary tree shape structure, but above-mentioned N represents each B tree data carried by data amount.
This search engine comprises M layer, wherein:
The 1st layer comprises a quadtree's node representing whole map, and this quadtree's node comprises a B tree of setting up by at least a attribute of object search;
The 2nd layer comprises four quadtree's nodes of 1/4th of representing above-mentioned map respectively, and these four quadtree's nodes are pressed matrix pattern and distributed, and each quadtree's node comprises 0～1 B tree of setting up by at least a attribute of object search;
The 3rd layer comprises 16 quadtree's nodes, wherein, represents four quadtree's nodes of 1/4th of one of four parts of maps in the 2nd layer to press matrix pattern and distributes, and each quadtree's node comprises 0～1 B tree of setting up by at least a attribute of object search;
4th, 5, the structure of 6......M layer by that analogy.
The construction method of geographical as mentioned above location finding engine is characterized in that, this method is:
Employing makes up the quaternary tree of a M layer with the geographic position attribute and the mutually compound mode of another kind of at least property index of object search;
Pour data into from database, original date is poured into and is rested on the 1st layer that comprises 1 quadtree's node, and sets up 1 B tree on this quadtree's node;
When data volume when surpassing N for the 1st layer, the 1st layer B tree is when continuing to increase data volume, beginning is division downwards, and judgment data belongs to the 2nd layer which of four quadtree's nodes, then pours the second layer into, is setting up the B tree on corresponding quadtree's node;
When the data volume of certain B of second layer tree also reaches N, also begin downward division, be poured into the 3rd layer, and on the 3rd layer corresponding quadtree's node, set up the B tree;
By that analogy, pending data is poured into and is finished, and promptly form based on quaternary tree and B and set the search engine for geographical position that combines, but above-mentioned N is each B tree data carried by data amount.
Further say, in this method,, then on this quadtree's node, set up the B tree if pour the data of the specified geographic location attribute of the object search that comprises certain quadtree's node that meets the M layer in the data of M layer into by (M-1) layer, otherwise, then can not set up the B tree on this quadtree's node.
In this method, be on quadtree's node, to set up the B tree by the another kind of at least attribute of object search.
Described search engine for geographical position comprises the M layer, wherein:
The 1st layer comprises a quadtree's node representing whole map, and this quadtree's node comprises a B tree of setting up by the another kind of at least attribute of object search;
The 2nd layer comprises four quadtree's nodes of 1/4th of representing above-mentioned map respectively, and these four quadtree's nodes are pressed matrix pattern and distributed, and each quadtree's node comprises 0～1 B tree of setting up by the another kind of at least attribute of object search;
The 3rd layer comprises 16 quadtree's nodes, wherein, represents four quadtree's nodes of 1/4th of one of four parts of maps in the 2nd layer to press matrix pattern and distributes, and each quadtree's node comprises 0～1 B tree of setting up by the another kind of at least attribute of object search;
4th, 5, the structure of 6......M layer by that analogy.
The present invention adopts the mutually compound design of index with the geographic index of object search and another kind of at least attribute (as time attribute etc.), promptly, when selecting the data of the geographic position attribute that meets object search, in advance these data are pressed the another kind of at least attribute ordering of object search, thereby raising search efficiency, thereby solved computer load height in the prior art, the problem of low-response.
Description of drawings
Fig. 1 is the structural representation of search engine for geographical position in the specific embodiment of the invention.
Embodiment
Below in conjunction with the drawings and the specific embodiments content of the present invention is described further.
As shown in Figure 1, search engine for geographical position is a quaternary tree shape structure in the present embodiment, it comprises the M layer, wherein each layer is made up of some B trees, as, the 1st layer of whole map of representative, has only a quadtree's node, this quadtree's node comprises a B tree of setting up by at least a attribute of object search, and the 2nd layer is that the 1st layer map is divided into four nodes by " field " font, and each node is represented 1/4th maps of last layer, under perfect condition, each node has a B tree, and totally four B trees also are to set up by at least a attribute of object search, the 3rd layer of each part map the 2nd layer is divided into four parts of maps, B of each part correspondence tree, totally 16 B trees under the perfect condition, the 4th, 5,6......M the structure of layer by that analogy.
Certainly, it is pointed out that above-mentioned quad-tree structure is to generate simultaneously in pouring the process of data into, rather than before pouring data into, just set up well that its detailed process is:
Pour data into from database, just having begun data pours into and rests on the 1st layer and set up B tree, when data volume when surpassing N for the 1st layer, the 1st layer B tree is when continuing to increase data volume, beginning is division downwards, judgment data belongs to which B tree of the 2nd layer, pour the 2nd layer into, when the data volume of the 2nd layer certain B tree also reaches N, also begin to divide downwards in the B tree that is poured into the 3rd layer, by that analogy, data are poured into and are finished, and quad-tree structure is set up and finished.
In this process, each object search all might be in quad-tree structure which floor in occur, that is to say that data have certain redundance, increase along with data, redundance can increase gradually. but effectively effect is when specifying a certain geographic range, certain one deck that can navigate to quad-tree structure is rapidly searched for, and the data in the B of each layer tree are arranged by at least a attribute, so can find data to be looked into very soon.
Need to prove simultaneously, the B tree quantity that is not each layer all is full quaternary tree, such as the 2nd layer of four B tree not necessarily, if in the mouth in the upper left corner of " field " font, do not meet the data of this geographical position, this B tree can not set up, in addition, above-mentioned N is according to the configuration of data volume and server and fixed, and is not changeless.
Below be that 16 layers of quad-tree structure are example explanation with search engine for geographical position:
1. 16 layers of quaternary tree:
A. layered approach:
The All Around The World map is a ground floor, it is a rectangle first node of quaternary tree just, ground floor carry out matrix pattern be divided into four rectangles promptly four nodes as the second layer, respectively each piece matrix pattern is divided into four rectangles as the 3rd layer again, is divided into the 16 layer of later fixing tentatively by that analogy and no longer cuts apart.
B. stratified condition:
Stratified condition is dynamic variable N, decide by server configures on data volume, data volume in each rectangle surpasses N, then keeping former data and a downward split layer counts according to redundancy. as seen on one deck, not that each node all can have child node, so neither necessarily have four child nodes. not necessarily expire quaternary tree.
C. node serial number:
Numbering principle: from left to right, number 1234 (with reference to the quadrant method for numbering serial) from top to bottom
Ground floor node serial number: 0 (is 0 so ground floor has only a node to number more special)
Second layer numbering: 01,02,03,04
The 3rd layer of numbering: 011,012,013,014,021,022,023,024,031,032,033,034
....
The 16 layer of numbering: 0111111111111111,0111111111111112......
2.B tree:
A. the data on each quadtree's node have a b-tree indexed, single index or composite index.
3. Position Number:
All there is a numbering that generates according to the structure of quaternary tree each position (longitude, latitude).
For example: numbering 0231232421243212 point, its can be at each node 0,02,023,0231, and the last redundancy of 02312.... does not exist up to the node below a certain node layer wherein.
4. searching of given rectangular extent:
A given rectangle, quaternary tree Area Node algorithm can be found out the some nodes that are fit to this rectangle, and the scope of these nodes must be to cover former rectangle,
For example: the node of rectangle (9889143,1515299,11330935,2891555) is
014234?014243?014312?014321?0142313?0142314?0142423?01424242
01424243?01424244?01431311?01431312?01431321?01431322?0143241101432412
01432421?014242413
5. quaternary tree Area Node algorithm:
General principle: find out and to cover this regional all nodes that minimum zone comprised.
Other principles: some node does not exist, and then looks for its father node, and some the initial relatively place of layer, node place layer is dark (generally down looking for 5 layers) too, then uses its father node.
Certainly, in actual applications, those skilled in the art are according to concrete needs, also can adopt one or more attribute to meet, form a kind of index, and the another kind of or multiple attribute of object search is met object search, form another kind of index, then capable compound again with these two or more index, and, construct proper search engine according to being equal to above-mentioned design.
Above embodiment only is used to illustrate content of the present invention; in addition; the present invention also has other embodiments, as long as those skilled in the art because of technology involved in the present invention enlightenment, replace or technical scheme that the equivalent deformation mode forms all drops in protection scope of the present invention and adopt to be equal to.
Claims (7)
1. search engine for geographical position, it is characterized in that, this search engine is a quaternary tree shape structure, it comprises folded successively from top to bottom M the layer of establishing, wherein, the 1st layer of quadtree's node that comprises 1 whole map of representative, this quadtree's node comprise 1 B tree of setting up by at least a attribute of object search, and the M layer comprises 4 respectively
M-1Individual 1/4 of the whole map of representing respectively
M-1Quadtree's node, each quadtree's node comprises 0～1 B tree of setting up by at least a attribute of object search, that is, the M layer comprises (4 altogether
M-1-X) B sets, and above-mentioned M is a natural number, and it is by the data volume decision of pouring into from database, and X is because of the unfounded B tree of the data that do not meet the specified geographic location scope in the data of pouring the M layer into quantity.
2. search engine for geographical position according to claim 1 is characterized in that, the quaternary tree shape structure of described search engine is to generate simultaneously in pouring the process of data into, and its detailed process is:
Pour data into from database, just having begun data pours into and rests on ground floor and set up B tree, when data volume when ground floor surpasses N, the B tree of ground floor is when continuing to increase data volume, beginning is division downwards, judgment data belongs to which B tree of the second layer, and pour the second layer into, when the data volume of certain B tree of the second layer also reaches N, promptly also begin downward division, judgment data belongs to which B tree of the 3rd layer, and be poured in the 3rd layer, by that analogy, fallen until data, finish the foundation of quaternary tree shape structure, but above-mentioned N represents each B tree data carried by data amount.
3. search engine for geographical position according to claim 1 and 2 is characterized in that, this search engine comprises M layer, wherein:
The 1st layer comprises a quadtree's node representing whole map, and this quadtree's node comprises a B tree of setting up by at least a attribute of object search;
The 2nd layer comprises four quadtree's nodes of 1/4th of representing above-mentioned map respectively, and these four quadtree's nodes are pressed matrix pattern and distributed, and each quadtree's node comprises 0～1 B tree of setting up by at least a attribute of object search;
The 3rd layer comprises 16 quadtree's nodes, wherein, represents four quadtree's nodes of 1/4th of one of four parts of maps in the 2nd layer to press matrix pattern and distributes, and each quadtree's node comprises 0～1 B tree of setting up by at least a attribute of object search;
4th, 5, the structure of 6......M layer by that analogy.
4. the construction method of search engine for geographical position according to claim 1 is characterized in that this method is:
Employing makes up the quaternary tree of a M layer with the geographic position attribute and the mutually compound mode of another kind of at least property index of object search;
Pour data into from database, original date is poured into and is rested on the 1st layer that comprises 1 quadtree's node, and sets up 1 B tree on this quadtree's node;
When data volume when surpassing N for the 1st layer, the 1st layer B tree is when continuing to increase data volume, beginning is division downwards, and judgment data belongs to the 2nd layer which of four quadtree's nodes, then pours the second layer into, is setting up the B tree on corresponding quadtree's node;
When the data volume of certain B of second layer tree also reaches N, also begin downward division, be poured into the 3rd layer, and on the 3rd layer corresponding quadtree's node, set up the B tree;
By that analogy, pending data is poured into and is finished, and promptly form based on quaternary tree and B and set the search engine for geographical position that combines, but above-mentioned N is each B tree data carried by data amount.
5. the construction method of search engine for geographical position according to claim 1 according to claim 4, it is characterized in that, in this method, if pour the data of the specified geographic location attribute of the object search that comprises certain quadtree's node that meets the M layer in the data of M layer into by (M-1) layer, then on this quadtree's node, set up the B tree, otherwise, then can not set up the B tree on this quadtree's node.
6. the construction method of search engine for geographical position according to claim 1 according to claim 4 is characterized in that, in this method, is to set up the B tree by the another kind of at least attribute of object search on quadtree's node.
7. the construction method of search engine for geographical position according to claim 1 according to claim 4 is characterized in that, described search engine for geographical position comprises the M layer, wherein:
The 1st layer comprises a quadtree's node representing whole map, and this quadtree's node comprises a B tree of setting up by the another kind of at least attribute of object search;
The 2nd layer comprises four quadtree's nodes of 1/4th of representing above-mentioned map respectively, and these four quadtree's nodes are pressed matrix pattern and distributed, and each quadtree's node comprises 0～1 B tree of setting up by the another kind of at least attribute of object search;
The 3rd layer comprises 16 quadtree's nodes, wherein, represents four quadtree's nodes of 1/4th of one of four parts of maps in the 2nd layer to press matrix pattern and distributes, and each quadtree's node comprises 0～1 B tree of setting up by the another kind of at least attribute of object search;
4th, 5, the structure of 6......M layer by that analogy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101278694A CN101789028B (en) | 2010-03-19 | 2010-03-19 | Search engine for geographical position and constructing method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101278694A CN101789028B (en) | 2010-03-19 | 2010-03-19 | Search engine for geographical position and constructing method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101789028A true CN101789028A (en) | 2010-07-28 |
| CN101789028B CN101789028B (en) | 2012-03-21 |
Family
ID=42532242
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101278694A Expired - Fee Related CN101789028B (en) | 2010-03-19 | 2010-03-19 | Search engine for geographical position and constructing method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101789028B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104063413A (en) * | 2013-11-11 | 2014-09-24 | 国云科技股份有限公司 | MYSQL (my structured query language) database tree structure and quick retrieval method thereof |
| CN106227864A (en) * | 2016-07-29 | 2016-12-14 | 医卫里网络（杭州）有限公司 | The most graphic data base and knowledge virtual map |
| CN107451302A (en) * | 2017-09-22 | 2017-12-08 | 深圳大学 | Modeling method and system based on position top k keyword queries under sliding window |
| CN107506490A (en) * | 2017-09-22 | 2017-12-22 | 深圳大学 | Preferential search algorithm and system based on position top k keyword queries under sliding window |
| CN107633068A (en) * | 2017-09-22 | 2018-01-26 | 深圳大学 | Fast indexing method and system based on position top k keyword queries under sliding window |
| CN111309258A (en) * | 2020-02-14 | 2020-06-19 | 苏州浪潮智能科技有限公司 | B + tree access method and device and computer readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1564203A (en) * | 2004-04-12 | 2005-01-12 | 浙江大学 | Fast drawing forest method of graded hierarchical assembling depth paste-up atlas |
| CN1567174A (en) * | 2003-06-09 | 2005-01-19 | 吴胜远 | Method for expressing and processing object and apparatus thereof |
| CN1932884A (en) * | 2006-09-26 | 2007-03-21 | 杭州镭星科技有限公司 | Process type ground fast drawing method based on fractal hierarchical tree |
| CN1959670A (en) * | 2005-11-02 | 2007-05-09 | 北京灵图软件技术有限公司 | Method for storing topographic image data in pyramid architecture |
| US20070282816A1 (en) * | 2006-06-05 | 2007-12-06 | Shing-Jung Tsai | Method and structure for string partial search |
| CN101673307A (en) * | 2009-10-21 | 2010-03-17 | 中国农业大学 | Space data index method and system |
-
2010
- 2010-03-19 CN CN2010101278694A patent/CN101789028B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1567174A (en) * | 2003-06-09 | 2005-01-19 | 吴胜远 | Method for expressing and processing object and apparatus thereof |
| CN1564203A (en) * | 2004-04-12 | 2005-01-12 | 浙江大学 | Fast drawing forest method of graded hierarchical assembling depth paste-up atlas |
| CN1959670A (en) * | 2005-11-02 | 2007-05-09 | 北京灵图软件技术有限公司 | Method for storing topographic image data in pyramid architecture |
| US20070282816A1 (en) * | 2006-06-05 | 2007-12-06 | Shing-Jung Tsai | Method and structure for string partial search |
| CN1932884A (en) * | 2006-09-26 | 2007-03-21 | 杭州镭星科技有限公司 | Process type ground fast drawing method based on fractal hierarchical tree |
| CN101673307A (en) * | 2009-10-21 | 2010-03-17 | 中国农业大学 | Space data index method and system |
Non-Patent Citations (1)
| Title |
|---|
| 《城市勘测》 20051231 潘伟辉 等 一种道路GIS数据组织与查询机制 第32-36页 1-7 , 第1期 2 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104063413A (en) * | 2013-11-11 | 2014-09-24 | 国云科技股份有限公司 | MYSQL (my structured query language) database tree structure and quick retrieval method thereof |
| CN106227864A (en) * | 2016-07-29 | 2016-12-14 | 医卫里网络（杭州）有限公司 | The most graphic data base and knowledge virtual map |
| CN107451302A (en) * | 2017-09-22 | 2017-12-08 | 深圳大学 | Modeling method and system based on position top k keyword queries under sliding window |
| CN107506490A (en) * | 2017-09-22 | 2017-12-22 | 深圳大学 | Preferential search algorithm and system based on position top k keyword queries under sliding window |
| CN107633068A (en) * | 2017-09-22 | 2018-01-26 | 深圳大学 | Fast indexing method and system based on position top k keyword queries under sliding window |
| WO2019056570A1 (en) * | 2017-09-22 | 2019-03-28 | 深圳大学 | Position top-k keyword query-based fast indexing method and system under sliding window |
| WO2019056568A1 (en) * | 2017-09-22 | 2019-03-28 | 深圳大学 | Position top-k keyword query-based modeling method and system under sliding window |
| CN107633068B (en) * | 2017-09-22 | 2020-04-07 | 深圳大学 | Rapid indexing method and system based on position top-k keyword query under sliding window |
| CN107506490B (en) * | 2017-09-22 | 2020-08-11 | 深圳大学 | Priority query algorithm and system based on position top-k keyword query under sliding window |
| CN111309258A (en) * | 2020-02-14 | 2020-06-19 | 苏州浪潮智能科技有限公司 | B + tree access method and device and computer readable storage medium |
| CN111309258B (en) * | 2020-02-14 | 2021-10-15 | 苏州浪潮智能科技有限公司 | B + tree access method and device and computer readable storage medium |
| US11762827B2 (en) | 2020-02-14 | 2023-09-19 | Inspur Suzhou Intelligent Technology Co., Ltd. | B-plus tree access method and apparatus, and computer-readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101789028B (en) | 2012-03-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101789028B (en) | Search engine for geographical position and constructing method thereof | |
| CN104199986B (en) | Vector data space index method based on hbase and geohash | |
| Rocha-Junior et al. | Top-k spatial keyword queries on road networks | |
| CN103927933B (en) | A kind of magnanimity moves method and the device that target renders | |
| CN101388043B (en) | OGC high performance remote sensing image map service method based on small picture | |
| CN103488736B (en) | Method and system for establishing multisource geospatial information correlation model | |
| CN106933833B (en) | Method for quickly querying position information based on spatial index technology | |
| CN104376053A (en) | Storage and retrieval method based on massive meteorological data | |
| CN110175175B (en) | SPARK-based distributed space secondary index and range query algorithm | |
| CN108052514A (en) | A kind of blending space Indexing Mechanism for handling geographical text Skyline inquiries | |
| CN110147377A (en) | General polling algorithm based on secondary index under extensive spatial data environment | |
| CN103559213B (en) | A kind of network of highways efficient spatial K-NN search method | |
| CN103092926B (en) | The three-dimensional space index method of multi-level mixing | |
| CN110347680A (en) | A kind of space-time data indexing means towards high in the clouds environment | |
| CN102662974A (en) | A network graph index method based on adjacent node trees | |
| CN101488158A (en) | Road network modeling method based on road element | |
| CN108628951A (en) | Spatial data massive texture storage based on document model and abbreviation compression method | |
| CN102435200A (en) | Rapid path planning method | |
| CN103714145A (en) | Relational and Key-Value type database spatial data index method | |
| CN111639075B (en) | Non-relational database vector data management method based on flattened R tree | |
| CN104346444B (en) | A kind of the best site selection method based on the anti-spatial key inquiry of road network | |
| CN108009265B (en) | Spatial data indexing method in cloud computing environment | |
| CN102193996B (en) | Visual Web object search engine method based on mobile device | |
| CN107423373A (en) | A kind of City-level three-dimensional building model indexing means | |
| CN102012232A (en) | Method for updating map data of vehicle-mounted navigation system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120321 Termination date: 20140319 |