react-virtualized

I mostly agree, but every now and then there is actually a good reason to override/re-implement them. For example, let us say you are using virtualized components [0], so all available elements have not necessarily been rendered to the DOM (making Control-F useless). [0] - https://github.com/bvaughn/react-virtualized

I recently wrote a somewhat performant react-virtualized[0] list for a project at work, though it's definitely a bit trickier in plain HTML/JS. As far as the XUL virtualized tree goes, a couple of Mozilla engineers wrote some examples using plain html/javascript + DOM node manipulation[1]. While promising, I can't imagine that this implementation could ever be as fast as the compiled C++ one[2]. [0]: https://github.com/bvaughn/react-virtualized [1]: http://benbucksch.github.io/trex/fastlist-test.html [2]: https://searchfox.org/mozilla-central/source/layout/xul/tree... https://news.ycombinator.com/item?id=14158170

I have a few suggestions regarding search performance. As others have mentioned, there isn't one "right answer" but there are a few nifty tricks you can use to boost performance. You could try a trigram index[0] as the primary search index. You'd loose stemming, but gain language support and indexed regular expression search which is a nice power user feature. Looking at your where clause, did you index language and textsearchable_index_col together ? If not, you are giving the planner the opportunity to skip your full text index. if you order by ts_rank_cd then the query will sort all rows, including those that don't match. A better pattern is to take the ranking score as a column and then sort it in a subquery. [1] from stack overlfow has an example. (As an aside, from pg2, CTEs are no longer an optimization fence, so you can write the