Graph Data Eats Context Windows
Traditional graph formats like JSON, GraphML, and RDF are verbose and waste precious context space. When your LLM needs to reason over relationships, every token counts. ISONGraph uses a compact tabular format that LLMs naturally understand from their training data.
Everything You Need for Graph AI
From core graph operations to query language to schema validation.
Benchmark Results
ISONGraph was tested against 9 other formats across 150 questions in two benchmark suites.
Knowledge Graph Benchmark
100 Questions| Format | Tokens | Accuracy | Efficiency |
|---|---|---|---|
| ISONGraph | 1,698 | 90.0% | 53.00 |
| ISON | 1,976 | 88.0% | 44.53 |
| JSON Compact | 2,893 | 88.0% | 30.42 |
| Cypher | 3,522 | 89.0% | 25.27 |
| JSON | 5,406 | 87.0% | 16.09 |
Data Traversal Benchmark
50 Questions| Format | Tokens | Accuracy | Eff (Acc/1K) |
|---|---|---|---|
| ISONGraph | 639 | 92.0% | 143.97 |
| ISON | 685 | 88.0% | 128.47 |
| TOON | 856 | 80.0% | 93.46 |
| JSON Compact | 1,072 | 82.0% | 76.49 |
| JSON | 2,039 | 84.0% | 41.20 |
Built for AI Workflows
O(1) Lookups
Constant-time node and edge lookups using efficient hash-based indexing.
Multi-hop Traversal
Traverse N hops in any direction with optional filtering and path tracking.
Shortest Path
BFS shortest path and DFS all-paths finding between any two nodes.
Fluent Query API
Chainable traversal interface for complex graph queries.
Schema Validation
Type validators, field constraints, edge rules, and graph-level validation.
ISONQL Queries
SQL-like query language with NODES, EDGES, TRAVERSE, PATH and aggregations.
Use Your Favorite Language
Production-ready implementations with consistent APIs across all languages.
Built for AI Applications
Knowledge Graphs
Build and query knowledge bases with efficient relationship representation. Perfect for RAG pipelines and semantic search.
LLM Context
Fit 3x more graph data in LLM context windows. Better context means better reasoning and more relevant responses.
Multi-Agent Systems
Share structured knowledge between agents efficiently. Native references enable relationship-aware communication.
Social Networks
Model user relationships, follows, and interactions. Multi-hop traversal finds friends-of-friends instantly.
Recommendation Engines
Connect users to products through preferences, purchases, and similarities for personalized recommendations.
Dependency Analysis
Track code dependencies, package relationships, and build graphs. Cycle detection finds circular dependencies.