Скачать или смотреть Finding the Right gremlin Query: Ensuring Both Directions in TinkerPop

Discover how to ensure you find vertices with definite *incoming and outgoing edges* in Gremlin TinkerPop. Learn the right query to achieve this.
---
This video is based on the question https://stackoverflow.com/q/72105035/ asked by the user 'user3713080' ( https://stackoverflow.com/u/3713080/ ) and on the answer https://stackoverflow.com/a/72105528/ provided by the user 'Kelvin Lawrence' ( https://stackoverflow.com/u/5442034/ ) at 'Stack Overflow' website. Thanks to these great users and Stackexchange community for their contributions.

Visit these links for original content and any more details, such as alternate solutions, latest updates/developments on topic, comments, revision history etc. For example, the original title of the Question was: Is there a version of gremlin "bothE" that isn't actually "eitherE"?

Also, Content (except music) licensed under CC BY-SA https://meta.stackexchange.com/help/l...
The original Question post is licensed under the 'CC BY-SA 4.0' ( https://creativecommons.org/licenses/... ) license, and the original Answer post is licensed under the 'CC BY-SA 4.0' ( https://creativecommons.org/licenses/... ) license.

If anything seems off to you, please feel free to write me at vlogize [AT] gmail [DOT] com.
---
Finding the Right Gremlin Query: Ensuring Both Directions in TinkerPop

When working with graph databases using Gremlin TinkerPop, developers often encounter challenges when attempting to query vertices and their relationships effectively. One common issue is ensuring that a vertex not only has an edge to a specific node but also an edge back to it. This is especially crucial in scenarios where bidirectional relationships are necessary for analysis or data integrity.

In this guide, we'll explore a specific problem: how to find all vertices that connect to a particular vertex with both incoming and outgoing edges, ensuring that the initial starting vertex isn't returned in the results.

The Problem

The user posed a question regarding the behavior of the bothE() function in Gremlin, indicating that it seems to imply either an incoming or outgoing connection rather than strictly requiring both connections between two vertices. As a result, they sought a way to find a vertex that exhibits a distinct bidirectional relationship with another vertex.

Example Scenario

Consider a graph structure representing people and their friendships. If Person A is friends with Person B and vice versa, the goal is to find both individuals as they are connected in both directions. In this case, simply using bothE() could return all vertices connected to Person A, not ensuring that Person B is connected back.

The Solution

To achieve the desired query result of finding vertices with established incoming and outgoing edges, you can utilize the following Gremlin query:

[[See Video to Reveal this Text or Code Snippet]]

Breakdown of the Query

g.V(id): This part flags the starting vertex using its unique ID.

as('a'): This saves the starting vertex with an alias a, allowing you to refer to it later.

out(): This traverses outward from the starting vertex. It represents finding all vertices that are directly connected via outgoing edges.

where(out().as('a')): This filters the results to return only those vertices that also have an outgoing edge back to the starting vertex.

This query ensures that you gather all vertices connected to your initial vertex and also filters them based on those that have a reciprocal edge, effectively ensuring a two-way connection.

Additional Notes

Avoiding the Starting Vertex: By not including g.V(id) in your final results, you're also preventing the starting vertex from appearing in your output. This is particularly valuable for cases where you require only related vertices, not the origin.

Efficient Querying: Although graph traversals can become complex, employing clear structures within your Gremlin queries will streamline the process, reduce errors, and increase clarity.

Conclusion

In conclusion, while the typical bothE() function might suggest an either-or relationship, utilizing a defined approach with out() and where(out().as('a')) gives you the precision needed to work with bidirectional graphs effectively. Whether you're using Azure CosmosDB with Gremlin API or any other TinkerPop-compatible database, this solution will help you navigate your graph data efficiently and accurately.

Feel free to reach out if you have further questions or need clarifications regarding your Gremlin queries!