作者: Marc Patoureaux , Gilles Chaumont , Cedric Dourthe , Thierry Dufresne , Thierry Blaszka
DOI:
关键词: Geography 、 Database transaction 、 Transport engineering 、 Destinations 、 Graph 、 Graph Edge
摘要: A method of building actual travel fares in a computer, from fare databases, is disclosed. graph nodes representing destinations built which comprises edges connecting pairs nodes. Each edge references lowest fare. Also, tree for each edge. Trees comprise at least root node holding the corresponding They possibly include more comprising context key and an associated are organized to have children equal or larger than parent node. Thus, less expensive paths can efficiently be extracted since edges, included paths, reference trees gone through ascending order their values. learning entity used build update fares. It gathers its data processes aimed solutions end-users. system implementing extracting according invention made capable handling many elapsed time computer transaction thus, propose thematic options end-users who not required choose particular destination start planning trip.