vortex-data/vortex - CodSpeed

vortex

Blog Docs Changelog

Performance History

Latest Results

OnPair: regression tests for narrowed codes_offsets in filter Two tests rebuild a compressed array with `codes_offsets` deliberately narrowed (u32 → u16, then u32 → u8) — the shape the cascading compressor produces for short-row corpora — and assert that `<OnPair as FilterKernel>::filter` succeeds and returns the expected rows. Pre-fix (`as_slice::<u32>()` hard-coded), both tests panic with "Other error: Attempted to get slice of type u32 from array of type u16". Post-fix (match_each_integer_ptype! dispatch), both pass. Also drops a redundant function-scoped `use FilterKernel` since the trait is now imported at module scope. Signed-off-by: claude <claude@anthropic.com>

claude/vortex-array-rust-bindings-FQfIX

10 minutes ago

OnPair: fast LIKE on compressed codes (PrefixAutomaton + bloom + filter ptype fix) LIKE pushdown rewritten using OnPair's own ideas (see onpair_cpp/include/onpair/search/automata/prefix_automaton.h and …/aho_corasick_automaton.h): * `prefix%` PrefixAutomaton — LPM-tokenise the prefix, precompute `prefix_range` intervals for each query position via binary search over the lex-sorted dict. Per-row scan is `≤ q + 1` u16 comparisons + one interval check, no decode at all. ~7 ns/row on UrlLog 1M. * `%sub%` ContainsBloom — per-dict-entry bits for "this token contains the substring" and "some suffix of this token could start a cross-token match". Most rows resolve from the bloom alone; the rest fall through to per-row decode + memmem. * `'lit'` Token-equality (already pushed via Compare). Re-registers Like in PARENT_KERNELS. Also fixes a panic in the share-dict filter: "Attempted to get slice of type u32 from array of type u16" — codes_offsets can be narrowed by the cascading compressor. Read it through `match_each_integer_ptype!` instead of hard-coding `u32`. Local bench (UrlLog, 1M rows): like_prefix 7.2 ms (~7 ns/row) like_contains 24.1 ms (~24 ns/row, decode only when bloom uncertain) eq_constant 6.5 ms filter 5.2 ms Signed-off-by: claude <claude@anthropic.com>

claude/vortex-array-rust-bindings-FQfIX

15 minutes ago

Use async_fs file for java and python writes to avoid object_store buffering on local disks (#7920) Object store writes are tuned for multipart uploads, it's simpler to use std file for local writes Signed-off-by: Robert Kruszewski <github@robertk.io>

develop

21 minutes ago

OnPair: drop Like pushdown for now, keep Compare token-aware path The byte-streaming `prefix%` and per-row decode + memmem `%contains%` implementations were not consistently faster than canonicalize + scalar LIKE: the bulk 4×-unrolled decoder is hard to beat with per-row work. Drop Like from PARENT_KERNELS so the system falls through to canonicalize + scalar LIKE. Compare stays pushed: LPM-tokenise the literal once, then `&[u16]` equality on every row's `codes[lo..hi]` — no decode at all, ~7 ns/row. Tests still pass via the canonicalize fallback. A token-DFA implementation (FSST-style, EQSearch / PrefixAutomaton on tokens) is tracked for the next iteration. Signed-off-by: claude <claude@anthropic.com>

claude/vortex-array-rust-bindings-FQfIX

27 minutes ago

simplify Signed-off-by: Robert Kruszewski <github@robertk.io>

rk/parentexecute

27 minutes ago

Add epic issues agent skill Signed-off-by: Nicholas Gates <nick@nickgates.com>

ngates/add-epic-issues-skill

33 minutes ago

Add pruning aggregate functions Signed-off-by: Nicholas Gates <nick@nickgates.com>

ngates/stats-7707/min-max-aggregate-fns

36 minutes ago

Add built-in stats rewrite rules Signed-off-by: Nicholas Gates <nick@nickgates.com>

ngates/stats-7707/built-in-rewrite-rules

36 minutes ago

Latest Branches

0%

Add OnPair string compression encoding with predicate pushdown#7927

11 minutes ago

a1ba67f

claude/vortex-array-rust-bindings-FQfIX

-85%

Add TakeExecute implementation for FilterArray#7393

29 minutes ago

0af4aad

rk/parentexecute

-17%

Add epic issues agent skill#7936

34 minutes ago

d34f09f

ngates/add-epic-issues-skill

© 2026 CodSpeed Technology

Home Terms Privacy Docs