A preprocessing approach by elimination technique to solve optimal paths for trip planning queries
The research proposed an approach in solving best trip for Trip Planning Query (TPQ) in Spatial Databases. The proposed approach is composed of two phases. The first is the pre-processing phase that accepts a road network and precomputes for shortest path between locations in a given map. The shorte...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2008
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/6655 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/12749/viewcontent/CDTG004211_P.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | The research proposed an approach in solving best trip for Trip Planning Query (TPQ) in Spatial Databases. The proposed approach is composed of two phases. The first is the pre-processing phase that accepts a road network and precomputes for shortest path between locations in a given map. The shortest path algorithm is applied during this phase which eventually generates a modified road network.. The second phase uses two sets of road network as input, the original and the modified one. The original road network is used for user query in selecting the location of interest, while the modified road network is used to solve for TPQ best trips. The second phase or the trip planning querying (TPQing) phase applies existing TPQ approximation methods such as Nearest Neighbor and Minimum Distance, to solve for the best trip in a given road network. This research contributes to the new type of spatial query and trip planning query in spatial databases. |
|---|