• Implemented a ‘Point Database’ to store the position of all the landmarks in the map using Range Tree data structure. • Used pre‑processing to take advantage of the frequent nature of queries and the relatively static nature of landmarks. • The program efficiently stored landmark data for fast processing of “search nearby” queries, similar to Google Maps.
-
Notifications
You must be signed in to change notification settings - Fork 0
Implemented a ‘Point Database’ to store the position of all the landmarks in the map using Range Tree data structure. The program efficiently stored landmark data for fast processing of “search nearby” queries, similar to Google Maps
kartikbansiwal/Project-Nearby-Search-Program
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented a ‘Point Database’ to store the position of all the landmarks in the map using Range Tree data structure. The program efficiently stored landmark data for fast processing of “search nearby” queries, similar to Google Maps
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published