Find search matches through a text index
- github
- github/openchronology/timeline-app
- commit
- main
- github/athanclark
Search read every one of a timeline's search rows (often the whole table), so its cost grew with the timeline whatever it matched: 0.6-0.9 s at a million moments even for one moment's number. A GIN index on the search vectors, which the schema mirrors onto the retired versions forks read, makes a specific search 4-13 ms at a million moments on a fork as on its source. The query also ranks and counts the matches on narrow rows and reads only the page's whole, so broad searches no longer spill their text to disk to count it. Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_011fFY8eruEi1xAkkMBni13B https://github.com/openchronology/timeline-app/commit/677d8738636a18161ce1d7e5e172c5794241911a
Open Find search matches through a text index in the timeline