Последние новости
Every WHERE id = N query flows through codegen_select_full_scan(), which emits linear walks through every row via Rewind / Next / Ne to compare each rowid against the target. At 100 rows with 100 lookups, that is 10,000 row comparisons instead of roughly 700 B-tree steps. O(n²) instead of O(n log n). This is consistent with the ~20,000x result in this run.
，详情可参考有道翻译
hierarchy is organized by time scale—each additional level of the
https://www.fermyon.com/blog/webassembly-component-model