Styjun

Should these notes be played as a chord or one after another?

Two researchers want to work on the same extension to my paper. Who to help?

Light Switch Terminals

Is the schwa sound consistent?

What's the difference between a Bunsen burner and a gas stove?

What does the expression "right on the tip of my tongue" mean?

How to slow yourself down (for playing nice with others)

Usefulness of complex chord names?

Extrude the faces of a cube symmetrically along XYZ

What is the significance of 4200 BCE in context of farming replacing foraging in Europe?

Plastic-on-plastic lubricant that wont leave a residue?

Why was the Ancient One so hesitant to teach Dr. Strange the art of sorcery?

Does Nightwing have a utility belt?

How can dragons propel their breath attacks to a long distance

What food production methods would allow a metropolis like New York to become self sufficient

Make all the squares explode

Can the sorting of a list be verified without comparing neighbors?

How to get reference to Component from inside an event method

How to cope with regret and shame about not fully utilizing opportunities during PhD?

Was this character’s old age look CGI or make-up?

Can I use my laptop, which says 100-240V, in the USA?

How does Howard Stark know this?

tikz: not so precise graphic

How to minimise the cost of guessing a number in a high/low guess game?

ArangoDB AQL - Can I traverse multiple graphs in one query?

How to optimize graph traversals in ArangoDB?ArangoDB: is it possible to 'fake' edges in a graph traversal?arangodb aql effectively tarversing from startvertex through the endvertex and find connection between themArangoDB anonymous graph traversalarangodb select all where timestamp to build relation graphArangodb AQL queryArangoDB pedigree graph traversalEfficient path traversal using AQL on a large bipartite graph in ArangoDBConcise way to filter on two child attributes in ArangoDB (AQL / Spring Data ArangoDB)Combining new ArangoSearch views and graph traversals

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty height:90px;width:728px;box-sizing:border-box;

1

I would like to store data that is not directly related into seperate named graphs in ArangoDB. However, there might be cases where I would want to query data from more than one of these graphs at a time.

I know that you can perform a graph traversal as below, particularly using the 'GRAPH' keyword, but is it possible to do something like 'GRAPH graphName1, graphName2' to query both at the same time?

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 GRAPH graphName
 [OPTIONS options]

I know I could "union" the results of multiple of the above graph traversals, but given that only the graphName would be different, it would be great if I could make it concise instead of repeating redundant code.

arangodb aql

share|improve this question

edited Mar 23 at 14:01

Ponsietta

asked Mar 23 at 11:55

PonsiettaPonsietta

61211

add a comment | 

1

I would like to store data that is not directly related into seperate named graphs in ArangoDB. However, there might be cases where I would want to query data from more than one of these graphs at a time.

I know that you can perform a graph traversal as below, particularly using the 'GRAPH' keyword, but is it possible to do something like 'GRAPH graphName1, graphName2' to query both at the same time?

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 GRAPH graphName
 [OPTIONS options]

I know I could "union" the results of multiple of the above graph traversals, but given that only the graphName would be different, it would be great if I could make it concise instead of repeating redundant code.

arangodb aql

share|improve this question

edited Mar 23 at 14:01

Ponsietta

asked Mar 23 at 11:55

PonsiettaPonsietta

61211

add a comment | 

I would like to store data that is not directly related into seperate named graphs in ArangoDB. However, there might be cases where I would want to query data from more than one of these graphs at a time.

I know that you can perform a graph traversal as below, particularly using the 'GRAPH' keyword, but is it possible to do something like 'GRAPH graphName1, graphName2' to query both at the same time?

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 GRAPH graphName
 [OPTIONS options]

I know I could "union" the results of multiple of the above graph traversals, but given that only the graphName would be different, it would be great if I could make it concise instead of repeating redundant code.

arangodb aql

share|improve this question

edited Mar 23 at 14:01

Ponsietta

asked Mar 23 at 11:55

PonsiettaPonsietta

61211

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 GRAPH graphName
 [OPTIONS options]

share|improve this question

edited Mar 23 at 14:01

Ponsietta

asked Mar 23 at 11:55

PonsiettaPonsietta

61211

share|improve this question

edited Mar 23 at 14:01

Ponsietta

asked Mar 23 at 11:55

PonsiettaPonsietta

61211

asked Mar 23 at 11:55

PonsiettaPonsietta

61211

asked Mar 23 at 11:55

PonsiettaPonsietta

61211

1 Answer
1

active

oldest

votes

1

You cannot traverse multiple named graphs in a traversal. Instead you can either:

Create anew named graph with all the necessary vertex and edges

Or (better)

Traverse the collections directly without using named graphs. The performance is the same. Here is the syntax:

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 edgeCollection1, ..., edgeCollectionN
 [PRUNE pruneCondition]
 [OPTIONS options]

share|improve this answer

answered Mar 24 at 4:53

camba1camba1

431211

• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  Relevant documentation regarding anonymous graphs / working with collection sets: docs.arangodb.com/3.4/Manual/Graphs/#anonymous-graphs and docs.arangodb.com/3.4/AQL/Graphs/…
  
  – CoDEmanX
  Mar 25 at 10:33
  

  
  
  
  

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55313471%2farangodb-aql-can-i-traverse-multiple-graphs-in-one-query%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

1

You cannot traverse multiple named graphs in a traversal. Instead you can either:

Create anew named graph with all the necessary vertex and edges

Or (better)

Traverse the collections directly without using named graphs. The performance is the same. Here is the syntax:

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 edgeCollection1, ..., edgeCollectionN
 [PRUNE pruneCondition]
 [OPTIONS options]

share|improve this answer

answered Mar 24 at 4:53

camba1camba1

431211

• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  Relevant documentation regarding anonymous graphs / working with collection sets: docs.arangodb.com/3.4/Manual/Graphs/#anonymous-graphs and docs.arangodb.com/3.4/AQL/Graphs/…
  
  – CoDEmanX
  Mar 25 at 10:33
  

  
  
  
  

add a comment | 

1

You cannot traverse multiple named graphs in a traversal. Instead you can either:

Create anew named graph with all the necessary vertex and edges

Or (better)

Traverse the collections directly without using named graphs. The performance is the same. Here is the syntax:

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 edgeCollection1, ..., edgeCollectionN
 [PRUNE pruneCondition]
 [OPTIONS options]

share|improve this answer

answered Mar 24 at 4:53

camba1camba1

431211

• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  Relevant documentation regarding anonymous graphs / working with collection sets: docs.arangodb.com/3.4/Manual/Graphs/#anonymous-graphs and docs.arangodb.com/3.4/AQL/Graphs/…
  
  – CoDEmanX
  Mar 25 at 10:33
  

  
  
  
  

add a comment | 

You cannot traverse multiple named graphs in a traversal. Instead you can either:

Create anew named graph with all the necessary vertex and edges

Or (better)

Traverse the collections directly without using named graphs. The performance is the same. Here is the syntax:

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 edgeCollection1, ..., edgeCollectionN
 [PRUNE pruneCondition]
 [OPTIONS options]

share|improve this answer

answered Mar 24 at 4:53

camba1camba1

431211

FOR vertex[, edge[, path]]
 IN [min[..max]]
 OUTBOUND|INBOUND|ANY startVertex
 edgeCollection1, ..., edgeCollectionN
 [PRUNE pruneCondition]
 [OPTIONS options]

share|improve this answer

answered Mar 24 at 4:53

camba1camba1

431211

answered Mar 24 at 4:53

camba1camba1

431211

answered Mar 24 at 4:53

camba1camba1

431211