Date of Publication

3-28-2008

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Computer Sciences

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Caslon Chua

Defense Panel Chair

Nelson Marcos

Defense Panel Member

Caslon Chua
Kai Shan Fernandez

Abstract/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.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTG004211

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

vi, 81 leaves

Keywords

Nearest neighbor analysis (Statistics); Spatial systems

Upload Full Text

wf_yes

Download

Share

COinS