HugeGraph

G.V() is an all-in-one Gremlin IDE to write, debug, test and analyze results for your Gremlin graph database. It offers rich a UI with smart autocomplete, graph visualization, editing and connection management. G.V() automatically detects your connection setting requirements based on the hostname you provide and prompts you for the next required information for an easy onboarding experience, regardless of which Gremlin database you're using. Load, visualize and draw your graph in true “What You See Is What You Get” fashion to build, test, visualize and query your data easily. Learn Gremlin with the embedded documentation and G.V()'s in-memory graph. View your Gremlin query results in various formats allowing to test, navigate and understand your query results rapidly. Compatible with all major Apache TinkerPop enabled Graph Database Providers: Amazon Neptune, Azure Cosmos DB’s Gremlin API, DataStax Enterprise Graph, JanusGraph, ArcadeDB, Aliyun TairForGraph and Gremlin Server.

Apache TinkerPop™ is a graph computing framework for both graph databases (OLTP) and graph analytic systems (OLAP). Gremlin is the graph traversal language of Apache TinkerPop. Gremlin is a functional, data-flow language that enables users to succinctly express complex traversals on (or queries of) their application's property graph. Every Gremlin traversal is composed of a sequence of (potentially nested) steps. A graph is a structure composed of vertices and edges. Both vertices and edges can have an arbitrary number of key/value pairs called properties. Vertices denote discrete objects such as a person, a place, or an event. Edges denote relationships between vertices. For instance, a person may know another person, have been involved in an event, and/or have recently been at a particular place. If a user's domain is composed of a heterogeneous set of objects (vertices) that can be related to one another in a multitude of ways (edges).