Five novel features,
one unified system
Each feature was designed to solve a specific GraphRAG challenge β from query routing to cost optimization.
Adaptive Query Router
NovelAnalyzes query complexity in real-time and routes simple questions to fast baseline RAG while directing multi-hop questions through the knowledge graph.
Schema-Bounded Extraction
NovelConstrains entity extraction to TigerGraph's schema, eliminating hallucinated node types and ensuring every extracted entity maps to a valid graph vertex.
Dual-Level Keywords
NovelExtracts both high-level concepts and low-level entities from queries, enabling graph traversal at multiple granularity levels for richer context.
Graph Reasoning Paths
NovelTraces explicit entityβrelationβentity chains through TigerGraph, providing human-readable evidence paths that make LLM answers verifiable.
Real-Time Cost Tracking
NovelMeasures tokens, latency, and USD cost per query for both pipelines simultaneously, with interactive projections at scale.
12 LLM Providers
UniversalUniversal LLM layer supporting Claude, GPT-4, Gemini, Llama, Mistral, DeepSeek, Grok, Cohere, and more β swap providers with one parameter.
From query to answer
in four steps
Everything in one place
Six dedicated pages for every aspect of GraphRAG β from live comparisons to deep graph exploration.
Live Playground
Ask any science question and watch all 3 pipelines run simultaneously β LLM-Only, Basic RAG, and GraphRAG. Real-time tokens, cost, and accuracy.
Benchmarks
Run Wikipedia science benchmarks with F1, LLM-Judge, BERTScore, and radar charts.
Graph Explorer
Interactive knowledge graph visualization with entity inspection.
Architecture Deep-Dive
Explore the 4-layer AI Factory model, GSQL queries, and how TigerGraph integrates with the LLM pipeline.
Why graphs change the game
βGraphRAG reduces token usage by routing simple queries to baseline while giving complex multi-hop questions the structured reasoning they need.β
βSchema-bounded extraction ensures every entity maps to a valid TigerGraph vertex β no hallucinated node types, no broken traversals.β
βThe reasoning path visualization shows exactly which graph edges were traversed, making every LLM answer traceable and verifiable.β