CN104346444B - A kind of the best site selection method based on the anti-spatial key inquiry of road network - Google Patents
A kind of the best site selection method based on the anti-spatial key inquiry of road network Download PDFInfo
- Publication number
- CN104346444B CN104346444B CN201410568900.6A CN201410568900A CN104346444B CN 104346444 B CN104346444 B CN 104346444B CN 201410568900 A CN201410568900 A CN 201410568900A CN 104346444 B CN104346444 B CN 104346444B
- Authority
- CN
- China
- Prior art keywords
- businessman
- inquiry
- keywords
- data point
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Remote Sensing (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)
Abstract
A kind of the best site selection method based on the anti-spatial key inquiry of road network, for data set using the index structure storage clustered based on connection, and travels through index using class Di Jiesitela searching methods；When index is traveled through, the present invention is calculated the candidate result of the potential competition businessman of inquiry businessman first；Verified followed by the dependency rule for proposing, judged whether it is real opponent.Present invention incorporates in the prior art of spatial database and anti-spatial key algorithm, and whole query process need not travel through whole data set, so as to provide optimum performance.
Description
Technical field
It is particularly a kind of based on the anti-spatial key inquiry of road network the present invention relates to the index and inquiring technology of database
The best site selection method.
Background technology
Spatial database is born and grows up as a kind of application technology, its purpose is to storing, managing
With the various geographical spatial datas (including spatial data and Non-spatial Data) of retrieval.At present, spatial database is widely used
In GIS-Geographic Information System, CAD, multimedia information system and data warehouse, deposited for system above provides data
Storage and inquiry solution.Road network spatial database as spatial database important component, because it is widely applied
Increasing concern is obtained.
In order to fast and effectively access road network spatial data, experts and scholars propose substantial amounts of spatial index mode.So far
Untill the present, it is the indexing means clustered based on connection to influence maximum, the most widely used index based on road network space.It is utilized
The adjacency information of existing road network, its build thought be on adjacent node and road network to any road-net node data point
Cluster storage respectively, then be indexed with B-tree, the purpose of access cost is minimized so as to reach.
On this basis, experts and scholars propose the various inquiries based on road network for differing from one another and solution, such as
K-NN search, continuous nearest neighbor query, reverse nearest neighbor queries.Reverse nearest neighbor inquiry wherein based on road network is to be recently proposed
A kind of novel inquiry.It is mainly inquired about from the angle of businessman, is returned based on road network distance influence user most to businessman
Many addresses, so as to carry out addressing recommendation to help businessman.
At present, for the existing ripe solution of road network Reverse nearest neighbor inquiry.But in some cases, road network is instead most
NN Query necessary not only for consider spatial information, text description information as data point important component, existing
It is not utilized effectively but in method.In order to preferably help businessman to make the best site selection decision-making, this requires that system can
Reverse nearest neighbor Query Result with text message under treatment road network environment.But existing method not can effectively solve the problem that.
The content of the invention
The present invention to overcome prior art can not effectively using text description information shortcoming, there is provided one kind based on road network it is anti-
The best site selection method of spatial key inquiry.
The technical solution adopted for the present invention to solve the technical problems step is as follows：
Step (1)：Existing Business Information is collected, index is set up to it, collect the inquiry alternative address information of businessman and text
Information；
Step (2)：For each alternative address of inquiry businessman, by class Di Jiesite pulling methods, and using inquiry text
This information, finds the businessman for having potential competition relation with inquiry businessman；
Step (3)：The potential competition of each the alternative address of inquiry businessman using judgment rule to being obtained in step (2)
Businessman is verified；
Step (4)：The optimal alternative address of inquiry businessman is found using the result in step (3).
The information of each businessman includes address information and text message in described step (1), and wherein address information is
Represented by a geographical coordinate, text message is represented by one or more groups of keywords；All Business Information are to pass through
Index is set up to it based on the index model that clusters of connection, index file contain all of businessman's geographical location information and
Text message, wherein geography information are stored in connection list file, and text message is deposited in data dot file；Inquiry businessman
All information are all stored in text.
For each alternative address of inquiry businessman in described step (2), by class Di Jiesite pulling methods, and utilize
Query text information, finds the businessman for having potential competition relation with inquiry businessman, is by judging keyword inclusive and road
Net distance realizes that the set of data points being calculated may namely constitute the businessman of competitive relation to inquiry businessman；In meter
, it is necessary to safeguard a storage road-net node and the node to the Priority Queues of inquiry seller addresses distance during calculation,
The head of the queue of the Priority Queues always nearest road-net node of current distance query point；Road network is extended by Di Jiesite pulling methods
During obtaining data point, in addition it is also necessary to which the counting tree safeguarded corresponding to current road-net node is used to preserve keyword count letter
Breath；Counting tree is by 2n- 1 node is constituted, and each node is respectively c comprising three count values1, c2And c3, wherein c1Expression is looked into
Ask the data point number that node is equal to current keyword to keyword in present node, c2Represent query node in present node
Data point number of the keyword comprising current keyword, c3Represent that query node is included to keyword on adjacent side in present node
The data point number of current keyword；If the c of all boundary node counting trees1Or c2Numerical value has all reached given k values, then road
Net extension terminates, because can not possibly there is potential opponent in the road network region of extension；Wherein, whether data point is being judged
During being potential competition businessman, point three kinds of situations consider：
2.1) set of keywords of the data point is queried the set of keywords of businessman and all includes, basis under this situation
The numerical value of correspondence keyword is divided into two kinds of situations and makes different disposal respectively in the counting tree of its current road-net node：
A) count value of the counting tree of the current road-net node corresponding to the data point set of keywords is less than given k
Value, then current data point is merged the counting tree correspondence numerical value for updating present node added to Candidate Set；
B) count value of the counting tree of the current road-net node corresponding to the data point set of keywords is more than or equal to and gives
Fixed k values, update the counting tree correspondence numerical value of present node；
2.2) set of keywords of the data point is queried the set of keywords part of businessman and includes, and is needed under this situation
The counting tree correspondence numerical value of present node is updated, not by data point addition candidate collection；
2.3) set of keywords of the data point is not queried the set of keywords of businessman and includes completely, under this situation not
Need to do any treatment to data point and counting tree.
Each of judgment rule to being obtained in step (2) is utilized to inquire about the alternative address of businessman in described step (3)
Potential competition businessman verified, is by verifying that the k of the potential competition businessman nearest businessman comprising its set of keywords be
It is no to realize comprising inquiry businessman；For each potential competition businessman to be verified, first have to position the business in the index
Family geographical position and set of keywords, further according to potential competition businessman to inquire about businessman distance range in, set of keywords
All businessman's quantity of the set of keywords comprising potential competition businessman are closed to judge；When judging, two kinds of situations need to be considered：
3.1) in the distance range of potential competition businessman to inquiry businessman, if more than or equal to k businessman, its
Set of keywords of the set of keywords comprising potential competition businessman, then the potential competition businessman is not the real competing of inquiry businessman
Strive businessman；
3.2) in the distance range of potential competition businessman to inquiry businessman, exist less than k businessman, its set of keywords
Set of keywords comprising potential competition businessman, then the potential competition businessman is the real opponent for inquiring about businessman.
The optimal alternative address of inquiry businessman is found in described step (4) using the result in step (3), is according to every
Real opponent's quantity that one alternative address has come what is realized, the real opponent's minimum number having it is standby
Selection of land location is the optimal alternative address for inquiring about businessman.
The invention has the advantages that：
The present invention takes full advantage of existing index technology in spatial database, and Reverse nearest neighbor is inquired about and looked into keyword
Inquiry technology, Query Result just can be obtained by the Business Information of only ergodic part road network scope, greatly reduce the I/O times and
CPU time, there is provided optimum performance.
Brief description of the drawings
Fig. 1 is implementation steps flow chart of the invention.
Fig. 2 is the operation principle schematic diagram of the best site selection method based on the anti-spatial key inquiry of road network.
Fig. 3 is inquiry schematic diagram.
Specific embodiment
Technical scheme is described further in conjunction with accompanying drawing and specific implementation：
Such as Fig. 1, shown in Fig. 2, specific implementation process of the present invention and operation principle are as follows：
Step (1)：Existing Business Information is collected, index is set up to it, collect the inquiry alternative address information of businessman and text
Information；
Step (2)：For each alternative address of inquiry businessman, by class Di Jiesite pulling methods, and using inquiry text
This information, finds the businessman for having potential competition relation with inquiry businessman；
Step (3)：The potential competition of each the alternative address of inquiry businessman using judgment rule to being obtained in step (2)
Businessman is verified；
Step (4)：The optimal alternative address of inquiry businessman is found using the result in step (3).
The information of each businessman includes address information and text message in step (1), and wherein address information is by one
What individual geographical coordinate was represented, text message is represented by one or more groups of keywords；All Business Information are by based on even
Connect the index model for clustering and index is set up to it, index file contains all of businessman's geographical location information and text envelope
Breath, wherein geography information are stored in connection list file, and text message is deposited in data dot file；Inquire about all letters of businessman
Breath is all stored in text.Specifically as shown in the index module in Fig. 2.
For each alternative address of inquiry businessman in step (2), by class Di Jiesite pulling methods, and using inquiry text
This information, finds the businessman for having potential competition relation with inquiry businessman, is by judging keyword inclusive and road network distance
Realize, the set of data points being calculated may namely constitute the businessman of competitive relation to inquiry businessman；In the mistake for calculating
It is preferential at this, it is necessary to safeguard a storage road-net node and the node to the Priority Queues of inquiry seller addresses distance in journey
The head of the queue of the queue always nearest road-net node of current distance query point；The acquisition number of road network is extended by Di Jiesite pulling methods
During strong point, in addition it is also necessary to which the counting tree safeguarded corresponding to current road-net node is used to preserve keyword count information；Count
Tree is by 2n- 1 node is constituted, and each node is respectively c comprising three count values1, c2And c3, wherein c1Represent that query node is arrived
Keyword is equal to the data point number of current keyword, c in present node2Represent query node to keyword bag in present node
Data point number containing current keyword, c3Represent that query node includes current key to keyword on adjacent side in present node
The data point number of word；If the c of all boundary node counting trees1Or c2Numerical value has all reached given k values, then Network extension knot
Beam, because can not possibly there is potential opponent in the road network region of extension.The step is specifically by the potential competition in Fig. 2
Businessman's computing engines are tried to achieve.Wherein, during judging whether data point is potential competition businessman, point three kinds of situations consider：
2.1) set of keywords of the data point is queried the set of keywords of businessman and all includes, basis under this situation
The numerical value of correspondence keyword is divided into two kinds of situations and makes different disposal respectively in the counting tree of its current road-net node：
A) count value of the counting tree of the current road-net node corresponding to the data point set of keywords is less than given k
Value, then current data point is merged the counting tree correspondence numerical value for updating present node added to Candidate Set；
B) count value of the counting tree of the current road-net node corresponding to the data point set of keywords is more than or equal to and gives
Fixed k values, update the counting tree correspondence numerical value of present node；
2.2) set of keywords of the data point is queried the set of keywords part of businessman and includes, and is needed under this situation
The counting tree correspondence numerical value of present node is updated, not by data point addition candidate collection；
2.3) set of keywords of the data point is not queried the set of keywords of businessman and includes completely, under this situation not
Need to do any treatment to data point and counting tree.
By taking query point q in Fig. 3 as an example, it will be seen that p4, p6, p7And p8To give up the point for falling, therefore need not be right
These click through step card of advancing.
Each of judgment rule to being obtained in step (2) is utilized to inquire about the potential competing of the alternative address of businessman in step (3)
Strive businessman to be verified, be by verifying whether the k of the potential competition businessman nearest businessman comprising its set of keywords includes
Businessman is inquired about to realize；For each potential competition businessman to be verified, first have to position in the index the ground of the businessman
Reason position and set of keywords, further according in the distance range of potential competition businessman to inquiry businessman, set of keywords is included
All businessman's quantity of the set of keywords of potential competition businessman judge.Specifically by Tu2Zhong potential competitions businessman filter engine
Calculating is tried to achieve, and when judging, need to consider two kinds of situations：
3.1) in the distance range of potential competition businessman to inquiry businessman, if more than or equal to k businessman, its
Set of keywords of the set of keywords comprising potential competition businessman, then the potential competition businessman is not the real competing of inquiry businessman
Strive businessman；
3.2) in the distance range of potential competition businessman to inquiry businessman, exist less than k businessman, its set of keywords
Set of keywords comprising potential competition businessman, then the potential competition businessman is the real opponent for inquiring about businessman.
The optimal alternative address of inquiry businessman is found in step (4) using the result in step (3), is standby according to each
Real opponent's quantity that selection of land location has come what is realized, the alternative address of the real opponent's minimum number having
It is the optimal alternative address for inquiring about businessman, is specifically calculated by real opponent's computing engines in Fig. 2 and tried to achieve.
Content described in this specification embodiment is only enumerating to the way of realization of inventive concept, protection of the invention
Scope is not construed as being only limitted to the concrete form that embodiment is stated, protection scope of the present invention is also and in art technology
Personnel according to present inventive concept it is conceivable that equivalent technologies mean.
Claims (1)
1. a kind of the best site selection method based on the inquiry of road network anti-spatial key：It is characterized in that the step of the method is as follows：
Step (1)：Existing Business Information is collected, index is set up to it, collect the inquiry alternative address information of businessman and text message；
Step (2)：For each alternative address of inquiry businessman, by class Di Jiesite pulling methods, and all of businessman is utilized
Text message, find has the businessman of potential competition relation with inquiry businessman；
Step (3)：The potential competition businessman of each the alternative address of inquiry businessman using judgment rule to being obtained in step (2)
Verified；
Step (4)：The optimal alternative address of inquiry businessman is found using the result in step (3)；
The information of each businessman includes address information and text message in described step (1), and wherein address information is to pass through
One geographical coordinate represents that text message is made up of one or more groups of keywords；All Business Information are by based on connection
The index model for clustering sets up index to it, and index file contains all of seller addresses information and text message, wherein
Address information is stored in connection list file, and text message deposits in data dot file；The all information for inquiring about businessman are all stored in
Text；
For each alternative address of inquiry businessman in described step (2), by class Di Jiesite pulling methods, and inquire about all
Businessman text message, find has the businessman of potential competition relation with inquiry businessman, be by judge keyword inclusive with
And road network distance realization, the set of data points being calculated may namely constitute the businessman of competitive relation to inquiry businessman；
, it is necessary to safeguard a storage road-net node and node to the Priority Queues of inquiry seller addresses distance during calculating,
In the head of the queue always nearest road-net node of current distance query point of the Priority Queues；Road network is extended by Di Jiesite pulling methods
During to obtain data point, in addition it is also necessary to which the counting tree safeguarded corresponding to current road-net node is used to preserve keyword count letter
Breath；Counting tree is by 2n- 1 node is constituted, and each node is respectively c comprising three count values1, c2And c3, wherein c1Expression is looked into
Ask the data point number that node is equal to current keyword to keyword in current road-net node, c2Represent query node to current road
Data point number of the keyword comprising current keyword, c in net node3Represent query node to adjacent side in current road-net node
Data point number of the upper keyword comprising current keyword；If the c of all boundary node counting trees1Or c2Numerical value all reached to
Fixed k values, then Network extension terminates, because can not possibly there is potential opponent in the road network region of extension；Wherein, sentencing
During whether disconnected data point is potential competition businessman, point three kinds of situations consider：
2.1) set of keywords of the data point is queried the set of keywords of businessman and all includes, and is worked as according to it under this situation
The numerical value of correspondence keyword is divided into two kinds of situations and makes different disposal respectively in the counting tree of preceding road-net node：
A) count value of the counting tree of the current road-net node corresponding to the data point set of keywords is less than given k values, then
Current data point is merged the counting tree correspondence numerical value for updating current road-net node added to Candidate Set；
B) count value of the counting tree of the current road-net node corresponding to the data point set of keywords is more than or equal to given k
Value, updates the counting tree correspondence numerical value of current road-net node；
2.2) set of keywords of the data point is queried the set of keywords part of businessman and includes, and needs to update under this situation
The counting tree correspondence numerical value of current road-net node, not by data point addition candidate collection；
2.3) set of keywords of the data point is not queried the set of keywords of businessman and includes completely, need not under this situation
Any treatment is done to data point and counting tree；
Each of judgment rule to being obtained in step (2) is utilized to inquire about the potential of the alternative address of businessman in described step (3)
Opponent is verified, is by verifying whether the k of the potential competition businessman nearest businessman comprising its set of keywords wraps
Realized containing businessman is inquired about；For each potential competition businessman to be verified, first have to position this in the index potential competing
Geographical position and the set of keywords of businessman are striven, it is crucial further according in the distance range of potential competition businessman to inquiry businessman
All businessman's quantity of set of keywords of the word set comprising potential competition businessman judge；When judging, two kinds of feelings need to be considered
Condition：
3.1) in the distance range of potential competition businessman to inquiry businessman, if more than or equal to k businessman, it is crucial
Set of keywords of the word set comprising potential competition businessman, then the potential competition businessman is not the real competition business for inquiring about businessman
Family；
3.2) in the distance range of potential competition businessman to inquiry businessman, exist less than k businessman, its set of keywords is included
The set of keywords of potential competition businessman, then the potential competition businessman is the real opponent for inquiring about businessman；
The result in the utilization step (3) in step (4) finds the optimal alternative address of inquiry businessman, is according to each
, come what is realized, the real opponent's minimum number having is alternatively for real opponent's quantity that alternative address has
Location is the optimal alternative address for inquiring about businessman.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410568900.6A CN104346444B (en) | 2014-10-23 | 2014-10-23 | A kind of the best site selection method based on the anti-spatial key inquiry of road network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410568900.6A CN104346444B (en) | 2014-10-23 | 2014-10-23 | A kind of the best site selection method based on the anti-spatial key inquiry of road network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104346444A CN104346444A (en) | 2015-02-11 |
| CN104346444B true CN104346444B (en) | 2017-07-07 |
Family
ID=52502035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410568900.6A Active CN104346444B (en) | 2014-10-23 | 2014-10-23 | A kind of the best site selection method based on the anti-spatial key inquiry of road network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104346444B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105404675A (en) * | 2015-11-20 | 2016-03-16 | 苏州大学 | Ranked reverse nearest neighbor space keyword query method and apparatus |
| CN105868336B (en) * | 2016-03-28 | 2019-11-29 | 哈尔滨工程大学 | Spatial key word querying method in road network towards set |
| CN107391636B (en) * | 2017-07-10 | 2020-06-09 | 江苏省现代企业信息化应用支撑软件工程技术研发中心 | Top-m reverse nearest neighbor space keyword query method |
| CN108549690B (en) * | 2018-04-12 | 2021-07-13 | 石家庄铁道大学 | Spatial keyword query method and system based on spatial distance constraint |
| CN108733803B (en) * | 2018-05-18 | 2022-04-29 | 电子科技大学 | Multi-user space keyword query method under road network |
| CN112308597B (en) * | 2020-08-14 | 2023-07-18 | 西安工程大学 | Method for selecting facility address according to influence of sports user in competition environment |
| CN112883272B (en) * | 2021-03-16 | 2022-04-29 | 山东大学 | Method for determining recommended object |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103020319A (en) * | 2013-01-11 | 2013-04-03 | 江苏大学 | Real-time mobile space keyword approximate Top-k query method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140181083A1 (en) * | 2012-12-21 | 2014-06-26 | Motorola Solutions, Inc. | Method and apparatus for multi-dimensional graphical representation of search queries and results |
-
2014
- 2014-10-23 CN CN201410568900.6A patent/CN104346444B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103020319A (en) * | 2013-01-11 | 2013-04-03 | 江苏大学 | Real-time mobile space keyword approximate Top-k query method |
Non-Patent Citations (1)
| Title |
|---|
| 路网移动对象空间关键字连续Top-k查询;李艳红等;《华中科技大学学报(自然科学版)》;20140630;第42卷(第6期);第127-132页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104346444A (en) | 2015-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104346444B (en) | A kind of the best site selection method based on the anti-spatial key inquiry of road network | |
| Rocha-Junior et al. | Top-k spatial keyword queries on road networks | |
| CN107145526B (en) | Reverse-nearest neighbor query processing method for geographic social keywords under road network | |
| Zheng et al. | Approximate keyword search in semantic trajectory database | |
| CN106874422B (en) | A kind of figure querying method of facing relation type database | |
| CN102662974B (en) | A network graph index method based on adjacent node trees | |
| CN104376112B (en) | A kind of method of road cyberspace key search | |
| CN109977309B (en) | Combined interest point query method based on multiple keywords and user preferences | |
| CN109189959A (en) | A kind of method and device constructing image data base | |
| CN107167136A (en) | Recommend method and system in a kind of position towards electronic map | |
| CN106599040A (en) | Layered indexing method and search method for cloud storage | |
| CN106777163A (en) | IP address institute possession querying method and system based on RBTree | |
| CN104391908B (en) | Multiple key indexing means based on local sensitivity Hash on a kind of figure | |
| CN106897374A (en) | A kind of personalized recommendation method based on track big data K-NN search | |
| CN107506490A (en) | Preferential search algorithm and system based on position top k keyword queries under sliding window | |
| CN107291895A (en) | A kind of quick stratification document searching method | |
| CN107633068A (en) | Fast indexing method and system based on position top k keyword queries under sliding window | |
| CN104408128B (en) | A kind of reading optimization method indexed based on B+ trees asynchronous refresh | |
| CN104008205A (en) | Content routing inquiry method and system | |
| CN104679904A (en) | Position point query method and device for road network | |
| CN112765288A (en) | Knowledge graph construction method and system and information query method and system | |
| Xu et al. | Density-based probabilistic clustering of uncertain data | |
| CN113407669B (en) | Semantic track query method based on activity influence | |
| CN106709011B (en) | A kind of position concept level resolution calculation method based on space orientation cluster | |
| CN110263108A (en) | A kind of keyword Skyline fuzzy query method and system based on road network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |