What is a personal knowledge graph? +
A personal knowledge graph is a structured map of your own notes, ideas, and references — and the relationships between them. Where general knowledge graphs (Google, Wikidata) catalog globally important entities, a personal knowledge graph captures the entities that matter to you: your projects, your decisions, your interview subjects, your reading. The concept was formalized in Balog and Kenter's 2019 ICTIR paper at Google. Knovya is the first note app to make it native, AI-augmented, and interactive.
How is it different from Obsidian's graph view? +
Obsidian visualizes the links you've already made by hand. Knovya does that, plus three more layers — AI-suggested edges between notes that are semantically related but not yet linked, bridge node detection that highlights notes spanning multiple clusters of your work, and cluster intelligence that auto-labels your folders. The graph isn't decoration; it surfaces structure you didn't know was there.
Can I export the graph? +
Yes. Export as JSON (full graph payload — nodes, edges, semantic edges, clusters, evolution chains), as GraphML for Gephi or Cytoscape, or as a static SVG snapshot. Your data is portable; the graph isn't a lock-in.
Does the graph work in real-time? +
Manual edges — wiki links, mention blocks — appear instantly the moment you save a note. AI-suggested edges and cluster labels recompute in the background, typically within a few minutes for a workspace of a few thousand notes. The graph you're looking at is never older than your most recent draft.
How are AI-suggested edges generated? +
Knovya computes semantic similarity between every pair of notes using embeddings, and surfaces the strongest pairs that you haven't explicitly linked. The threshold is calibrated to avoid noise — a suggested edge means the two notes really do share substantive content, not just a passing word in common. You always see the suggestion as a dashed line and can confirm it (turning it into a solid edge) or dismiss it.
Can I filter the graph by tag, folder, or status? +
Yes — by tag, folder, type (plan, decision, journal, framework, bug), status (draft, active, completed, deprecated), heat (hot/warm/cold), or NoteRank score. Filters compose: you can ask for hot active plans across the engineering folder and the graph re-renders to that subset.
What's the largest graph Knovya can render? +
The full-detail graph stays smooth up to a few thousand nodes. Beyond that, Knovya progressively switches to cluster-collapsed views — folders shown as single nodes, expandable on click — so a workspace of ten thousand notes still navigates without lag. The system tells you which view you're in; nothing is hidden.