Thanks Jingbo. I am OK to retrieve a vertex just by ID. Can you point me if there are any sample that shows how to use various retrieval APIs? Given a vertex by it's ID in a graph of 1000s of elements, I want to address that vertex and get all the edges and vertices connected to it at various depths. Any pointers to sample code will help.
________________________________ From: Jingbo Xu <[email protected]> Sent: Wednesday, August 14, 2024 8:36 AM To: [email protected] <[email protected]> Subject: Re: Add property groups and different edge properties I try to discuss these with my own understanding: For the first question, I think it is a reasonable requirement. We may consider supporting this. :) The second question is a bit complicated: - in your example, it should be supported. Since GraphAr supports a set of retrieval APIs and even can serve as out-of-core storage. Getting vertex by its unique ID is essential. - However, you mentioned "on a certain property", I think its efficient implementation may require archive indexes (on certain properties), which lack support in the current version I am afraid. Best, Jingbo On Tue, 13 Aug 2024 at 18:33, Muniraju Pulipalyam <[email protected]> wrote: > > Hi All, > > Can I have a property group for a vertex that is of different file > formats? That is, if I have property group of id and name, can I create it > in both CSV and parquet, for example? In a graph, can different vertices be > connected with edges of different properties? > > Also, given a graph, is there a method to search for a vertex on a certain > property in the vertex property group? Say I have a 1000 vertex graph with > 20000 edges, I would like to get a vertex by it's ID through lookup and > traverse all it's edges. > > Thanks, > Muni >
