Hi Colin Another thing to consider are the clusters. I think they are good because they avoid a lot of overhead. Following the example used in the slides, for serializing N rectangles, it writes:
- in vertexes section: 'Rectangle' 'origin' 'corner' N - in edges section: 2*N indexes (references to the origin and corner points) Without clustering, I think each rectangle stored should have some header to say that its an instance of Rectangle. Martin On Fri, Dec 10, 2010 at 11:03 AM, Tristan Bourgois <tristan.bourg...@gmail.com> wrote: > >> Hi Martin, >> >> Looks very interesting. Reading the material you posted, the question >> that jumps out at me is this: from the benchmarks, it's clear that >> materializing is faster than serializing, but it's not clear why. How >> does separating the nodes from the edges of the object graph make >> materializing faster? >> >> Thanks, >> >> Colin > > Hi! > > Separate the nodes from the edges of the object permit during the > serialization > to pass only one time on the byte code. > So first we pass on the node so we recreate the objects/nodes and second > when > we pass on the edges we recreate the links between the objects. > > I hope I answered your question :) > > Tristan >
