|
dynamic graphics, limits and global index
Thanks Marc. Currently triplestore/LPG is on hold awaiting streaming incidental edge queries in order to play some more. Hoping we will see a day when LPG/3store harmonize.
Thanks Marc. Currently triplestore/LPG is on hold awaiting streaming incidental edge queries in order to play some more. Hoping we will see a day when LPG/3store harmonize.
|
By
Matthew Nguyen
· #6401
·
|
|
dynamic graphics, limits and global index
Hi Marc, I follow what you're saying but will point out it doesn't have to play out to exabytes. Reason is that IDs are non recyclable and there are losses due to bulk load reservations and deletions.
Hi Marc, I follow what you're saying but will point out it doesn't have to play out to exabytes. Reason is that IDs are non recyclable and there are losses due to bulk load reservations and deletions.
|
By
Matthew Nguyen
· #6395
·
|
|
dynamic graphics, limits and global index
Hi Marc, just to be clear. If I create Graph A and build an index on Vertex P via something like: JanusGraphManagement mgmt = graph.openManagement(); PropertyKey propP = mgmt.getPropertyKey("propertyP
Hi Marc, just to be clear. If I create Graph A and build an index on Vertex P via something like: JanusGraphManagement mgmt = graph.openManagement(); PropertyKey propP = mgmt.getPropertyKey("propertyP
|
By
Matthew Nguyen
· #6383
·
|
|
hasNext() slow for large number of incoming edges
Hi Boxuan, Happy to put in a request on github but still a little confused. Are we saying g.E().has('index_key', 'large_number_of_edges').hasNext() isn't streaming but should (note: g.E().hasNext() is
Hi Boxuan, Happy to put in a request on github but still a little confused. Are we saying g.E().has('index_key', 'large_number_of_edges').hasNext() isn't streaming but should (note: g.E().hasNext() is
|
By
Matthew Nguyen
· #6379
·
|
|
hasNext() slow for large number of incoming edges
Hi Boxuan, thanks for the response. Some background: I'm trying to use JG as a triplestore and importing rdf. The triple <microsoft> <rdfs:type> <company> can be modelled as V('microsoft') -> E('rdfs:
Hi Boxuan, thanks for the response. Some background: I'm trying to use JG as a triplestore and importing rdf. The triple <microsoft> <rdfs:type> <company> can be modelled as V('microsoft') -> E('rdfs:
|
By
Matthew Nguyen
· #6373
·
|
|
dynamic graphics, limits and global index
Hi, if we're creating graphs dynamically in JG are the limits like 2^60 edges and Global V and E indexes bound/scoped to the graph or bound across all graphs in the set of graphs managed by Configurat
Hi, if we're creating graphs dynamically in JG are the limits like 2^60 edges and Global V and E indexes bound/scoped to the graph or bound across all graphs in the set of graphs managed by Configurat
|
By
Matthew Nguyen
· #6371
·
|
|
hasNext() slow for large number of incoming edges
Hi, I do need to traverse it but was hoping it would get chunked/streamed in. Or is there a better way for streaming/lazy loads?
Hi, I do need to traverse it but was hoping it would get chunked/streamed in. Or is there a better way for streaming/lazy loads?
|
By
Matthew Nguyen
· #6370
·
|
|
hasNext() slow for large number of incoming edges
Hey folks, I have a Vertex v who has about 7m+ incoming edges e. The following query takes about 30+ seconds on a local installation of cassandra. g.V(n).inE(e).hasNext() whereas g.V(n).inE(e).tryNext
Hey folks, I have a Vertex v who has about 7m+ incoming edges e. The following query takes about 30+ seconds on a local installation of cassandra. g.V(n).inE(e).hasNext() whereas g.V(n).inE(e).tryNext
|
By
Matthew Nguyen
· #6368
·
|
|
Indexing Strategies for RDF edges/predicates on Janusgraph
Thanks for the clarification. That makes sense. I suppose if there were multiple edges from V(h) to V('mother') I would need to qualify it to insure the path exists? eg V(h).out('mother').inE('isSon')
Thanks for the clarification. That makes sense. I suppose if there were multiple edges from V(h) to V('mother') I would need to qualify it to insure the path exists? eg V(h).out('mother').inE('isSon')
|
By
Matthew Nguyen
· #6361
·
|
|
Indexing Strategies for RDF edges/predicates on Janusgraph
Hi Amiya, I saw that but wasn't quite sure the intent given the example. It talks about edge labels but the examples are vertices & values? g.V(h).out('mother') -> returns a vertex traversal? g.V(h).v
Hi Amiya, I saw that but wasn't quite sure the intent given the example. It talks about edge labels but the examples are vertices & values? g.V(h).out('mother') -> returns a vertex traversal? g.V(h).v
|
By
Matthew Nguyen
· #6359
·
|
|
Indexing Strategies for RDF edges/predicates on Janusgraph
Hi, I am trying to build a triplestore ontop of JG. The general model is: Vertex (subject or object) Properties: Label Value (IRI, Literal) - indexed Edge (predicate) Properties: Label (predicate) has
Hi, I am trying to build a triplestore ontop of JG. The general model is: Vertex (subject or object) Properties: Label Value (IRI, Literal) - indexed Edge (predicate) Properties: Label (predicate) has
|
By
Matthew Nguyen
· #6356
·
|
|
JG as a 3store, rdf support
Thanks Marc, hadn't seen ERGS but looks interesting and will take a look.
Thanks Marc, hadn't seen ERGS but looks interesting and will take a look.
|
By
Matthew Nguyen
· #6289
·
|
|
JG as a 3store, rdf support
Hey folks, been playing with JG the last couple weeks and am able to import a few million triples using rdf2g (cassandra/solr backend). I'm processing around 1000 triples/sec currently after turning o
Hey folks, been playing with JG the last couple weeks and am able to import a few million triples using rdf2g (cassandra/solr backend). I'm processing around 1000 triples/sec currently after turning o
|
By
Matthew Nguyen
· #6281
·
|