]> 2012-05-27T21:34:41-04:00 Joshua Shinavier Networked Graphs Jesse Weaver Maybe I'm misunderstanding something in the paper. The last paragraph of section 6 (right before section 6.1) states: "Tabling means we save intermediary results during the iterative computation, instead of recomputing them when needed." However, section 6.2 states: "After every iteration, every QueryNode updates its table of results. Only new results are returned to other nodes." This gives me the impression that, in actuality, everything is still being "recomputed," but "only new results are returned." Therefore, this tabling does not prevent redundant work as claimed. Do I understand this correctly? Joshua Shinavier Networked Graphs Question for the Presentation Jesse Weaver Question asked by Question asked Presentation Questions