CN110287426A - Method for building up, device, storage medium and the processor of point of interest set membership - Google Patents
Method for building up, device, storage medium and the processor of point of interest set membership Download PDFInfo
- Publication number
- CN110287426A CN110287426A CN201910435808.5A CN201910435808A CN110287426A CN 110287426 A CN110287426 A CN 110287426A CN 201910435808 A CN201910435808 A CN 201910435808A CN 110287426 A CN110287426 A CN 110287426A
- Authority
- CN
- China
- Prior art keywords
- point
- interest
- set membership
- index
- coding
- 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/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The embodiment of the present invention provides method for building up, device, storage medium and the processor of a kind of point of interest set membership.Wherein, a kind of method for building up of point of interest set membership includes: building dictionary index tree, wherein the dictionary index tree encodes including multiple first spatial indexes, and each first spatial index encodes corresponding first point of interest；The corresponding second space index coding of second point of interest is matched with the dictionary index tree, the set membership pair being made of first point of interest and second point of interest is determined according to matching result and preset rules.Method for building up, device, storage medium and the processor of a kind of point of interest set membership disclosed by the invention, by constructing index relevant to point of interest, and point of interest set membership is constructed by the matching between index, improve the efficiency and accuracy of the foundation of point of interest set membership.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of method for building up of point of interest set membership, device,
Storage medium and processor.
Background technique
Set membership is the primary attribute relationship between POI (Point of Interest, point of interest), is not only able to satisfy
Basic demand when user query POI, and the retrieving and display effect of online electronic map can be optimized, meanwhile, father
Subrelation all has biggish meaning for POI visiting, POI knowledge mapping, the city portrait etc. of user.In addition, set membership
The dependence between the cell POI of city is represented, is also of great significance to the research of smart city.
Current POI is established there are mainly two types of the modes of set membership: one, artificial acquisition.Two, by simple space length and
String matching rule.
First way is because data volume is very big, and high labor cost, collecting efficiency is low, and accuracy rate does not ensure.The first
Mode matching rule is rougher, and accuracy rate is low.
Summary of the invention
The purpose of the embodiment of the present invention is that provide a kind of method for building up of point of interest set membership, device, storage medium and
Processor can be improved the efficiency and accuracy of point of interest set membership.
To achieve the goals above, the embodiment of the present invention provides a kind of method that point of interest set membership is established, comprising:
Construct dictionary index tree, wherein the dictionary index tree encodes including multiple first spatial indexes, and each first is empty
Between index encode corresponding first point of interest；
Second point of interest corresponding second space index coding is matched with the dictionary index tree, according to matching result with
Preset rules determine the set membership pair being made of first point of interest and second point of interest.
Optionally, further includes:
Coordinate relevant to first point of interest is numbered and is merged with the title of first point of interest, obtains described the
One spatial index coding；
It will be merged with the coordinate value of second point of interest with the title of second point of interest, obtain the second space
Index coding；
Wherein, coordinate number includes coordinate value.
Optionally, described to melt coordinate relevant to first point of interest number and the title of first point of interest
It closes, obtains the first spatial index coding, comprising:
When the shape attribute of first point of interest is empty, building includes the nine grids Spatial Cable of first point of interest
Draw；
Each coordinate of the nine grids spatial index is numbered and is merged with the title of first point of interest, is obtained and institute
State the corresponding first spatial index coding of each coordinate number；
When the information faces attribute of first point of interest is not sky, the polygon that building covers first point of interest is empty
Between index；
Each coordinate that the polygon space indexes is numbered and is merged with the title of first point of interest, is obtained and institute
State the corresponding first spatial index coding of each coordinate number.
Optionally, when the shape attribute of first point of interest is empty, the spatial index coding further includes the first mark
Know；
When the shape attribute of first point of interest is not sky, the spatial index coding further includes second identifier.
Optionally, the preset rules include the character that second space index coding is arrived with the first spatial index codes match
Number is most.
Optionally, further includes:
When first spatial index coding and the matching result of second space index coding are not sky, symbol is determined
Close the first spatial index coding of preset rules；
First point of interest corresponding with the first spatial index coding is searched, and is indexed with the second space
Corresponding second point of interest is encoded, the relationship pair being made of first point of interest and second point of interest is obtained.
Optionally, further includes:
When the shape attribute of first point of interest is not sky, judge whether second point of interest is emerging described first
In the range of interest point, if in range, it is determined that the relationship is to for the set membership pair.
On the other hand, the present invention provides a kind of system that point of interest set membership is established, comprising:
Achievement module is used to construct dictionary index tree, wherein the dictionary index tree includes multiple first spatial indexes
Coding, each first spatial index encode corresponding first point of interest；
Matching module is used for the corresponding second space index coding of the second point of interest and the dictionary index tree
Match, the set membership being made of first point of interest and second point of interest is determined according to matching result and preset rules
It is right.
Optionally, further include Fusion Module, be used for,
Coordinate relevant to first point of interest is numbered and is merged with the title of first point of interest, the first sky is obtained
Between index coding；
Coordinate value relevant to second point of interest is merged with the title of second point of interest, obtains described second
Spatial index coding.
Optionally, Fusion Module further include space submodule and index submodule,
When the shape attribute of first point of interest is empty, space submodule includes first interest for constructing
The nine grids spatial index of point；
Submodule is indexed, for each coordinate of the nine grids spatial index to be numbered to the name with first point of interest
Claim fusion, obtains the first spatial index coding corresponding with each coordinate number；
When the attribute of first point of interest is not sky, space submodule covers first point of interest for constructing
Polygon space index；
Submodule is indexed, the name of each coordinate number and first point of interest for indexing the polygon space
Claim fusion, obtains the first spatial index coding corresponding with each coordinate number.
Optionally, when the shape attribute of first point of interest is empty, the spatial index coding further includes the first mark
Know；
When the shape attribute of first point of interest is not sky, the spatial index coding further includes second identifier.
Optionally, the preset rules include the character that second space index coding is arrived with the first spatial index codes match
Number is most.
Optionally, matching module further includes building to submodule,
When first spatial index coding and the matching result of second space index coding are not sky, symbol is determined
Close the first spatial index coding of preset rules；
First point of interest corresponding with the first spatial index coding is searched, and is indexed with the second space
Corresponding second point of interest is encoded, the relationship pair being made of first point of interest and second point of interest is obtained.
Optionally, matching module further includes judging submodule, is used for,
When the shape attribute of first point of interest is not sky, judge whether second point of interest is emerging described first
In the range of interest point, if in range, it is determined that the relationship is to for the set membership pair.
On the other hand, the present invention provides a kind of machine readable storage medium, and finger is stored on the machine readable storage medium
It enables, which is used for so that the method that machine executes the foundation of point of interest set membership described in any one as above.
On the other hand, the present invention provides a kind of processor, which is characterized in that for running program, wherein described program quilt
For executing when operation: the method that point of interest set membership described in any one as above is established.
The invention discloses method for building up, device, storage medium and the processors of a kind of point of interest set membership, pass through structure
Index relevant to point of interest is built, and point of interest set membership is constructed by the matching between index, improves point of interest
The efficiency and accuracy that set membership is established.
The other feature and advantage of the embodiment of the present invention will the following detailed description will be given in the detailed implementation section.
Detailed description of the invention
Attached drawing is to further understand for providing to the embodiment of the present invention, and constitute part of specification, under
The specific embodiment in face is used to explain the present invention embodiment together, but does not constitute the limitation to the embodiment of the present invention.Attached
In figure:
Fig. 1 is the flow chart for the method established according to a kind of point of interest set membership of the embodiment of the present application；
Fig. 2 is the structural schematic diagram according to a kind of dictionary index tree of the embodiment of the present application；
Fig. 3 is the flow chart for the method established according to a kind of point of interest set membership of the embodiment of the present application；
Fig. 4 is the schematic diagram according to a kind of building nine grids spatial index of the embodiment of the present application；
Fig. 5 is the schematic diagram indexed according to a kind of building polygon space of the embodiment of the present application；
Fig. 6 is the position view according to the point of interest set membership of the embodiment of the present application；
Fig. 7 is the structural schematic diagram for the system established according to a kind of point of interest set membership of the embodiment of the present application.
Specific embodiment
It is described in detail below in conjunction with specific embodiment of the attached drawing to the embodiment of the present invention.It should be understood that this
Locate described specific embodiment and be merely to illustrate and explain the present invention embodiment, is not intended to restrict the invention embodiment.
There are two types of the current modes for obtaining POI set membership: one, manually acquiring.Two, pass through simple space length and word
Accord with String matching rule.
In the first way, it by the set membership of artificial constructed POI, needs to spend a large amount of manpower, cost of labor
It is high.POIs several hundred million to the whole world are acquired difficult, manually to acquire low efficiency simultaneously.Also, the quality level of collector
Uneven, the data accuracy for acquiring completion cannot be guaranteed.
In the second way, the set membership of POI is established by the means of technology, is had and is covered extensively, compared to artificial effect
The high advantage of rate.But since its space length relationship based on building species POI carries out the matching between two POI titles, rule
Then rougher, accuracy rate is lower.Meanwhile the operation of space length relationship does not set up the index relative between building, causes to transport
It is lower to calculate efficiency.
The invention discloses method for building up, device, storage medium and the processors of a kind of point of interest set membership, pass through structure
Index relevant to point of interest is built, and point of interest set membership is constructed by the matching between index, improves point of interest
The efficiency and accuracy that set membership is established.
Fig. 1 is the flow chart for the method established according to a kind of point of interest set membership of the embodiment of the present application, such as Fig. 1 institute
It states, the above method includes:
Step S110 constructs dictionary index tree, wherein dictionary index tree encodes including multiple first spatial indexes, each
First spatial index encodes corresponding first point of interest；
Step S120 matches the corresponding second space index coding of the second point of interest with dictionary index tree, according to matching
As a result the set membership pair being made of the first point of interest and the second point of interest is determined with preset rules.
According to some embodiments of the present application, point of interest, i.e. the data structure of POI is as follows: poi_item:(poi_id,
Name, loc_x, loc_y, polygons, std_tag), wherein each attribute field is described as follows:
The global unique index of poi_id:POI uniquely indicates POI, data type int64；
The title of name:POI；
Loc_x, loc_y: for the center point coordinate value of POI, such as latitude and longitude coordinates value or magic Kato coordinate value；
Polygongs: the shape attribute for the shape attribute field of POI, POI can be sky, can not also be sky.Work as shape
When shape attribute is not sky, illustrate that POI has AOI (area of interest, information faces) attribute, which lists the seat of AOI
Punctuation sequence；
The type of std_tag:POI.
Dictionary index tree is also known as word lookup tree or dictionary tree, is a kind of tree form data structure, the mutation of Hash tree.Allusion quotation
Type application is for counting, sorting and saving a large amount of character string.It has 3 fundamental propertys: 1, root node does not include character, removes
Each outer node of root node only includes a character.2, from root node to a certain node, the Connection operator that passes through on path
Get up, for the corresponding character string of the node.3, the character that all child nodes of each node include is different from.
Fig. 2 is according to a kind of structural schematic diagram of dictionary index tree of some embodiments of the present application, word as shown in Figure 2
Allusion quotation index tree is encoded by multiple first spatial indexes to be formed character string and forms, the character string of the terminal from root node to either path
It is encoded for first spatial index, wherein each first spatial index encodes corresponding first point of interest.In Fig. 2
The Technology Park the 1st hundred degree of 12970_4812LOC building, 12970_4813LOC Netease mansion and 12972_4823AOI five colours city, generation
Table belong to the different first spatial indexes codings of a dictionary index tree.
According to some embodiments of the present application, the first spatial index coding can obtain as follows:
Coordinate relevant to the first point of interest is numbered and is merged with the title of the first point of interest, obtains first by step S101
Spatial index coding, wherein coordinate number includes the coordinate value of the first point of interest.
According to some embodiments of the present application, the specific implementation form of step S101 further comprises:
Step S1011, when the shape attribute of the first point of interest is empty, building includes the nine grids space of the first point of interest
Index.Each coordinate of nine grids spatial index is numbered and is merged with the title of the first point of interest, obtains numbering with each coordinate
Corresponding first spatial index coding.
Step S1012, when the shape attribute of the first point of interest is not sky, the polygon of building the first point of interest of covering is empty
Between index.Each coordinate of polygon space index is numbered and is merged with the title of the first point of interest, obtains compiling with each coordinate
Number corresponding first spatial index coding.
According to one specific embodiment of the application, poi_item:(poi_id, name, loc_x, loc_y,
Polygons, std_tag) loc_x is used, loc_y, polygons construct the first spatial index coding, are divided into two kinds of situations,
Polygons is empty and has value.
When polygons is empty, geohash nine grids spatial index is constructed using loc_x, loc_y, Fig. 3 is according to this
The schematic diagram of a kind of building nine grids spatial index of one embodiment of application, as shown in figure 3, coordinate points (loc_x, loc_
Y) corresponding nine grids spatial index is nine grid that bold box circle is lived, and coordinate number is 12970_4823,12970_4824,
12970_4825,12971_4823,12971_4824,12971_4825,12972_4823,12972_4824,12972_4825,
Coordinate number at this time is magic Kato coordinate value.
When having value for polygons, polygons is carried out to carry out cutting with based on the onesize grid of coordinate points, is cut
Polygons can be completely covered in mesh space after point, and Fig. 4 is polygon according to a kind of building of one embodiment of the application
The schematic diagram of shape spatial index, as shown in figure 4, the polygon that dark Polygons Representation is made of polygons, light colored mesh
For its corresponding spatial index, wherein the point indicates coordinate point in Dk Trellis.
After above-mentioned nine grids spatial index or polygon space index construct, a new data structure is obtained
(poi_id, name, loc_x, loc_y, polygons, std_tag, indexs), wherein indexs indicates coordinate coding, such as
[12970_4812,…,12972_4823]。
According to some embodiments of the present application when the shape attribute of the first point of interest is empty, the first spatial index coding is also
Including first identifier.When the shape attribute of the first point of interest is not sky, the first spatial index coding further includes second identifier, root
According to one specific embodiment of the application, first identifier shows that second identifier is indicated with AOI with LOC table.
According to the application one embodiment, a kind of method that point of interest set membership is established further includes step 102, will be with the
The coordinate points of two points of interest are merged with the title of the second point of interest, obtain second space index coding.
According to one specific embodiment of the application, codes co-ordinates are merged with interest point name, are formed such as:
The hundred degree of Technology Parks 12970_4812LOC, the hundred degree of Technology Parks 12972_4823LOC, 12372_4923AOI FangZheng Building fused data
The first spatial index coding.Wherein, AOI field indicates that the first spatial index completed by polygons encodes, and LOC table shows
It is encoded by the first spatial index of coordinate nine grids index construct.Simultaneously note that each POI can pass through its codes co-ordinates
Quantity is decomposed into be encoded with consistent first spatial index of its quantity.Building dictionary index tree is encoded by the first spatial index,
It is denoted as T, as shown in Figure 2.Key is encoded to fusion simultaneously, poi_item is that value constructs map, i.e. map, it is denoted as M, wherein
The data format of map is as follows: { key=" the hundred degree of Technology Parks 12970_4812LOC ": value=
(" 827137687095532157 ", " Baidu Technology Park ", 12944327.15,4845309.15, [(12944327.15,
4845309.15), (12944327.15,4845319.15)], " real estate；Office building ", " hundred degree of science and technology of 12970_4812LOC
Garden "), key=" parking lot C mouthfuls of No. 1 building in the hundred degree of Technology Parks 12972_4823LOC ": value=
(" 827137687096632156 ", " parking lot C mouthfuls of Baidu, No. 1 building, Technology Park ", 12944327.15,4845309.15, []),
Key=" entrance；Other ", value=" parking lot C mouthfuls of No. 1 building in the hundred degree of Technology Parks 12972_4823LOC " } ... ...
According to some embodiments of the present application, preset rules are second space index coding and the first spatial index coding
The number of characters being fitted on is most.After the completion of matching, step S121 is executed, when first spatial index coding and second sky
Between when to index the matching result of coding be not sky, be determined for compliance with the first spatial index coding of preset rules.
S122, searches corresponding with the first spatial index coding first point of interest, and with the second space
The corresponding second point of interest combination of index coding, obtains the pass being made of first point of interest and second point of interest
System pair.
According to some embodiments of the present application, a kind of method that point of interest set membership is established, further includes step S123, when
When the shape attribute of first point of interest is not sky, the second point of interest is judged whether in the range of the first point of interest, if in model
In enclosing, it is determined that the relationship is to for the set membership pair.
According to one specific embodiment of the application, based on dictionary index tree building set membership, steps are as follows:
To POI data poi_item, coordinate value is obtained according to loc_x, loc_y, according in coordinate value and poi_item
Name constructs the character string S of second space index coding to be indexed, and building the to be found of LOC and AOI type melts respectively here
Close index.As the hundred degree of Technology Parks No. 1 building parking lot 12972_4823LOC and the building of Technology Park the 1st hundred degree of 12972_4823AOI are stopped
C mouthfuls of field.
The second space for containing " LOC " is indexed coding S to bring into dictionary index tree T, indexes out matched fusion character string.
In this embodiment, " parking lot C mouthfuls of No. 1 building in the hundred degree of Technology Parks 12972_4823LOC " S=, can match " 12972_4823LOC hundred
Spend the building of Technology Park the 1st " and " the hundred degree of Technology Parks 12972_4823LOC No. 1 building parking lot " two results.Pass through preset longest packet
Set membership pair is determined containing matching rule.It brings the fusion indexed out coding into map M, finds the details of corresponding POI.
The second space for containing " AOI " is indexed in coding S and is brought into dictionary index tree T, matched fusion character is indexed out
String.In this embodiment, " 12982_4823AOI Zhou great Fu (the multicolored city shop) " S=then must include to the fusion character string matched
" 12972_4823AOI " brings the fusion character string indexed out into map M, finds corresponding first point of interest POI's
Whether the polygons of polygons, the polygons and the first point of interest that judge corresponding second point of interest of S are inclusion relation,
If having inclusion relation, the first point of interest and the second point of interest at this time is determined as set membership, and Fig. 5 is according to the application
The position view of the point of interest set membership of some embodiments, as in Fig. 5 multicolored city and Zhou great Fu (multicolored city shop) constitute
Set membership, if do not have inclusion relation, it is determined that said two devices are not set memberships.
Fig. 6 is the structural schematic diagram for the system established according to a kind of point of interest set membership of the application one embodiment,
As shown in fig. 6, system includes achievement module 210 and matching module 220, wherein
Achievement module 210 is used to construct dictionary index tree, wherein dictionary index tree includes multiple first spatial indexes
Coding, each first spatial index encode corresponding first point of interest；
Matching module 220 is used to match the corresponding second space index coding of the second point of interest with dictionary index tree,
The set membership pair being made of the first point of interest and the second point of interest is determined according to matching result and preset rules.
Optionally, system further includes Fusion Module 230, is used for, will relevant to the first point of interest coordinate number and the
The title of one point of interest merges, and obtains the first spatial index coding.It will coordinate value relevant to the second point of interest and the second interest
The title fusion of point obtains second space index coding.
Optionally, Fusion Module 230 further include space submodule 231 and index submodule 232,
When the shape attribute of the first point of interest is empty, space submodule 231, for constructing nine including the first point of interest
Palace grid space index.
Submodule 232 is indexed, for melting the title of each coordinate number of nine grids spatial index and the first point of interest
It closes, obtains the first spatial index coding corresponding with each coordinate number；
When the attribute of the first point of interest is not sky, space submodule 231, for constructing the polygon of the first point of interest of covering
Shape spatial index.
Submodule 232 is indexed, the title of each coordinate number and the first point of interest for indexing polygon space is melted
It closes, obtains the first spatial index coding corresponding with each coordinate number.
Optionally, when the shape attribute of the first point of interest is empty, spatial index coding further includes first identifier.When first
When the shape attribute of point of interest is not sky, spatial index coding further includes second identifier.
Optionally, preset rules include that second space index encodes the number of characters arrived with the first spatial index codes match most
It is more.
Optionally, matching module 220 further includes building to submodule 221, be used for when first spatial index coding with
When the matching result of the second space index coding is not sky, it is determined for compliance with the first spatial index coding of preset rules；It looks into
Look for first point of interest corresponding with the first spatial index coding, and institute corresponding with second space index coding
The combination of the second point of interest is stated, the relationship pair being made of first point of interest and second point of interest is obtained.
Optionally, matching module 220 further includes judging submodule 222, is used to work as the shape attribute of the first point of interest not
When for sky, the second point of interest is judged whether in the range of the first point of interest, if in range, it is determined that the relationship to for
The set membership pair.According to some embodiments of the present application, the device that a kind of point of interest set membership is established includes place
Device and memory are managed, above-mentioned achievement module and matching module etc. are stored as program unit in memory, by processor
Above procedure unit stored in memory is executed to realize corresponding function.
Include kernel in processor, is gone in memory to transfer corresponding program unit by kernel.Kernel can be set one
Or more, the set membership between point of interest is established by adjusting kernel parameter.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/
Or the forms such as Nonvolatile memory, if read-only memory (ROM) or flash memory (flash RAM), memory include that at least one is deposited
Store up chip.
The embodiment of the invention provides a kind of storage mediums, are stored thereon with program, real when which is executed by processor
A kind of existing method that point of interest set membership is established.
The embodiment of the invention provides a kind of processor, the processor is for running program, wherein described program operation
A kind of method that point of interest set membership is established described in Shi Zhihang.
The embodiment of the invention provides a kind of equipment, equipment include processor, memory and storage on a memory and can
The program run on a processor, processor perform the steps of when executing program
Step S110 constructs dictionary index tree, wherein dictionary index tree encodes including multiple first spatial indexes, each
First spatial index encodes corresponding first point of interest；
Step S120 matches the corresponding second space index coding of the second point of interest with dictionary index tree, according to matching
As a result the set membership pair being made of the first point of interest and the second point of interest is determined with preset rules.
The above method further include:
Coordinate relevant to the first point of interest is numbered and is merged with the title of the first point of interest, obtains first by step S101
Spatial index coding.
Step S102 will merge with the coordinate value of the second point of interest with the title of the second point of interest, obtain second space rope
Draw coding.Wherein, coordinate number includes coordinate value.
Optionally, step S101 includes,
Step S1011, when the shape attribute of the first point of interest is empty, building includes the nine grids space of the first point of interest
Index.Each coordinate of nine grids spatial index is numbered and is merged with the title of the first point of interest, obtains numbering with each coordinate
Corresponding first spatial index coding.
Step S1012, when the information faces attribute of the first point of interest is not sky, the polygon of building the first point of interest of covering
Spatial index.Each coordinate of polygon space index is numbered and is merged with the title of the first point of interest, is obtained and each coordinate
Number corresponding first spatial index coding.
Optionally, when the shape attribute of the first point of interest is empty, spatial index coding further includes first identifier.When first
When the shape attribute of point of interest is not sky, spatial index coding further includes second identifier.
Optionally, preset rules include that second space index encodes the number of characters arrived with the first spatial index codes match most
It is more.
Optionally, step S120 further include:
Step S121, when first spatial index coding and the matching result of second space index coding are not empty
When, it is determined for compliance with the first spatial index coding of preset rules.
Step S122, searches corresponding with the first spatial index coding first point of interest, and with described second
The corresponding second point of interest combination of spatial index coding, obtains being made of first point of interest and second point of interest
Relationship pair.
Whether step S123 judges the second point of interest in the first interest when the shape attribute of the first point of interest is not sky
In the range of point, if in range, it is determined that the relationship is to for the set membership pair.Equipment herein can be clothes
Business device, PC, PAD, mobile phone etc..
Present invention also provides a kind of computer program products, when executing on data processing equipment, are adapted for carrying out just
The program of beginningization there are as below methods step:
Step S110 constructs dictionary index tree, wherein dictionary index tree encodes including multiple first spatial indexes, each
First spatial index encodes corresponding first point of interest；
Step S120 matches the corresponding second space index coding of the second point of interest with dictionary index tree, according to matching
As a result the set membership pair being made of the first point of interest and the second point of interest is determined with preset rules.
The above method further include:
Coordinate relevant to the first point of interest is numbered and is merged with the title of the first point of interest, obtains first by step S101
Spatial index coding.
Step S102 will merge with the coordinate value of the second point of interest with the title of the second point of interest, obtain second space rope
Draw coding.Wherein, coordinate number includes coordinate value.
Optionally, step 101 includes:
Step S1010 judges whether the shape attribute of the first point of interest is empty；
Step S1011, when the shape attribute of the first point of interest is empty, building includes the nine grids space of the first point of interest
Index.Each coordinate of nine grids spatial index is numbered and is merged with the title of the first point of interest, obtains numbering with each coordinate
Corresponding first spatial index coding.
Step S1012, when the information faces attribute of the first point of interest is not sky, the polygon of building the first point of interest of covering
Spatial index.Each coordinate of polygon space index is numbered and is merged with the title of the first point of interest, is obtained and each coordinate
Number corresponding first spatial index coding.
Optionally, when the shape attribute of the first point of interest is empty, spatial index coding further includes first identifier.When first
When the shape attribute of point of interest is not sky, spatial index coding further includes second identifier.
Optionally, preset rules include that second space index encodes the number of characters arrived with the first spatial index codes match most
It is more.
Optionally, step S120 further include:
Step S121, when first spatial index coding and the matching result of second space index coding are not empty
When, it is determined for compliance with the first spatial index coding of preset rules；
Step S122, searches corresponding with the first spatial index coding first point of interest, and with described second
The corresponding second point of interest combination of spatial index coding, obtains being made of first point of interest and second point of interest
Relationship pair.
Whether step S123 judges the second point of interest in the first interest when the shape attribute of the first point of interest is not sky
In the range of point, if in range, it is determined that the relationship is to for the set membership pair.
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application is referring to method, the process of equipment (system) and computer program product according to the embodiment of the present application
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
In a typical configuration, calculating equipment includes one or more processors (CPU), input/output interface, net
Network interface and memory.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/
Or the forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM).Memory is computer-readable Jie
The example of matter.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer readable instructions, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory (SRAM), moves
State random access memory (DRAM), other kinds of random access memory (RAM), read-only memory (ROM), electric erasable
Programmable read only memory (EEPROM), flash memory or other memory techniques, read-only disc read only memory (CD-ROM) (CD-ROM),
Digital versatile disc (DVD) or other optical storage, magnetic cassettes, tape magnetic disk storage or other magnetic storage devices
Or any other non-transmission medium, can be used for storage can be accessed by a computing device information.As defined in this article, it calculates
Machine readable medium does not include temporary computer readable media (transitory media), such as the data-signal and carrier wave of modulation.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including element
There is also other identical elements in process, method, commodity or equipment.
It will be understood by those skilled in the art that embodiments herein can provide as method, system or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.It is deposited moreover, the application can be used to can be used in the computer that one or more wherein includes computer usable program code
The shape for the computer program product implemented on storage media (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
The above is only embodiments herein, are not intended to limit this application.To those skilled in the art,
Various changes and changes are possible in this application.It is all within the spirit and principles of the present application made by any modification, equivalent replacement,
Improve etc., it should be included within the scope of the claims of this application.
Claims (16)
1. a kind of method that point of interest set membership is established characterized by comprising
Construct dictionary index tree, wherein the dictionary index tree encodes including multiple first spatial indexes, each first Spatial Cable
Draw corresponding first point of interest of coding；
The corresponding second space index coding of second point of interest is matched with the dictionary index tree, according to matching result and is preset
Rule determines the set membership pair being made of first point of interest and second point of interest.
2. the method that a kind of point of interest set membership according to claim 1 is established, which is characterized in that further include:
Coordinate relevant to first point of interest is numbered and is merged with the title of first point of interest, it is empty to obtain described first
Between index coding；
It will be merged with the coordinate value of second point of interest with the title of second point of interest, obtain the second space index
Coding；
Wherein, the coordinate number includes the coordinate value.
3. the method that a kind of point of interest set membership according to claim 2 is established, which is characterized in that it is described will with it is described
The relevant coordinate number of first point of interest is merged with the title of first point of interest, obtains the first spatial index coding,
Include:
When the shape attribute of first point of interest is empty, building includes the nine grids spatial index of first point of interest；
Each coordinate of the nine grids spatial index is numbered and is merged with the title of first point of interest, obtain with it is described often
A coordinate numbers the corresponding first spatial index coding；
When the information faces attribute of first point of interest is not sky, building covers the polygon space rope of first point of interest
Draw；
Each coordinate that the polygon space indexes is numbered and is merged with the title of first point of interest, obtain with it is described often
A coordinate numbers the corresponding first spatial index coding.
4. the method that a kind of point of interest set membership according to claim 3 is established, which is characterized in that when described first emerging
When the shape attribute of interest point is empty, the spatial index coding further includes first identifier；
When the shape attribute of first point of interest is not sky, the spatial index coding further includes second identifier.
5. the method that a kind of point of interest set membership according to claim 1 is established, which is characterized in that the preset rules
It is most that the number of characters arrived with the first spatial index codes match is encoded including second space index.
6. the method that a kind of point of interest set membership according to claim 5 is established, which is characterized in that further include:
When first spatial index coding and the matching result of second space index coding are not sky, it is determined for compliance with pre-
If the first spatial index coding of rule；
First point of interest corresponding with the first spatial index coding is searched, and indexes coding pair with the second space
Second point of interest combination answered, obtains the relationship pair being made of first point of interest and second point of interest.
7. the method that a kind of point of interest set membership according to claim 6 is established, which is characterized in that further include:
When the shape attribute of first point of interest is not sky, judge second point of interest whether in first point of interest
In the range of, if in range, it is determined that the relationship is to for the set membership pair.
8. the system that a kind of point of interest set membership is established characterized by comprising
Achievement module is used to construct dictionary index tree, wherein the dictionary index tree is compiled including multiple first spatial indexes
Code, each first spatial index encode corresponding first point of interest；
Matching module is used to match the corresponding second space index coding of the second point of interest with the dictionary index tree, root
The set membership pair being made of first point of interest and second point of interest is determined according to matching result and preset rules.
9. the system that a kind of point of interest set membership according to claim 8 is established, which is characterized in that further include fusion mould
Block is used for,
Coordinate relevant to first point of interest is numbered and is merged with the title of first point of interest, it is empty to obtain described first
Between index coding；
Coordinate value relevant to second point of interest is merged with the title of second point of interest, obtains the second space
Index coding.
10. the system that a kind of point of interest set membership according to claim 9 is established, which is characterized in that Fusion Module is also
Including space submodule and submodule is indexed,
When the shape attribute of first point of interest is empty, space submodule includes first point of interest for constructing
Nine grids spatial index；
Submodule is indexed, the title of each coordinate number and first point of interest for the index submodule to be used for is melted
It closes, obtains the first spatial index coding corresponding with each coordinate number；
When the attribute of first point of interest is not sky, space submodule, for constructing the more of covering first point of interest
Side shape spatial index；
Submodule is indexed, the title of each coordinate number and first point of interest for indexing the polygon space is melted
It closes, obtains the first spatial index coding corresponding with each coordinate number.
11. the system that a kind of point of interest set membership according to claim 10 is established, which is characterized in that when described first
When the shape attribute of point of interest is empty, the spatial index coding further includes first identifier；
When the shape attribute of first point of interest is not sky, the spatial index coding further includes second identifier.
12. the system that a kind of point of interest set membership according to claim 8 is established, which is characterized in that the default rule
It is most that the number of characters arrived with the first spatial index codes match then is encoded including second space index.
13. the system that a kind of point of interest set membership according to claim 12 is established, which is characterized in that matching module is also
Including building to submodule, it is used for,
When first spatial index coding and the matching result of second space index coding are not sky, it is determined for compliance with pre-
If the first spatial index coding of rule；
First point of interest corresponding with the first spatial index coding is searched, and indexes coding pair with the second space
Second point of interest combination answered, obtains the relationship pair being made of first point of interest and second point of interest.
14. the system that a kind of point of interest set membership according to claim 13 is established, which is characterized in that matching module is also
Including judging submodule, it is used for,
When the shape attribute of first point of interest is not sky, judge second point of interest whether in first point of interest
In the range of, if in range, it is determined that the relationship is to for the set membership pair.
15. a kind of machine readable storage medium, it is stored with instruction on the machine readable storage medium, which is used for so that machine
The method that perform claim requires 1-7 any of the above-described point of interest set membership to establish.
16. a kind of processor, which is characterized in that for running program, wherein for executing when described program is run: as weighed
The method that benefit requires point of interest set membership described in 1-7 any one to establish.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910435808.5A CN110287426B (en) | 2019-05-23 | 2019-05-23 | Method and device for establishing parent-child relationship of interest points, storage medium and processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910435808.5A CN110287426B (en) | 2019-05-23 | 2019-05-23 | Method and device for establishing parent-child relationship of interest points, storage medium and processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110287426A true CN110287426A (en) | 2019-09-27 |
| CN110287426B CN110287426B (en) | 2021-12-31 |
Family
ID=68002548
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910435808.5A Active CN110287426B (en) | 2019-05-23 | 2019-05-23 | Method and device for establishing parent-child relationship of interest points, storage medium and processor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110287426B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110726418A (en) * | 2019-10-10 | 2020-01-24 | 北京百度网讯科技有限公司 | Method, device and equipment for determining interest point region and storage medium |
| CN111078919A (en) * | 2019-11-15 | 2020-04-28 | 浙江省第一测绘院 | Sudoku-based large-scale vector data suspension processing method |
| CN111881371A (en) * | 2020-05-21 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Method and system for establishing POI parent-child point pairs |
| CN114820960A (en) * | 2022-04-18 | 2022-07-29 | 北京百度网讯科技有限公司 | Method, device, equipment and medium for constructing map |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6516320B1 (en) * | 1999-03-08 | 2003-02-04 | Pliant Technologies, Inc. | Tiered hashing for data access |
| CN102651026A (en) * | 2012-04-01 | 2012-08-29 | 百度在线网络技术（北京）有限公司 | Method for optimizing word segmentation of search engine through precomputation and word segmenting device of search engine |
| US8676855B2 (en) * | 2009-05-01 | 2014-03-18 | Brother Kogyo Kabushiki Kaisha | Distributed storage system, management apparatus, node apparatus, recording medium on which node program is recorded, page information acquisition method, recording medium on which page information sending program is recorded, and page information sending method |
| CN103886082A (en) * | 2014-03-26 | 2014-06-25 | 百度在线网络技术（北京）有限公司 | Method and device for verifying position information of interest points |
| CN105260354A (en) * | 2015-08-20 | 2016-01-20 | 及时标讯网络信息技术（北京）有限公司 | Chinese AC (Aho-Corasick) automaton working method based on keyword dictionary tree structure |
| CN106777118A (en) * | 2016-12-16 | 2017-05-31 | 武汉大学 | A kind of quick abstracting method of geographical vocabulary based on fuzzy dictionary tree |
| CN107291785A (en) * | 2016-04-12 | 2017-10-24 | 滴滴（中国）科技有限公司 | A kind of data search method and device |
| CN109299747A (en) * | 2018-10-24 | 2019-02-01 | 北京字节跳动网络技术有限公司 | Determination method, apparatus, computer equipment and the storage medium at one type cluster center |
| CN109344213A (en) * | 2018-08-28 | 2019-02-15 | 浙江工业大学 | A kind of Chinese Geocoding based on dictionary tree |
-
2019
- 2019-05-23 CN CN201910435808.5A patent/CN110287426B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6516320B1 (en) * | 1999-03-08 | 2003-02-04 | Pliant Technologies, Inc. | Tiered hashing for data access |
| US8676855B2 (en) * | 2009-05-01 | 2014-03-18 | Brother Kogyo Kabushiki Kaisha | Distributed storage system, management apparatus, node apparatus, recording medium on which node program is recorded, page information acquisition method, recording medium on which page information sending program is recorded, and page information sending method |
| CN102651026A (en) * | 2012-04-01 | 2012-08-29 | 百度在线网络技术（北京）有限公司 | Method for optimizing word segmentation of search engine through precomputation and word segmenting device of search engine |
| CN103886082A (en) * | 2014-03-26 | 2014-06-25 | 百度在线网络技术（北京）有限公司 | Method and device for verifying position information of interest points |
| CN105260354A (en) * | 2015-08-20 | 2016-01-20 | 及时标讯网络信息技术（北京）有限公司 | Chinese AC (Aho-Corasick) automaton working method based on keyword dictionary tree structure |
| CN107291785A (en) * | 2016-04-12 | 2017-10-24 | 滴滴（中国）科技有限公司 | A kind of data search method and device |
| CN109074370A (en) * | 2016-04-12 | 2018-12-21 | 北京嘀嘀无限科技发展有限公司 | The system and method for determining point of interest |
| CN106777118A (en) * | 2016-12-16 | 2017-05-31 | 武汉大学 | A kind of quick abstracting method of geographical vocabulary based on fuzzy dictionary tree |
| CN109344213A (en) * | 2018-08-28 | 2019-02-15 | 浙江工业大学 | A kind of Chinese Geocoding based on dictionary tree |
| CN109299747A (en) * | 2018-10-24 | 2019-02-01 | 北京字节跳动网络技术有限公司 | Determination method, apparatus, computer equipment and the storage medium at one type cluster center |
Non-Patent Citations (4)
| Title |
|---|
| FATEMA RAHMAN等: "The Area Code Tree for Nearest Neighbour Searching", 《2015 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING》 * |
| PHAM THI THIET: "基于前缀树结构的序列模式挖掘算法研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
| ZHAN-YA XU等: "An Effective Data Indexing Method for POI Data", 《2015 23RD INTERNATIONAL CONFERENCE ON GEOINFORMATICS》 * |
| 张明杰: "车载导航软件中离线POI检索系统的设计与实现", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110726418A (en) * | 2019-10-10 | 2020-01-24 | 北京百度网讯科技有限公司 | Method, device and equipment for determining interest point region and storage medium |
| US11740102B2 (en) | 2019-10-10 | 2023-08-29 | Beijing Baidu Netcom Science Technology Co., Ltd. | Method, apparatus, device and storage medium for determining point of interest area |
| CN111078919A (en) * | 2019-11-15 | 2020-04-28 | 浙江省第一测绘院 | Sudoku-based large-scale vector data suspension processing method |
| CN111078919B (en) * | 2019-11-15 | 2023-09-12 | 浙江省测绘科学技术研究院 | Large-scale vector data suspension processing method based on nine grids |
| CN111881371A (en) * | 2020-05-21 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Method and system for establishing POI parent-child point pairs |
| CN114820960A (en) * | 2022-04-18 | 2022-07-29 | 北京百度网讯科技有限公司 | Method, device, equipment and medium for constructing map |
| CN114820960B (en) * | 2022-04-18 | 2022-12-16 | 北京百度网讯科技有限公司 | Method, device, equipment and medium for constructing map |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110287426B (en) | 2021-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110287426A (en) | Method for building up, device, storage medium and the processor of point of interest set membership | |
| CN115269751B (en) | Method for constructing geographic entity space-time knowledge graph ontology library | |
| JP4372477B2 (en) | Method and system for traversing a binary tree | |
| CN102411764B (en) | The data management system of grid equipment and management method | |
| CN107153711A (en) | Geographic information data processing method and processing device | |
| CN107170033A (en) | Smart city 3D live-action map systems based on laser radar technique | |
| CN104252489A (en) | Method for fast obtaining position character description information according to latitude and longitude data | |
| CN103927934A (en) | Closed fence drawing method and system | |
| CN108733803B (en) | Multi-user space keyword query method under road network | |
| CN111540051B (en) | CIM-based full-element mass data lightweight and topology analysis application platform | |
| CN108549690A (en) | Spatial key querying method and system based on space length constraint | |
| CN116050429B (en) | Geographic environment entity construction system and method based on multi-mode data association | |
| CN108151744A (en) | Indoor navigation system based on A-STAR algorithms | |
| CN102306106A (en) | Method and system for automatically generating navigation chart in virtual space, and pathfinding method and system | |
| CN109741209A (en) | Power distribution network multi-source data fusion method, system and storage medium under typhoon disaster | |
| CN108595613A (en) | GIS local maps edit methods and device | |
| CN109117433A (en) | Index tree object creation method and index method and related device thereof | |
| CN110825830B (en) | Data retrieval method for grid space | |
| CN113779430A (en) | Road network data generation method and device, computing equipment and storage medium | |
| CN106780667A (en) | A kind of hybrid index method of multi-layer image | |
| US6865479B2 (en) | Programmatically calculating paths from a spatially-enabled database | |
| Liu et al. | FHL-cube: multi-constraint shortest path querying with flexible combination of constraints | |
| Penninga et al. | A simplicial complex‐based DBMS approach to 3D topographic data modelling | |
| CN104392035B (en) | A kind of urban three-dimensional modeling method of sing on web | |
| CN113792068A (en) | Method and device for organizing and retrieving multi-level multi-topic spatial data |
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 |