<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Graphs on KeyValueStore.com</title>
    <link>https://keyvaluestore.com/tags/graphs/</link>
    <description>Recent content in Graphs on KeyValueStore.com</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 06 Oct 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://keyvaluestore.com/tags/graphs/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Graph Key Builder Shows the Keys a Graph Takes in RocksDB, LMDB or etcd, and What Each Hop Costs</title>
      <link>https://keyvaluestore.com/graph-key-builder-shows-the-keys-a-graph-takes-in-rocksdb-lmdb-or-etcd-and-what-each-hop-costs/</link>
      <pubDate>Tue, 06 Oct 2026 00:00:00 +0000</pubDate>
      <guid>https://keyvaluestore.com/graph-key-builder-shows-the-keys-a-graph-takes-in-rocksdb-lmdb-or-etcd-and-what-each-hop-costs/</guid>
      <description>&lt;p&gt;Sometimes a few links have to sit next to your records: which service calls which, who follows whom, what an AI agent remembers about what. A graph database is one more system to run for that. If you already run an ordered key-value store, the graph can live there, as long as the keys are laid out well.&lt;/p&gt;&#xA;&lt;p&gt;The &lt;a href=&#34;https://keyvaluestore.com/tools/graph/&#34;&gt;Graph Key Builder&lt;/a&gt; shows how. Paste a list of links and you get every key the graph takes, in the order the store keeps them. Then pick a node and follow its links hop by hop, with each prefix scan listed and the keys it read counted.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
