Skip to content
This repository has been archived by the owner on Nov 15, 2019. It is now read-only.

graph storage format #215

Open
jovo opened this issue Feb 5, 2016 · 6 comments
Open

graph storage format #215

jovo opened this issue Feb 5, 2016 · 6 comments
Assignees
Milestone

Comments

@jovo
Copy link
Member

jovo commented Feb 5, 2016

i believe we decided on the new graph storage format was a pair of files

  1. edge list
  2. json file, with some spec that disa/will would decide upon and then sign off on?

@icoming @disa-mhembere @WillGray @gkiar

@wrgr
Copy link
Collaborator

wrgr commented Feb 5, 2016

Thank you for the reminder. @disa-mhembere - do you want to have a quick call? Or chat on Monday? @gkiar - arguably this solves our current ndmg issue?

Do we have a spec for an attributed edge list somewhere? I like roughly speaking:
(n+1)x(m+2) csv file, where n are the number of edges and m are the attributes (optional). The header row and vertices result in the final (n+1)(m+2) size.

I think Disa has a format already implemented that converts nicely to/from graphml and other formats.

For JSON spec, would be nice to have node ids, node names, edge ids, edge names, and meta data about the graph, to start.

Row 1 -> header
Row 2:n -> vertex1, vertex2, attribute1, atribute2, atribute3,...

@wrgr wrgr closed this as completed Feb 5, 2016
@wrgr wrgr reopened this Feb 5, 2016
@disa-mhembere
Copy link
Collaborator

This is almost what I had in mind. I think we should chat on monday after
the meeting. Sound ok?

On Fri, Feb 5, 2016 at 3:52 PM, William Gray notifications@github.com
wrote:

Thank you for the reminder. @disa-mhembere
https://github.com/disa-mhembere - do you want to have a quick call? Or
chat on Monday? @gkiar https://github.com/gkiar - arguably this solves
our current ndmg issue?

Do we have a spec for an attributed edge list somewhere? I like roughly
speaking:
(n+1)x(m+2) csv file, where n are the number of edges and m are the
attributes (optional). The header row and vertices result in the final
(n+1)(m+2) size.

I think Disa has a format already implemented that converts nicely to/from
graphml and other formats.

For JSON spec, would be nice to have node ids, node names, edge ids, edge
names, and meta data about the graph, to start.

Row 1 -> header
Row 2:n -> vertex1, vertex2, attribute1, atribute2, atribute3,...


Reply to this email directly or view it on GitHub
neurodata/m2g#215 (comment).

@jovo
Copy link
Member Author

jovo commented Feb 7, 2016

yup

@jovo jovo added this to the 2016_02_15 milestone Feb 7, 2016
@gkiar
Copy link
Collaborator

gkiar commented Feb 10, 2016

cross referenced in ndmg

@jovo
Copy link
Member Author

jovo commented Mar 23, 2016

i believe this is finalized.
are we doing it now?
can i see an example?

for the DARPA talk on 4/4, would i be able to see some benchmarks for this?
eg, speed reading/writing, compression reading/writing?
or is that not interesting?

@disa-mhembere
Copy link
Collaborator

No unfortunately, I have not had time to complete all the interfaces to make this happen. I have parallel ingests working, but nothing is tested on the live services. This will be completed only after supercomputing

@jovo jovo modified the milestones: 2016_04_11, 2016_02_15 Mar 23, 2016
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants