Files
zeekayandHanzo Dev 03c6289dfc A skeleton for sparse-basis indexes and part-level routing in a column store
Design, prior art and a measurement protocol for a weighted inverted index
over a mixed sparse basis and part-level routing before per-part HNSW in a
ClickHouse-derived store. Each component is marked prior art or proposed.
The protocol fits C(N) = aN^alpha to parts, granules and bytes touched per
correct answer at a held recall. No numbers: every results cell is a
placeholder read from results-data.tex until the baseline lane writes it.

Co-authored-by: Hanzo Dev <[email protected]>
2026-09-23 00:00:11 -07:00

71 lines
2.4 KiB
TeX

\section{Results}
\label{sec:results}
\emph{This section is a placeholder.} The lane that fills it is starting and
has written no results file, so every cell below prints \ph{} and no sentence
in this paper quotes a number. When the harness writes that file, these tables
fill from it and the conditions of the run appear in the captions.
\begin{table}[h]
\centering
\small
\setlength{\tabcolsep}{5pt}
\begin{tabular}{@{}lrrrrrrr@{}}
\toprule
& parts & granules & MiB & KiB/ans & recall@$k$ & p50 ms & p99 ms \\
\midrule
\multicolumn{8}{@{}l}{\textit{scan}} \\
\costrow{scan/1e5}{\quad $10^5$}
\costrow{scan/1e6}{\quad $10^6$}
\costrow{scan/1e7}{\quad $10^7$}
\midrule
\multicolumn{8}{@{}l}{\textit{base} --- upstream ClickHouse 26.4} \\
\costrow{base/1e5}{\quad $10^5$}
\costrow{base/1e6}{\quad $10^6$}
\costrow{base/1e7}{\quad $10^7$}
\costrow{base/1e8}{\quad $10^8$}
\costrow{base/1e9}{\quad $10^9$}
\midrule
\multicolumn{8}{@{}l}{\textit{route} --- sparse basis and part-level routing} \\
\costrow{route/1e5}{\quad $10^5$}
\costrow{route/1e6}{\quad $10^6$}
\costrow{route/1e7}{\quad $10^7$}
\costrow{route/1e8}{\quad $10^8$}
\costrow{route/1e9}{\quad $10^9$}
\midrule
\multicolumn{8}{@{}l}{\textit{oracle} --- the parts and granules holding the exact top-$k$} \\
\costrow{oracle/1e6}{\quad $10^6$}
\costrow{oracle/1e9}{\quad $10^9$}
\bottomrule
\end{tabular}
\caption{Cost at a held recall target, per query, averaged over the query set.
Host \res{run/host}; store \res{run/version}; $k = \res{run/k}$; recall target
\res{run/recall}; queries \res{run/queries}. Part counts at each size:
\res{run/parts/1e6} at $10^6$ and \res{run/parts/1e9} at $10^9$. Every cell is
empty until the harness writes it.}
\label{tab:cost}
\end{table}
\begin{table}[h]
\centering
\small
\begin{tabular}{@{}lllll@{}}
\toprule
& $\alpha$ parts & $\alpha$ granules & $\alpha$ bytes & $\alpha$ summaries \\
& per answer & per answer & per answer & per query \\
\midrule
\fitrow{base}{base}
\fitrow{route}{route}
\fitrow{oracle}{oracle}
\bottomrule
\end{tabular}
\caption{Fitted exponents of $C(N) = aN^{\alpha}$ for parts, granules and bytes
touched per correct answer, and for routing summaries examined per query, with
95\% bootstrap intervals over queries, at the recall target of
Table~\ref{tab:cost}. The
hypothesis of \S\ref{sec:setting} is a route row whose intervals lie below one
and whose oracle ratio does not grow; the local slopes behind each fit are
published with the run.}
\label{tab:fit}
\end{table}