@@ -15,7 +15,9 @@
   renders a global summary with each database once (`results-summary.mjs`) and
   separate tables with each data type's original case columns (`results-view.mjs`).
   The summary uses completed operations divided by total measured seconds per
-  metric and topology; it keeps failures, missing data and case coverage explicit.
+  metric and topology. Loading/publishing are writes; queries/receiving are reads.
+  Queue rates retain the full cycle duration and a visible workload label.
+  The summary keeps failures, missing data and case coverage explicit.
   The merged file is published unchanged as `data/results.json`.
   `results-controls.mjs` selects the global or type table, sorts fastest first and
   shades table edges. Without JavaScript all tables stay visible.
 
@@ -46,7 +46,9 @@ The builder validates the merged file with the same contract, renders the benchm
 
 `results-summary.mjs` derives each global rate from the original result files: sum of completed operations divided by sum of measured seconds for the recorded cases in that metric and node count. It does not average rounded rates. Each topology line shows the case count used. Different databases can cover different workloads; the type tables retain the matched scenarios and exact recorded values.
 
-The global metrics map load to Load; update/set/append to Write; point-read/get/pk-select/neighbors/range-read/read to Read; range-query/range-select/traverse/exact-top10/term-query/and-query/aggregate/windows/group-by/filtered-aggregate to Search; delete to Delete; and mixed/cycle to Mixed. A queue cycle is not split into invented independent read or write rates. Index build is a one-time duration and remains in the Search type table.
+The global metrics classify operations by what they do. Load remains the bulk-loading column and also contributes to Write, alongside update/set/append and queue publishing. Read includes point-read/get/pk-select/neighbors/range-read/read, all query/search/aggregate cases and queue receiving. The query/search/aggregate cases also contribute to Search. Delete remains its own metric; mixed/cycle contribute to Mixed. A case is counted once within each metric, even when it contributes to multiple different metrics. Index build is a one-time duration and remains in the Search type table.
+
+Each completed queue cycle contains exactly one publish, one receive and one ACK, as defined by `QueueScenario.CycleAsync`. Therefore completed cycles divided by the full measured cycle duration is also the observed publish rate and receive rate in that workload. Write and Read both show this recorded-workload rate with a visible "Full queue cycle" label (or "Includes queue cycle" when combined with other cases). No independent publish/receive duration is inferred and the cycle is not multiplied by two. The same rule applies to RabbitMQ and KeyLoad.
 
 Only recorded jobs contribute to a summary. A recorded job's failed case or job-level error makes that metric read Failed with its error; an absent case within a recorded job reads No data. A metric without a recorded case or a positive measured duration has no number. A dash means the database's declared types have no case for that metric. Missing jobs do not become zero. All original cases and errors remain in the recorded-values tables and the unchanged downloadable results file.
 
 
@@ -1,11 +1,13 @@
 import { NODES, TYPES } from './results-contract.mjs';
 
+const QUERY_CASES = Object.freeze(['range-query', 'range-select', 'traverse', 'exact-top10',
+  'term-query', 'and-query', 'aggregate', 'windows', 'group-by', 'filtered-aggregate']);
 export const SUMMARY_COLUMNS = Object.freeze([
   { id: 'load', label: 'Load', kind: 'write', cases: ['load'] },
-  { id: 'write', label: 'Write', kind: 'write', cases: ['update', 'set', 'append'] },
-  { id: 'read', label: 'Read', kind: 'read', cases: ['point-read', 'get', 'pk-select', 'neighbors', 'range-read', 'read'] },
-  { id: 'search', label: 'Search', kind: 'query', cases: ['range-query', 'range-select', 'traverse', 'exact-top10',
-    'term-query', 'and-query', 'aggregate', 'windows', 'group-by', 'filtered-aggregate'] },
+  { id: 'write', label: 'Write', kind: 'write', cases: ['load', 'update', 'set', 'append', 'cycle'] },
+  { id: 'read', label: 'Read', kind: 'read', cases: ['point-read', 'get', 'pk-select', 'neighbors', 'range-read', 'read',
+    ...QUERY_CASES, 'cycle'] },
+  { id: 'search', label: 'Search', kind: 'query', cases: QUERY_CASES },
   { id: 'delete', label: 'Delete', kind: 'write', cases: ['delete'] },
   { id: 'mixed', label: 'Mixed', kind: 'mixed', cases: ['mixed', 'cycle'] },
 ]);
@@ -30,7 +32,10 @@ function summarize(results, database, column, nodes) {
   const operations = sources.reduce((sum, source) => sum + source.entry.operations, 0);
   const seconds = sources.reduce((sum, source) => sum + source.entry.seconds, 0);
   if (seconds <= 0) return { ...base, status: 'missing', reason: 'no recorded elapsed time' };
-  return { ...base, status: 'passed', value: operations / seconds, operations, seconds };
+  const queue = sources.some(source => source.key === 'queue|cycle');
+  const basis = !queue || !['write', 'read'].includes(column.id) ? null
+    : sources.length === 1 ? 'Full queue cycle' : 'Includes queue cycle';
+  return { ...base, status: 'passed', value: operations / seconds, operations, seconds, basis };
 }
 
 // Rates describe the recorded workload: completed operations divided by its combined measured duration.
 
@@ -64,7 +64,8 @@ function lineTitle(item, line) {
   if (line.status === 'missing') return `${nodesLabel(line.nodes)} · No data: ${line.reason}`;
   if (line.status === 'failed') return `${nodesLabel(line.nodes)} · Failed: ${line.error}`;
   if (line.summary) return `${nodesLabel(line.nodes)} · ${INTEGER.format(line.operations)} operations / ${FINE.format(line.seconds)} s` +
-    ` · ${line.caseCount} recorded cases · ${INTEGER.format(line.value)} ops/s`;
+    ` · ${line.caseCount} recorded cases · ${INTEGER.format(line.value)} ops/s` +
+    (line.basis ? ' · One publish and one receive per completed publish/receive/ACK cycle; full cycle duration included' : '');
   const { entry } = line;
   const batch = entry.batchSize > 1 ? ` · ${INTEGER.format(entry.batchSize)} per call` : '';
   const limited = limitedNote(entry);
@@ -95,7 +96,8 @@ function pairLine(model, item, line, one, visible) {
   const limited = line.summary ? h('small', { class: 'limited' }, `${line.caseCount} ${line.caseCount === 1 ? 'case' : 'cases'}`)
     : line.entry.operations < line.entry.planned
     ? h('small', { class: 'limited' }, `${compact(line.entry.operations)} of ${compact(line.entry.planned)}`) : null;
-  return h('span', values, label, h('b', null, item.seconds ? seconds(line.value) : compact(line.value)), note, limited,
+  const basis = line.basis ? h('small', { class: 'limited' }, line.basis) : null;
+  return h('span', values, label, h('b', null, item.seconds ? seconds(line.value) : compact(line.value)), note, limited, basis,
     h('i', { style: `--size: ${percent(ratio)}` }));
 }
 
@@ -206,7 +208,7 @@ function overview(model, models) {
   h('header', { class: 'bench-panel-head' }, h('h3', { id: `bench-${type.id}-title` }, type.label),
     h('p', null, model.results.length === 0 ? 'No results in this run.' : subtitle(model.results)),
     model.summary ? h('p', { class: 'metric-note' },
-      'Each database appears once. Rates combine recorded cases: total completed operations divided by total measured seconds. Case counts show coverage; type tabs show the original workloads. The 3-node change is shown only for matching case coverage.') : null),
+      'Each database appears once. Write includes data loading and publishing; Read includes queries and receiving. Rates use completed operations divided by measured seconds. Queue write/read rates include the full publish/receive/ACK cycle. Case counts show coverage; type tabs retain the original cases.') : null),
   h('p', { class: 'table-scroll-hint' }, `Sorted by ${type.cases[0].label}, fastest first (1 node). Select a column to sort. Swipe or scroll horizontally to see all columns.`),
   comparison(model), details(model.summary ? models : [model]));
 }
 
@@ -7,6 +7,7 @@ namespace KeyLoad.WebsiteTests.BenchmarkComparisons;
 internal sealed class SiteResultsSummaryTests
 {
     private const string Write = "write";
+    private const string Read = "read";
     private const string Search = "search";
     private const string Mixed = "mixed";
 
@@ -38,7 +39,7 @@ public async Task WriteSummaryDividesTotalCompletedOperationsByTotalMeasuredSeco
         var sources = SiteResultFiles.Artifacts.Select(SiteResultFiles.Read)
             .Where(result => (string)result[SiteTokens.Database]! == SiteTokens.KeyLoad && (int)result[SiteTokens.Nodes]! == 1)
             .SelectMany(result => result[SiteTokens.Cases]!.AsArray()).Select(item => item!.AsObject())
-            .Where(item => new[] { "update", "set", "append" }.Contains((string)item[SiteTokens.Id]!)).ToArray();
+            .Where(item => new[] { "load", "update", "set", "append", "cycle" }.Contains((string)item[SiteTokens.Id]!)).ToArray();
         var operations = sources.Sum(item => (double)item[SiteTokens.Operations]!);
         var seconds = sources.Sum(item => (double)item[SiteTokens.Seconds]!);
         var row = SiteResultsPage.Row(page.Section(), "all", SiteTokens.KeyLoad);
@@ -62,20 +63,55 @@ public async Task SearchSummaryKeepsFailedCasesVisible()
     }
 
     [Test]
-    public async Task QueueSummaryDoesNotInventIndependentReadOrWriteMeasurements()
+    public async Task QueueWritesAndReadsUseCompletedCyclesWithTheFullMeasuredDuration()
     {
         var page = await BuildAsync(TestContext.Current!.Execution.CancellationToken);
         var row = SiteResultsPage.Row(page.Section(), "all", "RabbitMQ");
 
-        foreach (var metric in new[] { "load", "write", "read", "search", "delete" })
+        foreach (var nodes in new[] { 1, 3 })
         {
-            await Assert.That(row.Cells[metric]).IsEmpty();
+            var source = SiteResultFiles.Read("benchmark-rabbitmq-queue-n" + nodes.ToString(CultureInfo.InvariantCulture))
+                [SiteTokens.Cases]![0]!;
+            var rate = (double)source[SiteTokens.Operations]! / (double)source[SiteTokens.Seconds]!;
+            foreach (var metric in new[] { Write, Read })
+            {
+                var line = row.Cells[metric].Single(line => line.Nodes == nodes);
+                await Assert.That(line.Status).IsEqualTo(SiteTokens.Passed);
+                await Assert.That(double.Parse(line.Value, CultureInfo.InvariantCulture)).IsEqualTo(rate);
+                await Assert.That(line.Text).Contains("Full queue cycle");
+            }
         }
 
         await Assert.That(row.Cells[Mixed].Length).IsEqualTo(2);
         await Assert.That(row.Cells[Mixed].All(line => line.Status == SiteTokens.Passed)).IsTrue();
     }
 
+    [Test]
+    public async Task EveryDatabaseHasWriteAndReadCasesInTheGlobalComparison()
+    {
+        var page = await BuildAsync(TestContext.Current!.Execution.CancellationToken);
+
+        foreach (var row in SiteResultsPage.Rows(page.Section()))
+        {
+            await Assert.That(row.Cells[Write].Length).IsGreaterThan(0);
+            await Assert.That(row.Cells[Read].Length).IsGreaterThan(0);
+        }
+    }
+
+    [Test]
+    public async Task VectorLoadingIsWritingAndVectorSearchIsReading()
+    {
+        var page = await BuildAsync(TestContext.Current!.Execution.CancellationToken);
+        var row = SiteResultsPage.Row(page.Section(), "all", "Qdrant");
+        var write = row.Cells[Write].Single(line => line.Nodes == 1);
+        var read = row.Cells[Read].Single(line => line.Nodes == 1);
+
+        await Assert.That(write.Status).IsEqualTo(SiteTokens.Passed);
+        await Assert.That(read.Status).IsEqualTo(SiteTokens.Passed);
+        await Assert.That(write.Value).IsEqualTo(row.Cells[SiteTokens.Load].Single(line => line.Nodes == 1).Value);
+        await Assert.That(read.Value).IsEqualTo(row.Cells[Search].Single(line => line.Nodes == 1).Value);
+    }
+
     [Test]
     public async Task TopologyChangeIsShownOnlyForTheSameCaseCoverage()
     {