Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Road network Top-k path query method based on multi-keyword coverage

A multi-keyword, query method technology, used in text database query, structured data retrieval, prediction and other directions

Active Publication Date: 2021-10-01
SHENYANG AEROSPACE UNIVERSITY
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] In order to solve the multi-path planning query problem that satisfies the user's multi-keyword access request in the undirected road network, the present invention proposes a road network Top-k path query method based on multi-keyword coverage;

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Road network Top-k path query method based on multi-keyword coverage
  • Road network Top-k path query method based on multi-keyword coverage
  • Road network Top-k path query method based on multi-keyword coverage

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] In order to make the object, technical solution and advantages of the present invention more clear, the present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only for explaining the present invention, not limiting the present invention.

[0015] The key to the routing lookup problem is to find the Top-k shortest paths from the starting location to the destination, or find the most suitable path according to some criteria. One of the hot topics is path planning for Points of Interests (POIs), which is to plan a route that can cover all query keywords given a starting point and destination, and a set of keywords that need to be satisfied. Minimize the total distance cost. In previous related studies, it was considered that POI only contains one keyword; however, in real life, a POI may provide multiple keywords to indicate that it ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a road network Top-k path query method based on multi-keyword coverage, and the method comprises the following steps: extracting a POI subgraph from a space road network, establishing a shortest path H2H index, and establishing a shortest path tree with query keyword binary information by taking a query target point as a root node. According to the method, a path deviation algorithm is adopted, heuristic detour lower bound expansion is utilized, continuous deviation is carried out with the shortest path as the benchmark to find out the locally optimal POI, the minimum detour distance of each remaining unsatisfied keyword is solved, and the maximum candidate value of each keyword is selected as the minimum detour lower bound; meanwhile, a pruning strategy is utilized in the deviation process, the paths are continuously corrected, and when Top-k paths meeting the keyword set specified by the user are found, query is ended.

Description

technical field [0001] The invention belongs to the technical field of k-nearest neighbor query processing under multi-mode traffic, and in particular relates to a Top-k path query method covered by multiple keywords in a road network, a hierarchical label index (Hierarchical 2-Hop, H2H), build a Partial Shortest Path Tree with Binary Keywords, SPT b ), and use the path deviation technology and the method of the heuristic minimum detour distance lower bound to realize the Top-k path query method covered by multiple keywords in the road network. Background technique [0002] With the development of society and the advancement of technology, the Global Positioning System (GPS) has become more and more popular. Benefiting from the popularity and development of map services and mobile terminals, tourists not only consider the length of the route when planning travel routes As a consideration, other factors will also be taken into consideration. Among them, path length, path co...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/33G06F16/22G06Q10/04
CPCG06F16/3344G06F16/2246G06Q10/047
Inventor 李佳佳熊星李雷
Owner SHENYANG AEROSPACE UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com