Hi Claudio, So what you want is to be able to build up your own application-specific data structure for the outbound edges of a vertex (in your case, one that effectively supports fulltext search on the edge values)?
Check out: https://issues.apache.org/jira/browse/GIRAPH-31 - this change, if merged to trunk, would allow you to keep whatever edge datastructure you wanted, and implement your own internal structures. Try out that patch, give a comment on the JIRA if you've got any thoughts! -jake On Tue, Sep 13, 2011 at 3:09 AM, Claudio Martella < [email protected]> wrote: > Hello list, > > I'm currently implementing large scale path traversals over an RDF graph. > the traversals are defined by the starting vertex and a set of edge labels > that have to be traversed, if possible, to obtain all the wanted paths. In > my current scenario the vertexID is Text, and the Edge is <Text, Text> as > well, as the edge value is the edge label. For obvious reasons, it would be > much more efficient to be able to obtain all the edges with a matching Edge > label (value), without iterating through the whole vertex edge list looking > for them (given avg vertex degree of K i'd go from O(K) to O(logK) at > least). I thought about creating my own labelledOutEdgeMap and populate it > by overriding Vertex.addEdge(), but that's final. I thought about adding a > method but VertexReader.next() is receiving a MutableVertex. > > Do you have any suggestions? > > TIA > > -- > Claudio Martella > [email protected] >
