Hi, I have a route planning webapp, written in Python, that uses Djikstra's algorithm to find the shortest path between two nodes in a directed graph. I want to port this to AppEngine, but I'm not sure how to represent the graph. Right now I'm using a dict of dict, G[pt] [pt] -> (edge data) where pt1/pt2 are coordinates and edge data is just some strings. The graph is cPickled and gets loaded on app startup. It has about 25K entries and the pickle file is 3 MB. I generate it offline, and it's read-only-- basically a large constant lookup table that gets repeatedly queried when the path planner runs.
Since there are no files in AppEngine, my first thought was to create a model for the graph and then write a batch importer that puts all the nodes/edges into BigTable. But won't this end up being really slow relative to the in-memory lookups I'm doing currently? Also I'm not sure if batch importers/local large datasets are still a choke point for devs (I saw some posts saying the dev appserver chokes on large datasets, which will be doom for me as I need the whole graph to test anything.) Any suggestions appreciated. thanks Amar --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google App Engine" group. To post to this group, send email to google-appengine@googlegroups.com To unsubscribe from this group, send email to google-appengine+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/google-appengine?hl=en -~----------~----~----~----~------~----~------~--~---
