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: | Ang, Hans Christian C. |
---|---|
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 |
Similar Items
-
Algorithms for multi-point range query and reverse nearest neighbour search
by: NG HOONG KEE
Published: (2010) -
Continuous Obstructed Nearest Neighbor Queries in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Dynamic Nearest Neighbor Queries in Euclidean Space
by: NUTANONG, Sarana, et al.
Published: (2017) -
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Efficient processing of KNN and skyjoin queries
by: HU JING
Published: (2010)