CN109408738A - The querying method and system of spatial entities in a kind of transportation network - Google Patents
The querying method and system of spatial entities in a kind of transportation network Download PDFInfo
- Publication number
- CN109408738A CN109408738A CN201811052060.2A CN201811052060A CN109408738A CN 109408738 A CN109408738 A CN 109408738A CN 201811052060 A CN201811052060 A CN 201811052060A CN 109408738 A CN109408738 A CN 109408738A
- Authority
- CN
- China
- Prior art keywords
- unit
- attribute
- information
- inquiry request
- user
- 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
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/279—Recognition of textual entities
- G06F40/289—Phrasal analysis, e.g. finite state techniques or chunking
- G06F40/295—Named entity recognition
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses the querying method and system of spatial entities in a kind of transportation network, method includes: that transportation network is divided into multiple units；Calculate the unit maximum distance and unit minimum range between any two unit；Obtain inquiry request information；According to the information and inquiry request information in each unit, delete with the unmatched unit of inquiry request information, obtain object element；Calculate in object element locating for any a line and user the while maximum distance and side minimum range between；According to the information of each edge in object element and inquiry request information, unmatched side in object element is deleted, target side is obtained；According to inquiry request information, the spatial entities on target side are deleted, obtain object space entity.The present invention first deletes unit, then deletes the side in object element, finally deletes the spatial entities on target side, search efficiency not only can be improved, but also it is high to inquire accuracy rate.
Description
Technical field
The invention belongs to technical field of data processing, in particular in a kind of transportation network the querying method of spatial entities and
System.
Background technique
With extensive use of the positioning service technology in mobile Internet, spatial key query service also exists in recent years
Academia and industrial circle attract wide attention.The set of a known space text object such as the set of point of interest, and is based on
The inquiry request of user location and user query keyword, by Top-k spatial key inquire to obtain simultaneously space away from
From with the maximally related k object of the aspect of text similarity two.
Due to there is millions of spatial entities in system, and many users may issue inquiry the same time,
Therefore, the spatial entities unrelated with inquiry how are deleted as much as possible, are current to improve the matching performance between inquiry and entity
Urgent need to solve the problem.
Summary of the invention
The object of the present invention is to provide the querying methods and system of spatial entities in a kind of transportation network, realize quick search
The purpose of qualified spatial entities.
In a first aspect, the embodiment of the present invention provides a kind of querying method of spatial entities in transportation network, comprising:
Transportation network is divided into multiple units, each unit includes the information on the side in the transportation network and is located at described
The keyword message and attribute information of spatial entities on side；
Calculate the unit maximum distance and unit minimum range between any two unit；
The location information and inquiry request information of user are obtained, the inquiry request information includes range information, keyword
At least one of information, attribute information；
Most according to keyword message, attribute information, the unit maximum distance and the unit in each unit
At least one of small distance and the inquiry request information, delete with the unmatched unit of inquiry request information, obtain
Object element；
Calculate in the object element locating for any a line and the user between while maximum distance and side it is minimum
Distance；
According to the keyword message of each edge in the object element, attribute information, the side maximum distance and described
At least one of side minimum range and the inquiry request information, delete in the object element with the inquiry request information
Unmatched side obtains target side；
According to the inquiry request information, the spatial entities on the target side are deleted, the target empty is obtained
Between entity.
Further, it is described transportation network is divided into multiple units after, between the calculating any two unit
Before unit maximum distance and unit minimum range further include:
The spatial entities are pressed to the spatial entities in each side in each unit including same keyword
The arrangement of id information ascending order, obtains Keyword List；
Spatial entities in each side in each unit comprising same attribute are pressed with the attribute value of the attribute
Ascending order arrangement, obtains attribute list.
Further, the keyword message according in each unit, attribute information, the unit maximum distance
And at least one of described unit minimum range and the inquiry request information, it deletes and the inquiry request information mismatches
Unit, obtain object element and specifically include:
According to the location information of the user, unit locating for the user is obtained；
Unit minimum range locating for the user between unit and active cell is greater than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；Or；
According to the location information of the user, unit locating for the user is obtained；
Unit maximum distance locating for the user between unit and active cell is less than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；And/or；
When in the inquiry request information any keyword or any attribute title in active cell there is no key
When word list or attribute list, the active cell is deleted；And/or；
When value range and the corresponding attribute list in active cell of any attribute in the inquiry request information
When without intersection, the active cell is deleted；
According to the unit after deleting, object element is obtained.
Further, it is described according to the keyword message of each edge in the object element, attribute information, the side most
At least one of big distance and the side minimum range and the inquiry request information, delete in the object element with inquiry
The unmatched side of solicited message obtains target side and specifically includes:
According to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being greater than with minimum range while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；Or；
According to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being less than with maximum distance while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；And/or；
When in the inquiry request information any keyword or any attribute title in the object element work as front
In when Keyword List or attribute list is not present, delete and described work as front；And/or；
When the value range of any attribute in the inquiry request information and pair of the object element worked as in front
When the attribute list answered is without intersection, deletes and described work as front；
According to the side after deleting, target side is obtained in the object element.
Further, described according to the inquiry request information, the spatial entities on the target side are deleted, are obtained
It is specifically included to the object space entity:
Keyword List according to the keyword message and attribute information in the inquiry request information, on the target side
In mark keyword sublist, and mark attribute sublist in the attribute list on the target side；
The keyword sublist and the attribute sublist are subjected to ascending order arrangement by list length；
To by list length carry out ascending order arrangement after the keyword sublist and the attribute sublist successively ask friendship
Collection；
When the intersection is empty, the target side is deleted, when the intersection is not sky, the spatial entities in intersection are
For the object space entity.
Further, the unit maximum distance calculated between any two unit and unit minimum range are specifically wrapped
It includes:
Calculate the unit maximum road network distance and unit minimum road network distance between any two unit；
Calculate the maximum comprehensive traffic factor between any two unit and minimum traffic factor；
The product for calculating the unit maximum road network distance with the maximum comprehensive traffic factor, it is maximum to obtain the unit
Distance；
The product for calculating the unit minimum road network distance with the minimum comprehensive traffic factor, it is minimum to obtain the unit
Distance.
On the other hand, the embodiment of the present invention also provides a kind of inquiry system of spatial entities in transportation network, comprising:
Dividing elements module, for transportation network to be divided into multiple units, each unit includes in the transportation network
While information and positioned at it is described while on spatial entities keyword message and attribute information；
Computing module, for calculating unit maximum distance and unit minimum range between any two unit；
Obtain module, for obtaining the location information and inquiry request information of user, the inquiry request information include away from
From at least one of information, keyword message, attribute information；
Unit enquiry module, for maximum according to keyword message, attribute information, the unit in each unit
At least one of distance and the unit minimum range and the inquiry request information, are deleted with the inquiry request information not
Matched unit, obtains object element；
The computing module is also used to calculate in the object element between side locating for any a line and the user
While maximum distance and while minimum range；
Side enquiry module, for according to the keyword message of each edge in the object element, attribute information, the side
At least one of maximum distance and the side minimum range and the inquiry request information, delete in the object element with institute
The unmatched side of inquiry request information is stated, target side is obtained；
Spatial entities enquiry module, for according to the inquiry request information, to the spatial entities on the target side into
Row is deleted, and the object space entity is obtained.
Further, further includes: key word arrangements module, for in each side in each unit comprising same
The spatial entities of one keyword are arranged by the id information ascending order of the spatial entities, obtain Keyword List；
Attribute arranges module, for pressing to the spatial entities in each side in each unit including same attribute
The attribute value ascending order of the attribute arranges, and obtains attribute list.
Further, the unit enquiry module includes that unit inquires submodule and object element acquisition submodule,
The unit inquiry submodule has the function of following at least one；
Function one: according to the location information of the user, unit locating for the user is obtained；
Unit minimum range locating for the user between unit and active cell is greater than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；
Function two: according to the location information of the user, unit locating for the user is obtained；
Unit maximum distance locating for the user between unit and active cell is less than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；
Function three: when in the inquiry request information any keyword or any attribute title do not deposited in active cell
In Keyword List or attribute list, the active cell is deleted；
Function four: when value range and the corresponding category in active cell of any attribute in the inquiry request information
When property list is without intersection, the active cell is deleted；
The object element acquisition submodule, for obtaining object element according to the unit after deleting.
It is further, described that submodule and target side acquisition submodule are inquired when enquiry module includes,
The side inquiry submodule has the function of following at least one；
Function one: according to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being greater than with minimum range while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；
Function two: according to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being less than with maximum distance while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；
Function three: when in the inquiry request information any keyword or any attribute title in the object element
When Keyword List or attribute list are not present in front, delete and described work as front；
Function four: when the value range of any attribute in the inquiry request information and the object element work as front
In corresponding attribute list without intersection when, delete and described work as front；
Target side acquisition submodule, for obtaining target side in the object element according to the side after deleting.
The querying method and system of spatial entities, bring beneficial effect in a kind of transportation network provided through the invention
Are as follows: the present invention first passes through the distance between unit, keyword message and attribute information to delete the unit for not meeting querying condition,
Obtain the object element for meeting querying condition, then in object element according to while maximum distance, while minimum range, keyword believe
It ceases with attribute information and deletes the side for not meeting querying condition, obtain target side, finally the spatial entities on target side are carried out
It deletes, obtains object space entity；The present invention first deletes unit, deletes a large amount of ineligible units, to reduce
It is subsequent to delete workload, then the side in a small amount of object element is deleted, to delete a large amount of ineligible sides, finally
It is deleted to the spatial entities on target side, without comparing the information of each spatial entities one by one, inquiry not only can be improved
Efficiency, and it is higher to inquire accuracy rate.
Detailed description of the invention
Below by clearly understandable mode, preferred embodiment is described with reference to the drawings, to space in a kind of transportation network
The querying method of entity and above-mentioned characteristic, technical characteristic, advantage and its implementation of system are further described.
Fig. 1 is the flow diagram of the first embodiment of the querying method of spatial entities in a kind of transportation network of the present invention；
Fig. 2 is the transportation network figure of the querying method of spatial entities in a kind of transportation network of the present invention；
Fig. 3 is the flow diagram of the second embodiment of the querying method of spatial entities in a kind of transportation network of the present invention；
Fig. 4 is the classification chart that the list of the querying method of spatial entities in a kind of transportation network of the present invention is classified by side；
Fig. 5 is the flow diagram of the 5th embodiment of the querying method of spatial entities in a kind of transportation network of the present invention；
Fig. 6 is the structural representation frame of one embodiment of the inquiry system of spatial entities in a kind of transportation network of the present invention
Figure；
Fig. 7 is the structural representation frame of another embodiment of the inquiry system of spatial entities in a kind of transportation network of the present invention
Figure.
Specific embodiment
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, Detailed description of the invention will be compareed below
A specific embodiment of the invention.It should be evident that drawings in the following description are only some embodiments of the invention, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing, and obtain other embodiments.
To make simplified form, part related to the present invention is only schematically shown in each figure, they are not represented
Its practical structures as product.In addition, there is identical structure or function in some figures so that simplified form is easy to understand
Component only symbolically depicts one of those, or has only marked one of those.Herein, "one" is not only indicated
" only this ", can also indicate the situation of " more than one ".
First embodiment provided by the invention, as shown in Figure 1,
The querying method of spatial entities in a kind of transportation network, comprising:
Transportation network is divided into multiple units by S100, and each unit includes the information on the side in the transportation network and is located at
The keyword message and attribute information of spatial entities on the side；
S200 calculates the unit maximum distance and unit minimum range between any two unit；
S300 obtains the location information and inquiry request information of user, and the inquiry request information includes range information, closes
At least one of key word information, attribute information；
S400 is according to keyword message, attribute information, the unit maximum distance and the list in each unit
At least one of first minimum range and the inquiry request information, delete with the unmatched unit of inquiry request information,
Obtain object element；
S500 calculates in the object element locating for any a line and the user while maximum distance and side between
Minimum range；
S600 according to the keyword message of each edge in the object element, attribute information, the side maximum distance and
At least one of described side minimum range and the inquiry request information, delete in the object element with the inquiry request
The unmatched side of information, obtains target side；
S700 deletes the spatial entities on the target side, obtains the mesh according to the inquiry request information
Mark spatial entities.
Specifically, a transportation network is usually modeled as a direct graph with weight or undirected weighted graph G=(V, ē),
It is the set on a side that middle V, which is the set on a vertex, ē,.One vertex v ∈ V indicate transportation network a crossroad or
Terminal.A line e (vi, vj, l), represent two vertex vsiAnd vjBetween section (i ≠ j) and l indicate road segment segment length,
It include multiple spatial entities in each edge, spatial entities can refer to shop, public place, shop, office building etc..
Spatial entities E in transportation network is defined as: E=(E.tags, e.V, E.L), wherein E.tag is relevant retouches
The property stated label shows as a set of keyword, and E.V is one group of attribute-value pair, and E.L is the position of entity, shows as one and is located at friendship
Spatial point on open network road roadside.E.V is modeled as the conjunction expression of equal predicate, with the form matches user of Boolean expression
Enhancing wish.The size of E.V is the quantity of attribute value pair, is indicated with n.Therefore, spatial entities E can be expressed as follows:
E={ tags, P1=v1∩P2=v2…∩Pn=vn, E.L }
Predicate is defined as P(A, fop, v), wherein A is an attribute, and fop is an operator, and v is a value.
P(A、fop、v)Receive input value x, and export a Boolean to indicate whether operator constraint meets, it may be assumed that P(A, fop, v)(x)=
{0,1}。
P1=v1∩P2=v2…∩Pn=vnRepresenting Boolean expression, a Boolean expression is the connection of predicate, one
Boolean expression B be user specify, the meaning contamination under CNF form, such as:
B=P1(A,fop,v)(x)∩P2(A,fop,v)(x)∩…∩Pn(A,fop,v)(x)。
In view of the being basically unchanged property and spatial entities of network topology structure and the dynamic and life cycle of inquiry
Property.Using the method that sound separates, and propose the structure of layering.The static part of index, i.e. transportation network are constructed first
The spatial index on side, building method are that transportation network is divided into multiple units.Since the form of actual traffic network structure is more
The distribution of sample, node and side in a transportation network may be very unbalanced, also, in order to according to an entity
Coordinate, easily position the side where it, we devise a PMR quaternary tree (the random quaternary tree of polygon map).?
In PRM quaternary tree, each area foliage contains the ID on intersecting therewith side, and the ID on side refers to the number of opposite side, each
With unique number.This tree is that the side for being inserted into transportation network by iteration obtains.If the number of edges that area foliage includes
It has been more than a threshold value, it is divided into four new regions, and becomes this forerunner's node of four regions in the tree.Such as setting
Threshold value be 50, when the quantity on the side in area foliage is more than 50, automatically generate four new regions, and by area foliage
Interior side is divided into four new regions, and area foliage then becomes this forerunner's node of four regions in the tree, when four
When the quantity on the side in a region is more than threshold value, continue to create new region, each region is a unit.
Then the dynamic part of index, the i.e. text index of spatial entities are reconstructed, for each unit, we retain
Following items: a 1) set of keyword, i.e., the union of the set of keywords of all spatial entities in unit；2) one group of attribute includes
The all properties of all spatial entities in unit.For number attribute, we go back the maximum value of entity attributes in stick unit
And minimum value；For the attribute of classification, all possible values of the entity attribute in stick unit are gone back.
It, can be with for each vertex in transportation network in order to allow to seek traffic network structure from peak to vertex
The pointer for being directed toward its adjacent vertex is provided, the position as where one tree of building is used to be directed toward the adjacent vertex on a given vertex
It sets.
Delete unrelated spatial entities to use road network distance, we calculate between every a pair of of unit it is effective away from
From boundary, for each unit to ciAnd cj, we define a pair of of parameter, η-And η+, as shown in equation (1) and (2):
Wherein, dN(Ek,El) represent ciE in unitkWith cjE in unitlBetween road network distance, dE(Ek,El) represent ciIt is single
E in memberkWith cjE in unitlBetween Euclidean distance；
Position based on entity E and inquiry Q (inquiry user), the minimum and maximum road network distance between them can be as follows
It calculates (assuming that E is located at ci, Q is located at cQ)。
After user issues inquiry request, the location information and inquiry request information of user, inquiry request packet are obtained
Include at least one of range information, keyword message, attribute information.Inquiry request is represented by are as follows: Q=(Q.W, Q.B,
Q.L, k), wherein Q.W is the set of keywords of associated description, Q.B be user specify, the meaning contamination of CNF form, Q.L is
One spatial point being located on transportation network side, k are used to the quantity for indicating to return the result.Therefore, an enhancing spatial key
Inquiry Q can be expressed as follows:
Q={ Q.W, P1(A,fop,v)(x)∩P2(A,fop,v)(x)∩…∩Pn(A,fop,v)(x), Q.L, k }
Given inquiry Q and spatial entities E is met, i.e. keyword match, boolean and if only if these three requirements
Expression formula matching and spatial match, then Q is matched with E.
Keyword match refers to that each keyword of Q appears in E, i.e. Q.W ∈ E.tag then exists between Q and E
Keyword match.Attributes match, i.e. any attribute Q.B of Qi.A, it is included in E.V namely Q.Bi.A ∈ E.V, then Q and E it
Between there are attributes match.
Predicate matching enables E.ViIt is an attribute value pair in E, E.ViAnd E.V .AiIt .v is E.V respectivelyiAttribute and value.
Q is inquired for spatial entities E and enhancing spatial key, if there is predicate Q.BjIt is eligible: Q.Bi.A=E.ViAnd P .A
(q.Bj.A, Q.Bj.op, Q.Bj.v)(E.Vi.v)=1, then there are a predicate matchings by Q and E.
As shown in Fig. 2, thering are 8 spatial entities and 1 inquiry to be located on each road roadside of transportation network in figure.Each space
The keyword of entity, attribute value and position are as follows:
The keyword and attribute value of spatial entities are as follows:
E1: ({ fish, pizza, bread }, { rating=4.5, pcc=70, no_smoking=yes }, l1)
E2: ({ pizza, Italian, bread }, { rating=4.6, pcc=65, no_smoking=yes }, l2)
E3: ({ coffee, Italian }, { rating=4.2, pcc=78 }, l3)
E4: ({ coffee, Italian }, { rating=4.6, pcc=55, no_smoking=yes }, l4)
E5: ({ pizza, Italian, coffee }, { rating=4.6, pcc, no_smoking=yes }, l5)
E6: ({ coffee, fish, bread }, { rating=4.3, pcc=45, no_smoking=yes }, l6)
E7: ({ Italian, fish, bread }, { rating=4.6, pcc=52 }, l7)
E8: ({ Italian, pizza, coffee }, { rating=4.5, pcc=56, no_smoking=yes }, l8)
The road network distance of spatial entities is as shown in table 1:
Table 1
| E | E1 | E2 | E3 | E4 | E5 | E6 | E7 | E8 |
| dN(E,Q) | 11 | 6.5 | 2.5 | 8.5 | 4 | 9 | 3 | 12 |
It can be seen that, each spatial entities has a set of keyword and one group of attribute value to providing its descriptive information.This
Outside, it also has a spatial position, is a spatial point on transportation network side.Because most of spatial entities are all users
It generates, number of keyword and/or attribute-value are to may not follow strictly certain specific mode.For example, spatial entities E1
There are three keyword and three attribute-values pair, and spatial entities E3There are two keyword and two attribute-values pair.Inquire user Q
Include four component parts: a group polling keyword { Italian (Italian), coffee (coffee) }, boolean's expression
Formula " user's evaluation (rating) >=4.3 ∩ pcc (pre-capita consumption volume)≤60 ", a spatial point lQIndicate working as inquiry user Q
Front position, a value k=2 indicate that top-2 related entities are acquired.Firstly, entity E3It is deleted, due to user's evaluation
(rating)<4.3 and pc (pre-capita consumption volume) c>78；Entity E7It is trimmed to about, since it does not include keyword " coffee
(coffee)"；Entity E5Top-1 as a result, because its be include all keys word of the inquiry and meet Boolean expression demand,
From the inquiry immediate entity of Q；Similar, entity E2It is deleted, entity E4It is returned as top-2 result.Because all remaining
Entity all compares E4Distance query Q is farther, and all remaining entities are all trimmed safely, and query processing process terminates.
We obtain between the keyword union, the union of attribute and each unit of all spatial entities of each unit
After unit maximum distance and unit minimum range, unrelated list can be deleted according to range information, keyword message and attribute information
Member obtains object element.It may include the spatial entities for meeting querying condition in the unit that object element, which refers to,.
After obtaining object element, we can calculate locating for any a line and user in object element between while
Maximum distance and side minimum range, then according to while distance, while on set of keywords and attribute set in object element
Side deleted, obtain target side, target when referring on there may be the spatial entities for meeting querying condition.
After obtaining target side, according to the range information, keyword message or attribute information pair for including in inquiry request information
Spatial entities on target side are deleted, and object space entity is obtained.
The present invention first deletes independent space entity from big unit, can delete a large amount of spatial entities,
Query context is reduced, then opposite side is deleted in object element, query context can be further reduced, finally in a small range
Spatial entities are deleted, the efficiency of inquiry not only can be improved, but also accuracy rate is high.
Second embodiment provided by the invention, as shown in figure 3,
The querying method of spatial entities in a kind of transportation network, on the basis of above-mentioned first embodiment, the present embodiment exists
After step S100, before step S200 further include:
It is real that S110 presses the space to the spatial entities in each side in each unit including same keyword
The id information ascending order of body arranges, and obtains Keyword List；
S120 presses the category of the attribute to the spatial entities in each side in each unit comprising same attribute
Property value ascending order arrangement, obtain attribute list.
Specifically, the present embodiment is identical in the preferred embodiment of above-mentioned first embodiment, with above-mentioned first embodiment
Step it is corresponding description this is no longer going to repeat them with effect, the relatively above-mentioned first embodiment of the present embodiment, step S100 it
Afterwards, it joined new step before step S200.In above-mentioned first embodiment, the keyword of spatial entities in unit has been obtained simultaneously
Collection and attribute union, at this point, we by include in unit same keyword spatial entities spatially entity id information ascending order
Arrangement obtains Keyword List, and will include that the spatial entities of same attribute press the attribute value ascending order arrangement of attribute in unit, obtains
To attribute list.Finally Keyword List and attribute list are being classified by the information on the side in unit.Above-mentioned steps
The sequence of S110 and step S120 can be exchanged.
Assuming that including three sides, respectively e in unit1、e2And e3, e1Upper includes spatial entities E2And E7, e2Upper includes sky
Between entity E6、E8And E11, e3Upper includes spatial entities E1、E3、E5、E10、E4And E9, the keyword and attribute value of spatial entities are such as
Shown in table 2:
Table 2
By side e1The upper spatial entities comprising same keyword and same attribute are ranked up respectively, by side e2Upper and side e3
On spatial entities be also ranked up, obtain the classification chart that list as shown in Figure 4 is classified by side, which includes key column
Table and attribute list.Spatial entities in unit are classified by the information on side, can be deleted to the side in object element
When subtracting, that improves side deletes efficiency.If given querying condition is Q.W={ k2,k3And Q.B=A1>5∩A2<5∩A3=y,
E can be intuitively seen very much in figure1Not about keyword k3Keyword List therefore can be directly by side e1It deletes.
3rd embodiment provided by the invention
The querying method of spatial entities in a kind of transportation network, on the basis of above-mentioned second embodiment, the present embodiment will
Step S400 is specifically refined are as follows:
According to the location information of the user, unit locating for the user is obtained；
Unit minimum range locating for the user between unit and active cell is greater than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；Or；
According to the location information of the user, unit locating for the user is obtained；
Unit maximum distance locating for the user between unit and active cell is less than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；And/or；
When in the inquiry request information any keyword or any attribute title in active cell there is no key
When word list or attribute list, the active cell is deleted；And/or；
When value range and the corresponding attribute list in active cell of any attribute in the inquiry request information
When without intersection, the active cell is deleted；
According to the unit after deleting, object element is obtained.
Specifically, the present embodiment is identical in the preferred embodiment of above-mentioned second embodiment, with above-mentioned second embodiment
Step it is corresponding description this is no longer going to repeat them with effect, the relatively above-mentioned second embodiment of the present embodiment, to step S400 into
Further refinement is gone.
When including range information in inquiry request information, unit can be deleted according to range information, such as be inquired
Range information in solicited message can be to directly input a distance value, indicate that inquiry is less than or greater than the space reality of the distance value
Body.The minimum range if spatial entities for being less than the distance value of inquiry, locating for the user between unit and active cell
When greater than distance value in inquiry request information, active cell can be deleted, active cell refers to the unit currently inquired.
If the spatial entities for being greater than the distance value of inquiry, the maximum distance locating for the user between unit and active cell is less than
When distance value in inquiry request information, active cell can be deleted.
Range information in inquiry request information can be also the quantity for returning to query result, such as return to the quantity of query result
It is 2, that is, needs to return to the two spaces entity for being best suitable for querying condition, therefore, we can calculate in unit locating for user
And the distance value apart from the spatial entities that user second is close and meets keyword requirement and each predicate requirement at present is found, it is set as
dk(dkValue can be changed during processing), minimum range is then greater than dkAll units delete.dkInitial value is infinite
Greatly, change, d with the distance value of the spatial entities for meeting keyword requirement and each predicate requirement foundkConsistently equal to work as
Before find, meet keyword requirement and each predicate requirement, the second close spatial entities from inquiry Q distance value is (to looking into
Ask the distance value of Q).
When in inquiry request information including keyword message and attribute information, if not including the key in active cell
When word list, then active cell is deleted.Similarly, if do not include the Property Name in active cell, active cell is deleted.If working as
In front unit include the Property Name, but in inquiry request information the corresponding attribute of the Property Name value range and attribute
When list is without intersection, the active cell is deleted.
It during actual queries, is inquired with specific reference to the querying condition carried in inquiry request information, inquires item
It is a variety of or whole that part may include one of range information, keyword message, attribute information.It is deleted when according to querying condition
After incoherent unit, then object element is obtained, object element is to delete remaining unit after incoherent unit.
Fourth embodiment provided by the invention
The querying method of spatial entities in a kind of transportation network, on the basis of above-mentioned second embodiment or 3rd embodiment
On, the present embodiment specifically refines step S600 are as follows:
According to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being greater than with minimum range while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；Or；
According to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being less than with maximum distance while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；And/or；
When in the inquiry request information any keyword or any attribute title in the object element work as front
In when Keyword List or attribute list is not present, delete and described work as front；And/or；
When the value range of any attribute in the inquiry request information and pair of the object element worked as in front
When the attribute list answered is without intersection, deletes and described work as front；
According to the side after deleting, target side is obtained in the object element.
Specifically, the present embodiment is the preferred embodiment of above-mentioned second embodiment and 3rd embodiment, real with above-mentioned second
Apply step identical in example it is corresponding description with effect this is no longer going to repeat them, the relatively above-mentioned second embodiment of the present embodiment with
3rd embodiment has carried out further refinement to step S600.
By deleting after obtaining object element unit, further the side in object element is deleted.Opposite side carries out
It deletes similar with the method deleted unit.It is equally to be deleted according to distance, keyword and attribute etc..
When including range information in inquiry request information, the side in object element can be deleted according to range information
Subtract, if the range information in inquiry request information can be to directly input a distance value, indicates that inquiry is less than or greater than the distance
The spatial entities of value.If the spatial entities for being less than the distance value of inquiry, the side locating for the user and when between front
When minimum range is greater than the distance value in inquiry request information, it can will be deleted when front.If inquiry is greater than the distance value
Spatial entities, then the side locating for the user and when the maximum distance between front is less than the distance value in inquiry request information can
It will be deleted when front.
Range information in inquiry request information can be also the quantity for returning to query result, such as return to the quantity of query result
It is 2, that is, needs to return to the two spaces entity for being best suitable for querying condition, therefore, we can calculates and find distance at present and use
Family second is close and distance values of spatial entities that meet keyword requirement and each predicate requirement, is set as dk(dkValue is in treatment process
In can be changed), then by minimum range be greater than dkAll sides delete.dkInitial value is infinity, as the satisfaction found is crucial
Word requires the distance value of the spatial entities required with each predicate and changes, dkBe consistently equal to it is being currently found, meet keyword and want
Sum each predicate requirement, from inquiry Q the second close spatial entities distance value (to inquiry Q distance value).
When in inquiry request information including keyword message and attribute information, if when not including the keyword in front
When list, then deletes and work as front.Similarly, if deleting when not including the Property Name in front and working as front.If working as front Zhong Bao
Containing the Property Name, but the value range of the corresponding attribute of the Property Name and attribute list are without intersection in inquiry request information
When, it deletes and deserves front.
It during actual queries, is inquired with specific reference to the querying condition carried in inquiry request information, inquires item
It is a variety of or whole that part may include one of range information, keyword message, attribute information.When according to querying condition in mesh
After deleting incoherent side in mark unit, then target side is obtained, after target is when being to delete incoherent, remaining side.
5th embodiment provided by the invention, as shown in figure 5,
The querying method of spatial entities in a kind of transportation network, it is real in above-mentioned second embodiment or 3rd embodiment or the 4th
On the basis of applying example, the present embodiment specifically refines step S700 are as follows:
710 keyword according to the keyword message and attribute information in the inquiry request information, on the target side
Keyword sublist is marked in list, and marks attribute sublist in the attribute list on the target side；
The keyword sublist and the attribute sublist are carried out ascending order arrangement by list length by 720；
730 pairs by list length carry out ascending order arrangement after the keyword sublist and the attribute sublist successively ask
Intersection；
740, when the intersection is empty, delete the target side, and when the intersection is not sky, the space in intersection is real
Body is the object space entity.
Specifically, the present embodiment is the preferred embodiment of above-mentioned second embodiment and 3rd embodiment and fourth embodiment,
The corresponding description of the step identical with above-mentioned second embodiment, 3rd embodiment and fourth embodiment and effect be not another herein
One repeats, and the relatively above-mentioned second embodiment of the present embodiment, 3rd embodiment and fourth embodiment have carried out into one step S700
The refinement of step.
As shown in figure 4, after Keyword List and attribute list are classified by side, being obtained in above-mentioned second embodiment
To the classification chart of spatial entities.If inquiry request is Q.W={ k2, k3And Q.B=A1>5∩A2<5∩A3=y, i.e. inquiry request
It include keyword message K in information2And K3, include attribute information A1> 5 and A2< 5 and A3=y, due to side e1, be free of keyword K3
List is deleted, obtains target side e2And e3, at this time in target side e2And e3It is middle by k2、k3And meet Q.B condition
A1、A2And A3List mark come out, oval marks as dashed lines go out be keyword sublist and attribute sublist, so
Keyword sublist and attribute sublist that dotted ellipse is marked are ranked up according to the length of list afterwards, side e2In
Sublist is ordered as k3、A1、A2、A3、k2, by two shortest list k3And A1After intersection, an empty list is obtained, it was demonstrated that e2
It is unsatisfactory for querying condition, Ying Jiang e2It is deleted.For side e3, five sublist are obtained first, then carry out five sublist
Sequence are as follows: k2、k3、A1、A2、A3, by k2、k3、A1、A2、A3After sublist successively seeks common ground, spatial entities E is obtained5And E9, as
Object space entity.
Sixth embodiment provided by the invention
The querying method of spatial entities in a kind of transportation network, it is real in above-mentioned second embodiment or 3rd embodiment or the 4th
On the basis of applying example or the 5th embodiment, the present embodiment specifically refines step S200 are as follows:
Calculate the unit maximum road network distance and unit minimum road network distance between any two unit；
Calculate the maximum comprehensive traffic factor between any two unit and minimum traffic factor；
The product for calculating the unit maximum road network distance with the maximum comprehensive traffic factor, it is maximum to obtain the unit
Distance；
The product for calculating the unit minimum road network distance with the minimum comprehensive traffic factor, it is minimum to obtain the unit
Distance.
Specifically, the present embodiment is above-mentioned second embodiment and 3rd embodiment and fourth embodiment and the 5th embodiment
Preferred embodiment, the step identical with above-mentioned second embodiment, 3rd embodiment, fourth embodiment and the 5th embodiment are corresponding
Description and effect this is no longer going to repeat them, the relatively above-mentioned second embodiment of the present embodiment, 3rd embodiment, fourth embodiment
With the 5th embodiment, further refinement has been carried out to step S200.
In inquiry, unit maximum distance and unit minimum range can refer to maximum road network distance and minimal path between unit
Net distance.But in real life, the travelling cost of vehicle is not only and is determined by the length of road in system, also according to
The some additional traffic factors of Lai Yu, such as weather conditions fwc, congestion in road situation fcc, lane situation flc, road line style fraThe road and
Road intersection type fit。
Weather condition fwc, hourage may be influenced by weather is very big, because bad weather can reduce transportation network
The traffic capacity.Than being taken in In The Heart of The Sun the time required to rainy day or snowy day are from family driving to job site
Between to grow, rain and snow caused by influence be they intensity function.There is result of study to show by slight, moderate and heavy rain,
It influences, hourage increases separately: 0.1% to 2.1%, 1.5% to 3.8%, 4.0% to 6.0%.Slight snow and heavy snow lead to trip
The row time increases separately 5.5% to 7.6% and 7.4% to 11.4%.Therefore, we define five kinds of different weather conditions, fine
Bright, light rain, moderate rain, heavy rain/slight snow, heavy snow, assignment is from 0 to 4 respectively.
Traffic congestion fcc, congestion in road also has a great impact to driving time.To the section of same distance, smoothly road
Road driving time is in the much shorter than time travelled on traffic congestion road.Therefore, we define three kinds of different friendships
Logical jam situation, be respectively smoothly, slightly congestion, severe congestion, and be assigned a value of 0,2 and 4 respectively.
Lane condition flc, traffic flow can be there are two types of situation: division and unallocated.For unallocated traffic flow,
All vehicles (motor vehicles, non power driven vehicle) are travelled on a road.Motor vehicles and non power driven vehicle are mingled in
Together, the interference between them is huge certainly, and the traffic ability of road will be also greatly affected.Importantly, by
This gives driver's bring sense of insecurity, them can be allowed to be difficult to improve drive speed., whereas if traffic flow is divided, it is avoided that
Interference between motor vehicles and non power driven vehicle, between the vehicle of different directions, thus make drive become easy, speed more
Fastly.Lane width is another key factor for determining car speed on road, when lane width is lower than 3.5 meters, is considered as
Bus capacity decline bring is influenced.Therefore, we define four different road track conditions, are divided into lane and draw
Point and wide, driveway partition and it is narrow, lane is unallocated and wide, lane is unallocated and narrow, be assigned a value of 0,1,2 and 3 respectively.
Road line style fra, the road of transportation network is made of straightway and curve.Compared with straight way, curved road section needs
More driving times.In addition, the vertical section of road is segmented into the straight line and vertical song of straight line that is horizontal, going up a slope, descending
Line.Later in the case of three kinds, the speed of driving will all be affected.We are referred to as them inclined (acclive).
Therefore, we define four kinds of different road line styles, are straight line and level (maximum vertical gradient is less than 5%) respectively,
Curve and level, straight line and acclive and curve and acclive, and it is assigned a value of 0,1,2 and 3 respectively.
Intersection type fit, the form of intersection are generally divided into two kinds: level-crossing and three dimensional intersection mouth.It is right
In level-crossing, there is many points of impingement and cross-point and the big blind area of vehicle driver, therefore traffic ability by
Very big influence.And three dimensional intersection mouth can reduce or eliminate the impact of crossroad bring, to fundamentally improve road
The traffic capacity.Therefore, we define two different intersection types, level-crossing and three dimensional intersection mouth, and
Assignment 2 and 0 respectively.
In order to calculate actual travelling cost, we are defined a factor Cftc (multi-stress of travel cost), right
Each edge e (vi, vj) in the transportation network of reality, calculates and keeps its Cftc, specific as follows:
Wherein, f1To f5Represent five additional factors, i.e. side (vi,vj) fwc, fcc, flc, fraAnd fit, MaxfwcExtremely
maxfitRefer to the maximum value of these factors, w1To w5It is the weight of these factors.Each weighted value value owns between 0 to 1
The sum of weight of the factor is equal to 1.
In order to calculate the practical travelling cost of every road roadside e, we joined the additional traffic factor of e.In addition, in order to
More accurately unrelated unit can be trimmed according to weighting road network distance value, for each unit to ciAnd cj, calculate
And retain from ciOn side eiTo cjOn side ejOn the shortest path passed through the maximum value of each additional traffic factor on each side and
Minimum value.For unit ci, each additional traffic factor f on each sidej(ci) maximum value and minimum value carried out according to preset condition
It chooses.Therefore, the minimum and maximum weighted network distance between E and QWithIt is defined as foloows (false
If E is located at unit ciIt is located at unit c with QQ)。
Similar, it can be with computing unit ciWith inquiry Q institute between cells minimum and maximum weighting road network apart from (assuming that
Q is located at unit cQ)。
At this point, unit maximum distance is maximum weighted road network distance, unit minimum range be minimum weight road network away from
From.Similarly, can calculate while maximum distance and while minimum range.
7th embodiment provided by the invention, as shown in fig. 6,
The inquiry system of spatial entities in a kind of transportation network, comprising:
Dividing elements module 100, for transportation network to be divided into multiple units, each unit includes in the transportation network
While information and positioned at it is described while on spatial entities keyword message and attribute information；
Computing module 200, for calculating unit maximum distance and unit minimum range between any two unit；
Module 300 is obtained, for obtaining the location information and inquiry request information of user, the inquiry request information includes
At least one of range information, keyword message, attribute information；
Unit enquiry module 400, for according to keyword message, attribute information, the unit in each unit
At least one of maximum distance and the unit minimum range and the inquiry request information are deleted and are believed with the inquiry request
Unmatched unit is ceased, object element is obtained；
Computing module 200 is also used to calculate in the object element between side locating for any a line and the user
While maximum distance and while minimum range；
Side enquiry module 500, for according to the keyword message of each edge in the object element, attribute information, institute
State while maximum distance and it is described while at least one of the minimum range and inquiry request information, delete in the object element
With the unmatched side of inquiry request information, target side is obtained；
Spatial entities enquiry module 600 is used for according to the inquiry request information, to the spatial entities on the target side
It is deleted, obtains the object space entity.
The concrete mode that modules in the present embodiment execute operation carries out in the embodiment of the method
Detailed description, no detailed explanation will be given here.
8th embodiment provided by the invention, as shown in fig. 7,
The inquiry system of spatial entities in a kind of transportation network, comprising:
Dividing elements module 100, for transportation network to be divided into multiple units, each unit includes in the transportation network
While information and positioned at it is described while on spatial entities keyword message and attribute information；
Computing module 200, for calculating unit maximum distance and unit minimum range between any two unit；
Module 300 is obtained, for obtaining the location information and inquiry request information of user, the inquiry request information includes
At least one of range information, keyword message, attribute information；
Unit enquiry module 400, for according to keyword message, attribute information, the unit in each unit
At least one of maximum distance and the unit minimum range and the inquiry request information are deleted and are believed with the inquiry request
Unmatched unit is ceased, object element is obtained；
Computing module 200 is also used to calculate in the object element between side locating for any a line and the user
While maximum distance and while minimum range；
Side enquiry module 500, for according to the keyword message of each edge in the object element, attribute information, institute
State while maximum distance and it is described while at least one of the minimum range and inquiry request information, delete in the object element
With the unmatched side of inquiry request information, target side is obtained；
Spatial entities enquiry module 600 is used for according to the inquiry request information, to the spatial entities on the target side
It is deleted, obtains the object space entity.
Preferably, further includes:
Key word arrangements module 700, for the sky in each side in each unit including same keyword
Between entity by the spatial entities id information ascending order arrange, obtain Keyword List；
Attribute arranges module 800, for the space reality in each side in each unit including same attribute
Body is arranged by the attribute value ascending order of the attribute, obtains attribute list.
Preferably, the unit enquiry module includes that unit inquires submodule 410 and object element acquisition submodule 420,
The unit inquiry submodule 410 has the function of following at least one；
Function one: according to the location information of the user, unit locating for the user is obtained；
Unit minimum range locating for the user between unit and active cell is greater than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；
Function two: according to the location information of the user, unit locating for the user is obtained；
Unit maximum distance locating for the user between unit and active cell is less than to be believed according to the inquiry request
Range information in breath obtain apart from when, delete the active cell；
Function three: when in the inquiry request information any keyword or any attribute title do not deposited in active cell
In Keyword List or attribute list, the active cell is deleted；
Function four: when value range and the corresponding category in active cell of any attribute in the inquiry request information
When property list is without intersection, the active cell is deleted；
The object element acquisition submodule 420, for obtaining object element according to the unit after deleting.
Preferably, described to inquire submodule 510 and target side acquisition submodule 520 when enquiry module 500 includes, it is described
Side inquiry submodule 510 has the function of following at least one；
Function one: according to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being greater than with minimum range while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；
Function two: according to the location information of the user, side locating for the user is obtained；
It is asked according to the inquiry while being less than with maximum distance while in front in object element locating for the user
Ask that the range information in information obtains apart from when, delete and described work as front；
Function three: when in the inquiry request information any keyword or any attribute title in the object element
When Keyword List or attribute list are not present in front, delete and described work as front；
Function four: when the value range of any attribute in the inquiry request information and the object element work as front
In corresponding attribute list without intersection when, delete and described work as front；
Target side acquisition submodule 520, for obtaining target in the object element according to the side after deleting
Side.
Preferably, the spatial entities enquiry module 600 includes:
Sublist marks submodule 610, for according to the keyword message and attribute information in the inquiry request information,
Keyword sublist is marked in the Keyword List on the target side, and is marked in the attribute list on the target side
Attribute sublist；
Sublist sorting sub-module 620, for the keyword sublist and the attribute sublist to be pressed list length
Carry out ascending order arrangement；
Spatial entities acquisition submodule 630, for the target side being deleted, when the intersection when the intersection is empty
When being not empty, the spatial entities in intersection are the object space entity.
Preferably, computing module 200 includes:
Computational submodule, for calculate unit maximum road network distance between any two unit and unit minimum road network away from
From；
The maximum comprehensive traffic factor for being also used to calculate between any two unit and minimum traffic factor；
It is also used to calculate the product of the unit maximum road network distance with the maximum comprehensive traffic factor, obtains the list
First maximum distance；
It is also used to calculate the product of the unit minimum road network distance with the minimum comprehensive traffic factor, obtains the list
First minimum range.
The concrete mode that modules in the present embodiment execute operation carries out in the embodiment of the method
Detailed description, no detailed explanation will be given here.
It should be noted that above-described embodiment can be freely combined as needed.The above is only of the invention preferred
Embodiment, it is noted that for those skilled in the art, in the premise for not departing from the principle of the invention
Under, several improvements and modifications can also be made, these modifications and embellishments should also be considered as the scope of protection of the present invention.
Claims (10)
1. the querying method of spatial entities in a kind of transportation network characterized by comprising
Transportation network is divided into multiple units, each unit include in the transportation network while information and when being located at described on
Spatial entities keyword message and attribute information；
Calculate the unit maximum distance and unit minimum range between any two unit；
Obtain user location information and inquiry request information, the inquiry request information include range information, keyword message,
At least one of attribute information；
According to keyword message, attribute information, the unit maximum distance and the unit most narrow spacing in each unit
From at least one of and the inquiry request information, delete with the unmatched unit of inquiry request information, obtain target
Unit；
Calculate in the object element locating for any a line and the user while maximum distance and side minimum range between；
According to the keyword message of each edge in the object element, attribute information, it is described in maximum distance and it is described while most
At least one of small distance and the inquiry request information are not deleted in the object element with the inquiry request information not
The side matched obtains target side；
According to the inquiry request information, the spatial entities on the target side are deleted, object space entity is obtained.
2. the querying method of spatial entities in a kind of transportation network according to claim 1, which is characterized in that incited somebody to action described
Transportation network is divided into after multiple units, the unit maximum distance and unit minimum range calculated between any two unit
Before further include:
The spatial entities in each side in each unit including same keyword are believed by the ID of the spatial entities
Ascending order arrangement is ceased, Keyword List is obtained；
Spatial entities in each side in each unit comprising same attribute are pressed with the attribute value ascending order of the attribute
Arrangement, obtains attribute list.
3. the querying method of spatial entities in a kind of transportation network according to claim 2, which is characterized in that the basis
In keyword message, attribute information, the unit maximum distance and the unit minimum range in each unit extremely
The few a kind of and inquiry request information, delete with the unmatched unit of inquiry request information, it is specific to obtain object element
Include:
According to the location information of the user, unit locating for the user is obtained；
Unit minimum range locating for the user between unit and active cell is greater than according in the inquiry request information
Range information obtain apart from when, delete the active cell；Or；
According to the location information of the user, unit locating for the user is obtained；
Unit maximum distance locating for the user between unit and active cell is less than according in the inquiry request information
Range information obtain apart from when, delete the active cell；
And/or；
When in the inquiry request information any keyword or any attribute title in active cell be not present corresponding pass
When the list of key word or corresponding attribute list, the active cell is deleted；
And/or；
When any attribute in the inquiry request information value range with the corresponding attribute list in active cell without friendship
When collection, the active cell is deleted；
According to the unit after deleting, object element is obtained.
4. the querying method of spatial entities in a kind of transportation network according to claim 2, which is characterized in that the basis
The keyword message of each edge in the object element, attribute information, it is described in maximum distance and it is described while minimum range in
At least one and the inquiry request information, delete in the object element with the unmatched side of inquiry request information,
Target side is obtained to specifically include:
According to the location information of the user, side locating for the user is obtained；
Believed according to the inquiry request while being greater than with minimum range while in front in object element locating for the user
Range information in breath obtain apart from when, delete and described work as front；Or；
According to the location information of the user, side locating for the user is obtained；
Believed according to the inquiry request while being less than with maximum distance while in front in object element locating for the user
Range information in breath obtain apart from when, delete and described work as front；
And/or；
When any keyword or any attribute title the working as in front not in the object element in the inquiry request information
There are when the Keyword List or attribute list, delete described to work as front；
And/or；
When value range and the object element of any attribute in the inquiry request information belong to when corresponding in front
Property list without intersection when, delete and described work as front；
According to the side after deleting, target side is obtained in the object element.
5. according to the querying method of spatial entities in a kind of described in any item transportation networks of claim 2-4, which is characterized in that
It is described that the spatial entities on the target side are deleted according to the inquiry request information, it is real to obtain the object space
Body specifically includes:
According to the keyword message and attribute information in the inquiry request information, the Keyword List on the target side is got the bid
Remember keyword sublist out, and marks attribute sublist in the attribute list on the target side；
The keyword sublist and the attribute sublist are subjected to ascending order arrangement by list length；
To by list length carry out ascending order arrangement after the keyword sublist and the attribute sublist successively seek common ground；
When the intersection is empty, the target side is deleted, when the intersection is not sky, the spatial entities in intersection are institute
State object space entity.
6. the querying method of spatial entities in a kind of transportation network according to claim 1, which is characterized in that the calculating
Unit maximum distance and unit minimum range between any two unit specifically include:
Calculate the unit maximum road network distance and unit minimum road network distance between any two unit；
Calculate the maximum comprehensive traffic factor between any two unit and minimum traffic factor；
The product for calculating the unit maximum road network distance with the maximum comprehensive traffic factor, obtain the unit maximum away from
From；
The product for calculating the unit minimum road network distance with the minimum comprehensive traffic factor, obtains the unit most narrow spacing
From.
7. the inquiry system of spatial entities in a kind of transportation network characterized by comprising
Dividing elements module, for transportation network to be divided into multiple units, each unit includes the side in the transportation network
The keyword message and attribute information of information and the spatial entities on the side；
Computing module, for calculating unit maximum distance and unit minimum range between any two unit；
Module is obtained, for obtaining the location information and inquiry request information of user, the inquiry request information includes distance letter
At least one of breath, keyword message, attribute information；
Unit enquiry module, for according to the keyword message in each unit, attribute information, the unit maximum distance
And at least one of described unit minimum range and the inquiry request information, it deletes and the inquiry request information mismatches
Unit, obtain object element；
The computing module, be also used to calculate in the object element locating for any a line and the user between while most
Big distance and side minimum range；
Side enquiry module, for maximum according to the keyword message of each edge in the object element, attribute information, the side
At least one of distance and the side minimum range and the inquiry request information, delete in the object element and look into described
The unmatched side of solicited message is ask, target side is obtained；
Spatial entities enquiry module, for being deleted to the spatial entities on the target side according to the inquiry request information
Subtract, obtains the object space entity.
8. the inquiry system of spatial entities in a kind of transportation network according to claim 7, which is characterized in that further include:
Key word arrangements module, for being pressed to the spatial entities in each side in each unit including same keyword
The id information ascending order of the spatial entities arranges, and obtains Keyword List；
Attribute arranges module, described for pressing to the spatial entities in each side in each unit including same attribute
The attribute value ascending order of attribute arranges, and obtains attribute list.
9. the inquiry system of spatial entities in a kind of transportation network according to claim 8, which is characterized in that the unit
Enquiry module includes that unit inquires submodule and object element acquisition submodule,
The unit inquiry submodule has the function of following at least one；
Function one:
According to the location information of the user, unit locating for the user is obtained；
Unit minimum range locating for the user between unit and active cell is greater than according in the inquiry request information
Range information obtain apart from when, delete the active cell；
Function two:
According to the location information of the user, unit locating for the user is obtained；
Unit maximum distance locating for the user between unit and active cell is less than according in the inquiry request information
Range information obtain apart from when, delete the active cell；
Function three:
When in the inquiry request information any keyword or any attribute title in active cell be not present key column
When table or attribute list, the active cell is deleted；
Function four:
When any attribute value range in the inquiry request information with the corresponding attribute list in active cell without intersection
When, delete the active cell；
The object element acquisition submodule, for obtaining object element according to the unit after deleting.
10. the inquiry system of spatial entities in a kind of transportation network according to claim 8, which is characterized in that the side
Enquiry module includes the acquisition submodule when inquiring submodule and target,
The side inquiry submodule has the function of following at least one；
Function one:
According to the location information of the user, side locating for the user is obtained；
Believed according to the inquiry request while being greater than with minimum range while in front in object element locating for the user
Range information in breath obtain apart from when, delete and described work as front；
Function two:
According to the location information of the user, side locating for the user is obtained；
Believed according to the inquiry request while being less than with maximum distance while in front in object element locating for the user
Range information in breath obtain apart from when, delete and described work as front；
Function three:
When any keyword or any attribute title the working as in front not in the object element in the inquiry request information
There are when Keyword List or attribute list, delete described to work as front；
Function four:
When value range and the object element of any attribute in the inquiry request information belong to when corresponding in front
Property list without intersection when, delete and described work as front；
Target side acquisition submodule, for obtaining target side in the object element according to the side after deleting.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811052060.2A CN109408738B (en) | 2018-09-10 | 2018-09-10 | Method and system for querying space entity in traffic network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811052060.2A CN109408738B (en) | 2018-09-10 | 2018-09-10 | Method and system for querying space entity in traffic network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109408738A true CN109408738A (en) | 2019-03-01 |
| CN109408738B CN109408738B (en) | 2021-04-06 |
Family
ID=65464621
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811052060.2A Expired - Fee Related CN109408738B (en) | 2018-09-10 | 2018-09-10 | Method and system for querying space entity in traffic network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109408738B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110147424A (en) * | 2019-05-21 | 2019-08-20 | 湖南大学 | A kind of Top-k interblock space keyword query method and system |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104978420A (en) * | 2015-06-30 | 2015-10-14 | 百度在线网络技术（北京）有限公司 | Traveling route matching method and apparatus |
| US20160019248A1 (en) * | 2014-07-21 | 2016-01-21 | Oracle International Corporation | Methods for processing within-distance queries |
| WO2016187313A1 (en) * | 2015-05-18 | 2016-11-24 | University Of Maryland, College Park | Road distance systems and methods |
| CN106570062A (en) * | 2016-10-08 | 2017-04-19 | 中国人民解放军理工大学 | System and method for querying uncertain moving object range of road network trajectory |
| US20170193095A1 (en) * | 2015-12-31 | 2017-07-06 | Quixey, Inc. | Machine Processing of Search Query based on Grammar Rules |
| CN107145526A (en) * | 2017-04-14 | 2017-09-08 | 浙江大学 | Geographical social activity keyword Reverse nearest neighbor inquiry processing method under a kind of road network |
| CN107273414A (en) * | 2017-05-05 | 2017-10-20 | 广州恒巨信息科技有限公司 | A kind of searching method based on geographical position |
| CN107341193A (en) * | 2017-06-14 | 2017-11-10 | 中国神华能源股份有限公司 | Mobile object querying method in road network |
| CN107402966A (en) * | 2017-06-23 | 2017-11-28 | 口碑控股有限公司 | The computational methods and device and electronic equipment of hunting zone |
-
2018
- 2018-09-10 CN CN201811052060.2A patent/CN109408738B/en not_active Expired - Fee Related
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160019248A1 (en) * | 2014-07-21 | 2016-01-21 | Oracle International Corporation | Methods for processing within-distance queries |
| WO2016187313A1 (en) * | 2015-05-18 | 2016-11-24 | University Of Maryland, College Park | Road distance systems and methods |
| CN104978420A (en) * | 2015-06-30 | 2015-10-14 | 百度在线网络技术（北京）有限公司 | Traveling route matching method and apparatus |
| US20170193095A1 (en) * | 2015-12-31 | 2017-07-06 | Quixey, Inc. | Machine Processing of Search Query based on Grammar Rules |
| CN106570062A (en) * | 2016-10-08 | 2017-04-19 | 中国人民解放军理工大学 | System and method for querying uncertain moving object range of road network trajectory |
| CN107145526A (en) * | 2017-04-14 | 2017-09-08 | 浙江大学 | Geographical social activity keyword Reverse nearest neighbor inquiry processing method under a kind of road network |
| CN107273414A (en) * | 2017-05-05 | 2017-10-20 | 广州恒巨信息科技有限公司 | A kind of searching method based on geographical position |
| CN107341193A (en) * | 2017-06-14 | 2017-11-10 | 中国神华能源股份有限公司 | Mobile object querying method in road network |
| CN107402966A (en) * | 2017-06-23 | 2017-11-28 | 口碑控股有限公司 | The computational methods and device and electronic equipment of hunting zone |
Non-Patent Citations (4)
| Title |
|---|
| YUNJUN GAO，等: "Efficient Reverse Top-k Boolean Spatial Keyword Queries on Road Networks", 《IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 》 * |
| 国土资源部土地利用管理司，等: "《城市地价动态监测理论与实践总论》", 31 October 2006 * |
| 李艳红，等: "空间网络数据库关键字查询的高效空中索引", 《华中科技大学学报（自然科学版）》 * |
| 李艳红，等: "路网中空间关键字连续k近邻查询算法研究", 《华中科技大学学报（自然科学版）》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110147424A (en) * | 2019-05-21 | 2019-08-20 | 湖南大学 | A kind of Top-k interblock space keyword query method and system |
| CN110147424B (en) * | 2019-05-21 | 2020-10-27 | 湖南大学 | Top-k combined space keyword query method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109408738B (en) | 2021-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109408712B (en) | Construction method of multidimensional information portrait of travel agency user | |
| CN101692224B (en) | High-resolution remote sensing image search method fused with spatial relation semantics | |
| CN106017490B (en) | A kind of map-indication method, navigation server and navigation system | |
| US12099907B2 (en) | Automated geospatial data analysis | |
| CN101847322B (en) | Method for confirming bus transfer lines | |
| CN103198151A (en) | Index inquiry system and method for running information of regional urban buses | |
| CN104133868B (en) | A kind of strategy integrated for the classification of vertical reptile data | |
| CN107766406A (en) | A kind of track similarity join querying method searched for using time priority | |
| CN104573560A (en) | Differential private data publishing method based on wavelet transformation | |
| Cui et al. | GIS-based method of delimitating trade area for retail chains | |
| CN103853838A (en) | Data processing method and device | |
| DE102022128026A1 (en) | SYSTEM AND METHOD FOR PROCESSING VEHICLE EVENT DATA FOR ENHANCED LANE DETERMINATION | |
| CN108898244A (en) | A kind of digital signage position recommended method coupling multi-source element | |
| CN109408738A (en) | The querying method and system of spatial entities in a kind of transportation network | |
| CN106909626A (en) | Improved Decision Tree Algorithm realizes search engine optimization technology | |
| CN104598548A (en) | Method and device for analyzing spatial correlation of agricultural product price | |
| Schoier et al. | Individual movements and geographical data mining. Clustering algorithms for highlighting hotspots in personal navigation routes | |
| CN112052405A (en) | Passenger searching area recommendation method based on driver experience | |
| DE102022128022A1 (en) | SYSTEM AND METHOD FOR PROCESSING VEHICLE EVENT DATA FOR IMPROVED POINT SNAPING OF ROAD SEGMENTS | |
| Derbal et al. | From spatial data warehouse and decision-making tool to SOLAP generalisation approach for efficient road risk analysis | |
| Xiong et al. | Geo-gap tree: A progressive query and visualization method for massive spatial data | |
| CN109558522A (en) | Method for building up, device and the computer readable storage medium of enterprise network figure | |
| CN107066486A (en) | A kind of cross-domain querying method of the visualization of Urban Data | |
| CN107908722B (en) | Reverse k ranking query method based on distance | |
| Hong et al. | A study on smart mobility in Kuala Lumpur |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210406 Termination date: 20210910 |