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.
FT Professional
。关于这个话题，PDF资料提供了深入分析
Google offered a few example scenarios. You might ask something like, "Who's the marketing lead for Project Clover?," "What's the latest deadline mentioned for Project X?" or "Summarize my unread chat messages from today." ，详情可参考电影
Global news & analysis